The vehicle routing problem of intercity ride-sharing between two cities
Authors:
- Jiaqi GuoJGJiaqi Guo
- Jiancheng LongJLJiancheng Long
- Xiaoming XuXXXiaoming Xu
- Miao YuMYMiao Yu
- Kai YuanKYKai Yuan
- 28 February 2022
- journal article
- research article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 158, 113-139
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- Ridesharing in North America: Past, Present, and FutureTransport Reviews, 2012
- Exact solutions to the double travelling salesman problem with multiple stacksNetworks, 2010
- Variable neighborhood search for the dial-a-ride problemComputers & Operations Research, 2010
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approachComputers & Operations Research, 2009
- The double travelling salesman problem with multiple stacks – Formulation and heuristic solution approachesEuropean Journal of Operational Research, 2009
- A variable neighbourhood search algorithm for the open vehicle routing problemEuropean Journal of Operational Research, 2009
- A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windowsTransportation Research Part B: Methodological, 2004
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-haulsJournal of Scheduling, 2002
- Solving the pickup and delivery problem with time windows using reactive tabu searchTransportation Research Part B: Methodological, 2000