An effective and fast heuristic for the Dial-a-Ride problem
- 26 July 2006
- journal article
- Published by Springer Science and Business Media LLC in 4OR
- Vol. 5 (1), 61-73
- https://doi.org/10.1007/s10288-006-0018-0
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms4OR, 2003
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectivesAnnals of Operations Research, 1995
- A Request Clustering Algorithm for Door-to-Door Handicapped TransportationTransportation Science, 1995
- A GRASP for the Vehicle Routing Problem with Time WindowsINFORMS Journal on Computing, 1995
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time WindowsAmerican Journal of Mathematical and Management Sciences, 1986
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960