A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- 16 October 2006
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 174 (2), 1117-1139
- https://doi.org/10.1016/j.ejor.2004.09.060
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- Artificial intelligence heuristics in solving vehicle routing problems with time window constraintsEngineering Applications of Artificial Intelligence, 2001
- Comparing descent heuristics and metaheuristics for the vehicle routing problemComputers & Operations Research, 2001
- Classical and modern heuristics for the vehicle routing problemInternational Transactions in Operational Research, 2000
- Solving the pickup and delivery problem with time windows using reactive tabu searchTransportation Research Part B: Methodological, 2000
- A new extension of local search applied to the Dial-A-Ride ProblemEuropean Journal of Operational Research, 1995
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986
- k-Interchange procedures for local search in a precedence-constrained routing problemEuropean Journal of Operational Research, 1983
- Optimization by Simulated AnnealingScience, 1983