Advertisement

Annals of Operations Research

, Volume 272, Issue 1–2, pp 243–272 | Cite as

A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem

  • Houda Derbel
  • Bassem Jarboui
  • Rim Bhiri
Advances in Theoretical and Applied Combinatorial Optimization
  • 178 Downloads

Abstract

This article considers the heterogeneous fleet vehicle routing problem, as a variant of a well-known transportation problem: the vehicle routing problem. In order to solve this particular routing problem, a variable neighborhood search with a threshold accepting mechanism is developed and implemented. The performance of the algorithm was compared to other algorithms and tested on datasets from the available literature. Computational results show that our proposed algorithm is competitive and generates new best solutions.

Keywords

Metaheuristics Heterogeneous fleet Routing Variable neighborhood search 

References

  1. Armas, J., & Melián-Batista, B. (2015). Variable neighborhood search for a dynamic rich vehicle routing problem with time windows. Computers and Industrial Engineering, 85, 120–131.CrossRefGoogle Scholar
  2. Baldacci, R., Battara, M., & Vigo, D. (2008). The vehicle routing problem: Latest advances and new challenges, chapter Routing a heterogeneous fleet of vehicles, 11–35. Berlin: Springer.Google Scholar
  3. Baldacci, R., & Mingozzi, A. (2009). A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming, 120, 347–380.CrossRefGoogle Scholar
  4. Brandao, J. (2009). A deterministic tabu search algorithm for the ÃŕnCeet size and mix vehicle routing problem. European Journal of Operational Research, 195, 716–728.CrossRefGoogle Scholar
  5. Brandao, J. (2011). A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers and Operations Research, 38, 140–151.CrossRefGoogle Scholar
  6. Choi, E., & Tcha, D.-W. (2007). A column generation approach to the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34, 2080–2095.CrossRefGoogle Scholar
  7. Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Oprations Research, 12, 568–581.CrossRefGoogle Scholar
  8. Coelho, V. N., Grasas, A., Ramalhinho, H., Coelho, I. M., Souza, M. J. F., & Cruz, R. C. (2016). An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints. European Journal of Operational Research, 250, 367–376.CrossRefGoogle Scholar
  9. Dondo, R., & Cerda, J. (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research, 176, 1478–1507.CrossRefGoogle Scholar
  10. Gillett, B. E., & Miller, L. R. (1974). A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22, 340–344.CrossRefGoogle Scholar
  11. Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Science, 8, 156–166.CrossRefGoogle Scholar
  12. Golden, B. L., Assad, A. A., Levy, L., & Gheysens, F. G. (1984). The fleet size and mix vehicle routing problem. Computers and Operation Research, 11, 49–66.CrossRefGoogle Scholar
  13. Hansen, P., Mladenović, N., & Moreno, Âă P J. (2010). Variable neighbourhood search: Methods and applications. Annals of Operations Research, 175, 367–407.CrossRefGoogle Scholar
  14. Koç, Ç., Bektaş, T., Jabali, O., & Laporte, G. (2016). Thirty years of heterogeneous vehicle routing. European Journal of Operational Research, 249, 1–21.CrossRefGoogle Scholar
  15. Imran, A., Salhi, S., & Wassan, N. A. (2009). A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 197, 509–518.CrossRefGoogle Scholar
  16. Lee, Y., Kim, J., Kang, K., & Kim, K. (2008). A heuristic for vehicle fleet mix problem using tabu search and set partitioning. Journal of the Operational Research Society, 59, 833–841.CrossRefGoogle Scholar
  17. Li, F., Golden, B., & Wasil, E. (2007). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34, 2734–2742.CrossRefGoogle Scholar
  18. Li, X., Tian, P., & Aneja, Y. (2010). An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Part E: Logistics and Transportation Review, 46, 1111–1127.CrossRefGoogle Scholar
  19. Lin, S. (1965). Computers solutions of the traveling salesman problem. Bell System Technical Journal, 44, 2245–2269.CrossRefGoogle Scholar
  20. Liu, J., Smith, A. E., & Qian, D. (2016). The vehicle loading problem with a heterogenous transport fleet. Computers and Industrial Engineering, 97, 137–145.CrossRefGoogle Scholar
  21. Liu, S. (2013). A hybrid population heuristic for the heterogeneous vehicle routing problems. Transportation Research Part E, 54, 67–78.CrossRefGoogle Scholar
  22. Melian, B., & Mladenović, N. (2007). Applications of variable neighborhood search. IMA Journal of Management Mathematics, 18, 99–221.CrossRefGoogle Scholar
  23. Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24, 1097–100.CrossRefGoogle Scholar
  24. Penna, P., Subramanian, A., & Ochi, L. (2013). An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, 19, 201–232.CrossRefGoogle Scholar
  25. Prins, C. (2002). Efficient heuristics for the heterogeneous fleet multitrip vrp with application to a large-scale real case. Journal of Mathematical Modelling and Algorithms, 1, 135–150.CrossRefGoogle Scholar
  26. Prins, C. (2009). Engineering applications of artiïňĄcial intelligence. Two Memetic Algorithms for Heterogeneous Fleet Vehicle Routing Problems, 22, 916–928.Google Scholar
  27. Rahmani, D., & Ramezanian, R. (2016). A stable reactive approach in dynamic flexible flow shop scheduling with unexpected disruptions. Computers and Industrial Engineering, 98, 360–372.CrossRefGoogle Scholar
  28. Salhi, S., & Sari, M. (1997). A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research, 103, 95–112.CrossRefGoogle Scholar
  29. Soylu, B. (2015). A general variable neighborhood seaerch heuristic for multiple traveling salesman problem. Computers and Industrial Engineering, 90, 390–401.CrossRefGoogle Scholar
  30. Subramanian, A., Vaz Penna, P., Uchoa, E., & Ochi., L. (2012). A hybrid algorithm for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 221, 285–295.CrossRefGoogle Scholar
  31. Subramanian, A., Penna, P.H.V., Uchoa, E., & Ochi, L.S. (2012). A hybrid algorithm for the fleet size and mix vehicle routing problem. In International conference on industrial engineering and systems management.Google Scholar
  32. Taillard, E. D. (1999). A heuristic column generation method for heterogeneous fleet VRP. RAIRO. Rech. Opér., 33, 1–14.CrossRefGoogle Scholar
  33. Tarantilis, C., Kiranoudis, C., & Vassiliadis, V. (2003). A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Journal of the Operational Research Society, 54, 65–71.CrossRefGoogle Scholar
  34. Tarantilis, C., Kiranoudis, C., & Vassiliadis, V. (2004). A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research, 152, 148–158.CrossRefGoogle Scholar
  35. Tarantilis, C. D., & Kiranoudis, C. T. (2007). A flexible adaptive memory-based algorithm for reallife transportation operations: Two case studies from diary and construction company. European Journal of Operational Research, 179, 806–822.CrossRefGoogle Scholar
  36. Teodorovic, D., Krcmarnozic, E., & Pavkovic, G. (1995). The mixed fleet stochastic vehicle routing problem. Transportation Planning and Technology, 19, 31–34.CrossRefGoogle Scholar
  37. Yaman, H. (2006). Formulations and valid inequalities for the heterogeneous vehicle routing problem. Mathematical Programming, 106, 365–390.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.MODILS, FSEGSSfaxTunisia
  2. 2.Emirates College of TechnologyAbu DhabiUnited Arab Emirates

Personalised recommendations