Wenyi Chen
Research Subjects
Wenyi Chen has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Marco Schutten
University of Twente
2 shared publications - Martijn Mes
Department of High-Tech Business and Entrepreneurship , University of Twente , Enschede , 7500 AE , Netherlands , utwente.nl
2 shared publications Beste Kucukyazici
1 shared publication- Beste Kucukyazici
Eli Broad College of Business, Michigan State University, East Lansing, Michigan 48824
1 shared publication Jianmai Shi
College of System Engineering, National University of Defense Technology, Changsha, Hunan 410073, China
1 shared publicationJob Quint
Department of Industrial Engineering and Business Information System, University of Twente, 7522 NB Enschede, Netherlands
1 shared publication
Latest Publications
- 1 February 2020
- Published by Elsevier in Waste Management
- Vol. 102, 65-75
Bi-objective design of household E-waste collection with public advertising and competition from informal sectors
- 1 February 2020
- Published by Elsevier in Waste Management
- Vol. 102, 65-75
Bi-objective design of household E-waste collection with public advertising and competition from informal sectors
- 1 March 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 53 (2) , 401-426
A Ride-Sharing Problem with Meeting Points and Return Restrictions
Ride sharing has been widely acknowledged as an effective solution for reducing travel costs, congestion, and pollution. This paper considers the ride-sharing problem of the scheduled commuter and business traffic within a closed community of companies that agree to share the calendars of their employees. We propose a formulation in the form of a general integer linear program (ILP) for the aforementioned ride-sharing problem, which incorporates return restrictions to satisfy the business needs, as well as meeting points and the option for riders to transfer between drivers. All the instances with 40 and 60 participants and most of the instances with 80 participants can be solved to optimality within a time limit of two hours. Using instances of up to 100 participants, the ILP can be solved with a gap of no more than 1.8% within the time limit. Because of the high computational complexity, we develop a constructive heuristic that is based on the savings concept. This heuristic is also able to combine ride sharing with the use of an external mobility service provider. Our numerical study shows that ride sharing can be an effective way of reducing the number of trips and vehicle miles. Particularly, ride sharing creates more benefits when the participation is high and when the origins and the destinations of the trips are more spatially concentrated. The results show that ride sharing can create up to 31.3% mileage savings and up to 28.7% reduction in the number of cars needed to fulfill employees’ travel schedules. We also illustrate our model using a real-life ride-sharing problem of a Dutch consultancy and research firm. The online appendix is available at https://doi.org/10.1287/trsc.2018.0832 .
- 1 March 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 53 (2) , 401-426
A Ride-Sharing Problem with Meeting Points and Return Restrictions
Ride sharing has been widely acknowledged as an effective solution for reducing travel costs, congestion, and pollution. This paper considers the ride-sharing problem of the scheduled commuter and business traffic within a closed community of companies that agree to share the calendars of their employees. We propose a formulation in the form of a general integer linear program (ILP) for the aforementioned ride-sharing problem, which incorporates return restrictions to satisfy the business needs, as well as meeting points and the option for riders to transfer between drivers. All the instances with 40 and 60 participants and most of the instances with 80 participants can be solved to optimality within a time limit of two hours. Using instances of up to 100 participants, the ILP can be solved with a gap of no more than 1.8% within the time limit. Because of the high computational complexity, we develop a constructive heuristic that is based on the savings concept. This heuristic is also able to combine ride sharing with the use of an external mobility service provider. Our numerical study shows that ride sharing can be an effective way of reducing the number of trips and vehicle miles. Particularly, ride sharing creates more benefits when the participation is high and when the origins and the destinations of the trips are more spatially concentrated. The results show that ride sharing can create up to 31.3% mileage savings and up to 28.7% reduction in the number of cars needed to fulfill employees’ travel schedules. We also illustrate our model using a real-life ride-sharing problem of a Dutch consultancy and research firm. The online appendix is available at https://doi.org/10.1287/trsc.2018.0832 .
- Open Access
- 12 January 2017
- Published by Springer Nature in Flexible Services and Manufacturing Journal
- Vol. 30 (3) , 517-553
Multi-hop driver-parcel matching problem with time windows
- 12 January 2017
- Published by Springer Nature in Flexible Services and Manufacturing Journal
- Vol. 30 (3) , 517-553
Open AccessMulti-hop driver-parcel matching problem with time windows
- 1 August 2016
- Published by Elsevier in European Journal of Operational Research
- Vol. 253 (1) , 242
Erratum to `Supply chain design for unlocking the value of remanufacturing under uncertainty' [EJOR 247 (2015) 804–819]
- 1 August 2016
- Published by Elsevier in European Journal of Operational Research
- Vol. 253 (1) , 242
Erratum to `Supply chain design for unlocking the value of remanufacturing under uncertainty' [EJOR 247 (2015) 804–819]
- 1 December 2015
- Published by Elsevier in European Journal of Operational Research
- Vol. 247 (3) , 804-819
Supply chain design for unlocking the value of remanufacturing under uncertainty
- 1 December 2015
- Published by Elsevier in European Journal of Operational Research
- Vol. 247 (3) , 804-819
Supply chain design for unlocking the value of remanufacturing under uncertainty