A chance-constrained dial-a-ride problem with utility-maximising demand and multiple pricing structures
Authors:
- Xiaotong DongXDXiaotong Dong
- Joseph Y.J. ChowJCJoseph Y.J. Chow
- S. Travis WallerSWS. Travis Waller
- David ReyDRDavid Rey
- 29 January 2022
- journal article
- research article
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 158
Abstract
No abstract availableKeywords
All Related Versions
This publication has 39 references indexed in Scilit:
- Hybrid column generation and large neighborhood search for the dial-a-ride problemComputers & Operations Research, 2013
- Multimodal Transport Pricing: First Best, Second Best and Extensions to Non-motorized TransportTransport Reviews, 2012
- The capacitated team orienteering and profitable tour problemsJournal of the Operational Research Society, 2009
- Solving the Dial-a-Ride problem using genetic algorithmsJournal of the Operational Research Society, 2007
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraintsEuropean Journal of Operational Research, 2006
- 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
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- The Values of Waiting Time, Travel Time, and a Seat on a BusThe RAND Journal of Economics, 1987
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986