The Dial-A-Ride Problem with Transfers
Authors:
- Renaud MassonRMRenaud Masson
- Fabien LehuédéFLFabien Lehuédé
- Olivier PétonOPOlivier Péton
- 1 January 2014
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 41, 12-23
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Hybrid column generation and large neighborhood search for the dial-a-ride problemComputers & Operations Research, 2013
- Shortest-path feasibility algorithmsACM Journal of Experimental Algorithmics, 2009
- Quality of service in dial-a-ride operationsComputers & Industrial Engineering, 2009
- Worst Case Analysis for Pickup and Delivery Problems with TransferIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008
- The splittable pickup and delivery problem with reloadsEuropean J. of Industrial Engineering, 2008
- Real-time split-delivery pickup and delivery time window problems with transfersCentral European Journal of Operations Research, 2007
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- Design and Operational Concepts of High-Coverage Point-to-Point Transit SystemTransportation Research Record: Journal of the Transportation Research Board, 2002
- Multicriteria pickup and delivery problem with transfer opportunityComputers & Industrial Engineering, 1996
- Deciding Linear Inequalities by Computing Loop ResiduesJournal of the ACM, 1981