A Hybrid Metaheuristic Approach to Solve the Vehicle Routing Problem with Time Windows

Arthur T. Gómez, Cristiano Galafassi, Leonardo Chiwiacowsky

Abstract

This paper addresses the Capacitated Vehicle Routing Problem with Time Windows, with constraints related to the vehicle capacity and time windows for customer service. To solve this problem two different metaheuristics are used: Tabu Search and Genetic Algorithms. Based on these techniques a hybrid algorithm is developed. The main goal is the development of a Hybrid Algorithm focused on the Vehicle Routing Problem which uses the intensification power of the Tabu Search and the diversification power of the Genetic Algorithms, in order to obtain good quality solutions without compromising the computational time. In the experiments are combined policies of diversification and intensification in Tabu Search and Genetic Algorithm to verify the efficiency and robustness of the proposed hybrid algorithm. Finally, the results are compared with the best heuristic and exact methods results found in the literature. The Hybrid Algorithm here proposed shows efficiency and robustness, with several optimal solutions achieved.

References

  1. Barbarosoglu, G., Ozgur, D., 1999, A tabu search algorithm for the vehicle routing problem. Computers and Operations Research v.26, p.255- 270.
  2. Bartholdi, J. J., Platzman, L. K., Lu, C.R., Warden, W.W., 1983. A minimal technology routing system for meals on wheels. Interfaces. v.13, p.1-8.
  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 v.10, p.69-211.
  4. Bräysy, O., 2005. A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows. Working paper, Defense Research Establishment Valcartier, Canada.
  5. Ceder, A., Sterny, H. I., 1981, Deficit Function Bus Scheduling with Deadheading trip insertion for fleet size reduction. Transportation Science v.15, p.338- 363.
  6. Christofides, N., Mingozzi, A., Toth, P.,1979. The vehicle routing problem. Combinatorial Optimization, Wiley, Chichester, UK, p. 315-338.
  7. Cordeau, J. F., Desaulniers, G., Desrosiers, J., Solomon, M. M., Soumis, F., 2003, VRP with Time Windows. In: Toth, P. Vigo, D., The Vehicle Routing Problem, Society for Industrial and Applied Mathematics, Philadelphia.
  8. Cordeau, J. F., Laporte , G., Mercier, A., 2001. A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows. Journal of the Operational Research Society, v.52, p.928-936.
  9. Dantzig, G. B., Ramser, J. H., 1959. The truck dispatching problem. Management Science, v.6, p.80-91.
  10. De Jong, K. A.,1975. Genetic Algorithms in Search, Optimization, and Machine Learning. AddisonWesly, Reading, Massachusetts.
  11. Dell'amico, M., Monaci, M., Pagani, C., Vigo, D., 2007. Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows. Transportation Science, v.41, p. 516-526.
  12. Geiger, M., 2008. Genetic Algorithms for multiple objective vehicle routing. Proceedings of the Metaheuristics International Conference, p.349-353.
  13. 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 v.10, p.69-211.
  14. Golden, B. L., Magnanti, T. L., Nguyen, H.Q., 1977. Implementing Vehicle Routing Algorithms. Networks v.7, p.113-148.
  15. Jiang, H., Barnhart, C., 2009. Dynamic Airline Scheduling. Transportation Science, v.43, p. 336- 354.
  16. Kulcart, T. Optimizing Solid Waste Collection in Brussels, 1996, European Journal of Operational Research. v.90, p.71-77.
  17. Laporte, G.,1992. The Vehicle Routing Problem: An overview of exact and approximate algorithms. European Journal of operational Research v.59, p.345-458.
  18. Laporte, G., 2009. Fifty Years of Vehicle Routing. Transportation Science. v43, p. 408-416.
  19. Malmborg, C. J., Simons, G. R., 1989. Integrating logistical and Processing Functions through mathematical modeling. Applied Mathematical Modelling v.13, n6, p.357-364.
  20. Newton, R., Thomas,W., 1974. Bus Routing in Multischoll System. Computers and Operational Research, v.1, p.213-222.
  21. Perls, J., Daskin, M. S. 1985, A warehouse locationrouting problem. Transportation Research, v.19B, p.381-396.
  22. Ralph, T. K., Kopman, L., Pulleyblank, W. R., Trotter, L. E., 2001. On the Capacitated Vehicle Routing Problem. Mathematical programming, v.94, p.343- 359.
  23. Rochat, Y., Taillard, E. D., 1995. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, v.1, p.147- 167.
  24. Ropke, S., Cordeau, J. F., 2009. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows. Transportation Science, v.43, p.267- 286.
  25. Solomon, M., 1987, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, v. 35, p254 - 265.
  26. Taillard, D., 1995. Parallel iterative search methods for the vehicle routing problems. Networks v.23, p.661- 673.
  27. Taillard, E., Badeau, P., Gendreau, M., Geurtin, F., Potvin, J.Y., 1997. A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows. Transportation Science, v. 31, p. 170-186.
  28. Thangiah, S. R., Petrovic, P., 1997. Introduction to Genetic Heuristics and vehicle Routing Problems with Complex Constraints. In: Advances in Computational and Stochastic Optimization, Logic programming, and Heuristic search. Kluwer Academic Publishers.
  29. Timlin, M. T., Pulleyblank,W.R., 1990. Precedence Constrained Routing and Helicopter Scheduling: Heuristic Design. Interfaces, v. 22, p. 100-111.
  30. Toth, P., Vigo, D., 2002. Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics v.123, p.487-512.
Download


Paper Citation


in Harvard Style

Gómez A., Galafassi C. and Chiwiacowsky L. (2012). A Hybrid Metaheuristic Approach to Solve the Vehicle Routing Problem with Time Windows . In Proceedings of the 9th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8565-21-1, pages 183-188. DOI: 10.5220/0004030001830188


in Bibtex Style

@conference{icinco12,
author={Arthur T. Gómez and Cristiano Galafassi and Leonardo Chiwiacowsky},
title={A Hybrid Metaheuristic Approach to Solve the Vehicle Routing Problem with Time Windows},
booktitle={Proceedings of the 9th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2012},
pages={183-188},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004030001830188},
isbn={978-989-8565-21-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - A Hybrid Metaheuristic Approach to Solve the Vehicle Routing Problem with Time Windows
SN - 978-989-8565-21-1
AU - Gómez A.
AU - Galafassi C.
AU - Chiwiacowsky L.
PY - 2012
SP - 183
EP - 188
DO - 10.5220/0004030001830188