A tabu search heuristic for the static multi-vehicle dial-a-ride problem
Top Cited Papers
- 31 July 2003
- journal article
- Published by Elsevier BV in Transportation Research Part B: Methodological
- Vol. 37 (6), 579-594
- https://doi.org/10.1016/s0191-2615(02)00045-0
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms4OR, 2003
- Scheduling dial-a-ride paratransit under time-varying, stochastic congestionTransportation Research Part B: Methodological, 2002
- 9. VRP with Pickup and DeliveryPublished by Society for Industrial & Applied Mathematics (SIAM) ,2002
- A unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society, 2001
- A tabu search heuristic for periodic and multi-depot vehicle routing problemsNetworks, 1997
- A Request Clustering Algorithm for Door-to-Door Handicapped TransportationTransportation Science, 1995
- A Tabu Search Heuristic for the Vehicle Routing ProblemManagement Science, 1994
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 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