COMPARYING A TABU SEARCH PROCESS - Using and Not Using and Intensification Strategy to Solve the Vehicle Routing Problem

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

Abstract

In this paper we propose a Tabu Search algorithm to solve the Vehicle Routing Problem. The Vehicle Routing Problem are usually defined as the problem that concerns in creation of least cost routs to serve a set of clients by a fleet of vehicles. We develop an intensifications strategy to diversify the neighbours generated and to increase the neighbourhood size. We had done experiments using and not using the intensification strategy to compare the performance of the search. The experiments we had done showed that an intensification strategy allows an increase on the solutions quality.

References

  1. Ballou, R.H. 2001 Gerenciamento da cadeia de Suprimentos - Planejamento, Organização e Logística Empresarial, 4Ed, Porto Alegre: Bookman
  2. Barbarasoglu,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. Cook,W.J, Cunningham, W.H, Pulleyblank, W.R, Schrijver, A.1998. Combinatorial Optimization. Willey
  7. 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
  8. Gendreau, M.,Hertz, A.,Laporte, G. 1994 “A Tabu Search Heuristic for the Vehicle Routing Problem”. Management Science, 40, 1276-1290.
  9. Gillet, B.E, Miller, L.R.1974 “A heuristic algorithm for the vehicle dispatch problem” Operations Research 22, 240-349.
  10. Glover,F.1989 “Tabu Search - parte 1”. ORSA Journal on Computing v.1, n.3.
  11. Glover,F.,Laguna,M..1997 Tabu Search. Kluwer Academic Publishers.
  12. 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
  13. Laporte, G. 1992. “The Vehicle Routing Problem: An overview of exact and approximate algorithms”. European Journal of operational Research 59,345-458
  14. 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
  15. Lentra,J.K, Rinnoy K., G. 1981 “Complexity of Vehicle Routing and Scheduling Problems” Networks 11,221- 227
  16. Mole,R.H, Jamenson, S.R. 1976 “A sequential route - building algorithm employing a generalized savings criterion” Operations Research Quarterly 27,503-511
  17. Osman, I; Laporte,G.1996 Metaheuristics: A bibliography. Annals of Operations Research 63, 513-628.
  18. Pureza V.M., França, P.M. 1991.“Vehicle routinh problems via tabu search metaheuristic, Publication CRT-747, Centre de recherché sur les transports, Montreal.
  19. Rego, C. 1998 “A Subpath Ejection Method for the Vehicle Routing Problem”, Management Science, 44, 1447-1459.
  20. Tarantilis, C.D; Ioannou, G; Prastacos, G. 2005 “Advanced vehicle routing algorithms for complex operations management problems” Journal of Food Engineerig, 70:455-471.
  21. 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.
  22. Toth, P., Vigo, D. 2003 “Models, relaxations and exact approachs for the capacitated vehicle routing problem” Discrete Applied Mathematics 123, 487-512
  23. Tyagi, M. 1968 “A Pratical Method for the Truck Dispatching Problem”. J. of the Operations Research Society of Japan, 10,76-92
  24. Xu, J., Kelly, James P. 1996 “A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem” Transportation Science 30, 379-393
  25. Willard, A.G. “Vehicle routinh using r-optimal tabu search”.MSc.Disseration, The Management School, Imperial College, London (1989)
Download


Paper Citation


in Harvard Style

Pozzobom Lazzeris Simas E. and Tórgo Gómez A. (2007). COMPARYING A TABU SEARCH PROCESS - Using and Not Using and Intensification Strategy to Solve the Vehicle Routing Problem . In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-972-8865-82-5, pages 77-84. DOI: 10.5220/0001638700770084


in Bibtex Style

@conference{icinco07,
author={Etiene Pozzobom Lazzeris Simas and Arthur Tórgo Gómez},
title={COMPARYING A TABU SEARCH PROCESS - Using and Not Using and Intensification Strategy to Solve the Vehicle Routing Problem},
booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2007},
pages={77-84},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001638700770084},
isbn={978-972-8865-82-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - COMPARYING A TABU SEARCH PROCESS - Using and Not Using and Intensification Strategy to Solve the Vehicle Routing Problem
SN - 978-972-8865-82-5
AU - Pozzobom Lazzeris Simas E.
AU - Tórgo Gómez A.
PY - 2007
SP - 77
EP - 84
DO - 10.5220/0001638700770084