A new extension of local search applied to the Dial-A-Ride Problem
- 18 May 1995
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 83 (1), 83-104
- https://doi.org/10.1016/0377-2217(93)e0292-6
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- An efficient implementation of local search algorithms for constrained routing problemsEuropean Journal of Operational Research, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- STABULUS: A technique for finding stable sets in large graphs with tabu searchComputing, 1989
- Simulated Annealing – An Annotated BibliographyAmerican Journal of Mathematical and Management Sciences, 1988
- Using tabu search techniques for graph coloringComputing, 1987
- k-Interchange procedures for local search in a precedence-constrained routing problemEuropean Journal of Operational Research, 1983
- Optimization by Simulated AnnealingScience, 1983
- Scheduling Dial-a-Ride Transportation SystemsTransportation Science, 1978
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965