The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

References

• Aarts E. H., Lenstra J. K.Local Search in Combinatorial Optimization (1997) (Wiley, Chichester, UK) Google Scholar
• Christofides N., Eilon S. An algorithm for the vehicle dispatching problem. Oper. Res. Quart. (1969) 20:309–318Crossref, Google Scholar
• Christofides N., Mingozzi A., Toth P., Christofides N., Mingozzi A., Toth P., Sandi C. The vehicle routing problem. Combinatorial Optimization (1979) (Wiley, Chichester, UK) 315–338Google Scholar
• Clarke G., Wright J. W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. (1964) 12:568–581Link, Google Scholar
• Dongarra J. J. Performance of various computers using standard linear equations software. (2001) . Technical report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TNGoogle Scholar
• Fisher M. L. Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. (1994) 42:626–642Link, Google Scholar
• Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Sci (1994) 40:1276–1290Link, Google Scholar
• Gendreau M., Laporte G., Potvin J-Y., Aarts E. H., Lenstra J. K. Vehicle routing: Modern heuristics. Local Search in Combinatorial Optimization (1997) (Wiley, Chichester, UK) 311–336Google Scholar
• Glover F. Tabu search—Part I. ORSA J. Comput. (1989) 1:190–206Link, Google Scholar
• Glover F., Barr R. S., Helagson R. V., Kennington J. L. Tabu search and adaptive memory programming—Advances, applications and challenges. Interfaces in Computer Science and Operations Research (1996) (Kluwer, Boston, MA) 1–75Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer, Boston, MA) Crossref, Google Scholar
• Golden B. L., Wasil E. A., Kelly J. P., Chao I., Crainic T. G., Laporte G. The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. Fleet Management and Logistics (1998) (Kluwer, Boston, MA) 33–56Crossref, Google Scholar
• Johnson D. S., McGeoch L. A., Aarts E. H., Lenstra J. K. The traveling salesman problem: A case study. Local Search in Combinatorial Optimization (1997) (Wiley, Chichester, UK) 215–310Google Scholar
• Kindervater G. A. P., Savelsbergh M. W. P., Aarts E. H., Lenstra J. K. Vehicle routing: Handling edge exchanges. Local Search in Combinatorial Optimization (1997) (Wiley, Chichester, UK) 337–360Google Scholar
• Laporte G., Dell'Amico M., Maffioli F., Martello S. Vehicle routing. Annotated Bibliographies in Combinatorial Optimization (1997) (Wiley, Chichester, UK) 223–240Google Scholar
• Laporte G., Gendreau M., Potvin J-Y., Semet F. Classical and modern heuristics for the vehicle routing problem. Internat. Trans. Oper. Res. (2000) 7:285–300Crossref, Google Scholar
• Or I. Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking. (1976) . Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, ILGoogle Scholar
• Osman I. H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. (1993) 41:421–451Crossref, Google Scholar
• Rego C., Roucairol C., Osman I. H., Kelly J. P. A parallel tabu search algorithm using ejection chains for the vehicle routing problem. Meta-heuristics: Theory & Applications (1996) (Kluwer, Boston, MA) Crossref, Google Scholar
• Rochat Y., Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1:147–167Crossref, Google Scholar
• Taillard E. Parallel iterative search methods for vehicle routing problem. Networks (1993) 23:661–673Crossref, Google Scholar
• Toth P., Vigo D. A granular tabu search algorithm for constrained arborescence problems. Proc. 16th Internat. Sympos. Math. Programming (1997) (Lausanne, Switzerland) 277–278Google Scholar
• Toth P., Vigo D., Crainic T. G., Laporte G. Exact solution of the vehicle routing problem. Fleet Management and Logistics (1998) (Kluwer, Boston, MA) 1–31Crossref, Google Scholar
• Toth P., Vigo D.The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications (2002) (SIAM, Philadelphia, P A) Crossref, Google Scholar
• Vigo D. A heuristic algorithm for the asymmetric capacitated vehicle routing problem. Eur. J. Oper. Res. (1996) 89:108–126Crossref, Google Scholar
• Xu J. (1998) . Personal communicationGoogle Scholar
• Xu J., Kelly J. A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Sci (1996) 30:379–393Link, Google Scholar