A SOLUTION TO THE VEHICLE ROUTING PROBLEM USING TABU SEARCH

Etiene Pozzobom Lazzeris Simas, Arthur Tórgo Gómez

Abstract

This paper presents a model for solving the Vehicle Routing Problem using Tabu Search. The Vehicle Routing Problem aims to serve a set of clients by a fleet of vehicle through the creation of least-cost routes that satisfy some constraints. In this paper, only the vehicle capacity is considered. The objective of this model is to design least-cost routes to serve a set of clients with known demands in such a way that some defined constraints are satisfied. An application to construct this model is proposed using Tabu Search. Some experiments were generated and confirmed that an increase in diversification on search space politics can generate results that are more qualified.

References

  1. Ballou, R.H. 2001 Gerenciamento da cadeia de Suprimentos - Planejamento, Organização e Logística Empresarial, 4Ed, Porto Alegre: Bookman
  2. Barbarasogju,G., Ozgur, D. 1999. “A tabu search algorithm for the vehicle routing problem”, Computers & Operations Research 26, 255-270
  3. Bodin, L.D, Golden, B.L., Assad, A.A., Ball, M.O. 1983 “Routing and Scheduling of vehicles and crews: The State of the Art”. Computers and Operations Research 10, 69-211
  4. Clarke, G, Wright, J.W. 1964 “Scheduling of vehicles from a central depot to a number of delivery points”. Operations Research 12: 568-581
  5. Christofides, N.; Mingozzi, A.; Toth, P.1979. The Vehicle Routing Problem.In: Christofides, Nicos. Combinatorial Optimization UMI, 1979
  6. Christofides, N.,Eilon, S. 1969 “An Algorithm for the vehicle Dispatching Problem”. Operational Research Quartely, Vol. 20, N.3
  7. Cook,W.J, Cunningham, W.H, Pulleyblank, W.R, Schrijver, A.1998. Combinatorial Optimization. Willey
  8. Cordeau, J-F., Gendreau, M., Laporte, G., Potvin, J.-Y., & Semet, F. 2002. A guide to vehicle routing heuristics. Journal of the Operational Research Society, 53,512- 522
  9. Desrochers, M., Verhoog, T.W. 1989. “A Matching Based savings Algorithm for the Vehicle Routing Problem” Cahier du GERAD G-89-04. École des Haustes Études Commerciales de Montréal
  10. Gillet, B.E, Miller, L.R.1974 “A heuristic algorithm for the vehicle dispatch problem” Operations Research 22, 240-349.
  11. Glover,F.1989 “Tabu Search - parte 1”. ORSA Journal on Computing v.1, n.3.
  12. Glover,F., Laguna,M..1997 Tabu Search. Kluwer Academic Publishers.
  13. Ho, S.C.,Haugland, D. 2004 “A tabu search heuristic for the vehicle routing problem with time windows and split deliveries” Computers & Operations Research 31, 1947-1964
  14. Laporte, G. 1992. “The Vehicle Routing Problem: An overview of exact and approximate algorithms”. European Journal of operational Research 59,345-458
  15. Laporte, G., Semet, F. 1998 "Classical Heuristics for the Vehicle Routing Problem". Les Cahiers du GERAD, G98-54, Group for Research in Decision Analysis, Montreal, Canada. 1998
  16. Laporte,G., Gendreau,M., Potvin,J., Semet, F.2000 “Classical and modern heuristics for the vehicle routing problem” Intl.Trans. in Op. Res 7,285-300
  17. Lentra,J.K, Rinnoy K., G. 1981 “Complexity of Vehicle Routing and Scheduling Problems” Networks 11,221- 227
  18. Mole,R.H, Jamenson, S.R. 1976 “A sequential routebuilding algorithm employing a generalized savings criterion” Operations Research Quarterly 27,503-511
  19. Nelson, M.D, Nygard, K.E., Griffin, J.H.,Shreve, W.E. 1985 “Implementing Techniques for the vehicle routing problem” Computers & Operations Research 12,273-283
  20. Osman, I; Laporte,G.1996 Metaheuristics: A bibliography. Annals of Operations Research 63, 513-628.
  21. Tarantilis, C.D; Ioannou, G; Prastacos, G. 2005 “Advanced vehicle routing algorithms for complex operations management problems” Journal of Food Engineerig, 70:455-471.
  22. Thangiah, S.R., Petrovik, P. 1997 Introduction to Genetic Heuristics and vehicle Routing Problems with Complex Constraints.In: Woodruff, David, L. Advances in Computacional and Stochastic Optimization, Logic programming , and Heuristic search: Interfaces in Computer Science and Operations research. Kluwer Academic Publishers.
  23. Toth, P., Vigo, D. 2002 “Models, relaxations and exact approachs for the capacitated vehicle routing problem” Discrete Applied Mathematics 123, 487-512
  24. Tyagi, M. 1968 “A Pratical Method for the Truck Dispatching Problem”. J. of the Operations Research Society of Japan, 10,76-92
  25. Viana, Valdisio. 1998 Meta-heurísticas e Programação Paralela em Otimização Combinatória. Fortaleza: EUFC
  26. Xu, J., Kelly, James P. 1996 “A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem” Transportation Science 30, 379-393.
Download


Paper Citation


in Harvard Style

Pozzobom Lazzeris Simas E. and Tórgo Gómez A. (2006). A SOLUTION TO THE VEHICLE ROUTING PROBLEM USING TABU SEARCH . In Proceedings of the Third International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-972-8865-59-7, pages 76-81. DOI: 10.5220/0001212000760081


in Bibtex Style

@conference{icinco06,
author={Etiene Pozzobom Lazzeris Simas and Arthur Tórgo Gómez},
title={A SOLUTION TO THE VEHICLE ROUTING PROBLEM USING TABU SEARCH},
booktitle={Proceedings of the Third International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2006},
pages={76-81},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001212000760081},
isbn={978-972-8865-59-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - A SOLUTION TO THE VEHICLE ROUTING PROBLEM USING TABU SEARCH
SN - 978-972-8865-59-7
AU - Pozzobom Lazzeris Simas E.
AU - Tórgo Gómez A.
PY - 2006
SP - 76
EP - 81
DO - 10.5220/0001212000760081