A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints
- 30 November 1994
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 21 (9), 1025-1033
- https://doi.org/10.1016/0305-0548(94)90073-6
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Solving real-life vehicle routing problems efficiently using tabu searchAnnals of Operations Research, 1993
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windowsEuropean Journal of Operational Research, 1993
- An efficient implementation of local search algorithms for constrained routing problemsEuropean Journal of Operational Research, 1990
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Survey Paper—Time Window Constrained Routing and Scheduling ProblemsTransportation Science, 1988
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window ConstraintsOperations Research, 1987
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965