Advertisement

Combining Exact Methods to Construct Effective Hybrid Approaches to Vehicle Routing

  • Rym M’HallahEmail author
Chapter
Part of the Women in Engineering and Science book series (WES)

Abstract

This chapter proposes a new research direction whose viability is due to advances of computing technologies. It combines mixed integer and constraint programming in different ways in quest of effective search techniques. It uses exact approaches as approximate ones not only by imposing runtime and bounding limits, but also by relaxing the mathematical models in a non-classical way. For example, it augments the model with “non-traditional constraints,” substitutes hard constraints with “easier” ones, and limits the search space to neighborhoods that may contain the optimum. The resulting search techniques offer industries a competitive edge by identifying near-optimal solutions to complex problems and providing them, at no investment cost, with feasible/directly implementable solutions to realistic instances (not to their abstract/simplified form). This chapter illustrates such benefits on a very difficult industrial engineering problem: vehicle routing with multiple time windows. This problem has a compounded difficulty. It involves two NP-hard subproblems: routing and scheduling. Solving its real-life instances is almost impossible. However, good quality solutions may be obtained in reasonable times via the proposed technique.

References

  1. Adewumi AO, Adeleke OJ (2018) A survey of recent advances in vehicle routing problems. Int J Syst Assur Eng Manag 9(1):155–172Google Scholar
  2. Alba E, Dorronsoro B (2008) A hybrid cellular genetic algorithm for the capacitated vehicle routing problem. In: Abraham A, Grosan C, Pedrycz W (eds) Engineering evolutionary intelligent systems. Springer, Heidelberg, pp 379–422Google Scholar
  3. Al-Khamis T, M’Hallah R (2011) A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity. Comput Oper Res 38(12):1747–1759MathSciNetzbMATHGoogle Scholar
  4. Al-Mudahka I, Hifi M, M’Hallah R (2011) Packing circles in the smallest circle: An adaptive hybrid algorithm. J Oper Res Soc 62(11):1917–1930Google Scholar
  5. Archetti C, Speranza MG (2014) A survey on matheuristics for routing problems. Eur J Comput Optim 2(4):223–246zbMATHGoogle Scholar
  6. Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur J Oper Res 218(1):1–6MathSciNetzbMATHGoogle Scholar
  7. Beheshti AK, Hejazi SR, Alinaghian M (2015) The vehicle routing problem with multiple prioritized time windows: a case study. Comput Ind Eng 90:402–413Google Scholar
  8. Belhaiza S, M’Hallah R (2016) A pareto non-dominated solution approach for the vehicle routing problem with multiple time windows. In: IEEE Congress on Evolutionary Computation Proceedings, Vancouver, Canada, pp 3515–3524Google Scholar
  9. Belhaiza S, Hansen P, Laporte G (2013) A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput Oper Res 52:269–281MathSciNetzbMATHGoogle Scholar
  10. Belhaiza S, M’Hallah R, Ben Brahim G (2017) A new hybrid genetic variable neighborhood search heuristic for the vehicle routing problem with multiple time windows. In: IEEE Congress on Evolutionary Computation, San Sebastian, Spain, pp 1319–1326Google Scholar
  11. Braekers K, Ramaekers K, van Nieuwenhuyse I (2016) The vehicle routing problem: state of the art classification and review. Comput Ind Eng 99:300–313Google Scholar
  12. Cordeau JF, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52(8):928–936zbMATHGoogle Scholar
  13. Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57(4):1472–1483Google Scholar
  14. Favaretto D, Moretti E, Pellegrini P (2007) Ant colony system for a VRP with multiple time windows and multiple visits. J Interdisciplinary Math 10(2):263–284zbMATHGoogle Scholar
  15. Figliozzi MA (2010) An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transp Res 18(5):668–679Google Scholar
  16. Fu Z, Eglese R, Li LYO (2007) A unified tabu search algorithm for vehicle routing problems with soft time windows. J Oper Res Soc 59(5):663–673zbMATHGoogle Scholar
  17. Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 4(10):1276–1290zbMATHGoogle Scholar
  18. Gendreau M, Potvin JY, Bräysy O, Hasle G, Lokketangen A (2008) Metaheuristics for the vehicle routing problem and its extensions: a categorized bibliography. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges. Springer, New York, pp 143–169Google Scholar
  19. Hashimoto H, Ibaraki T, Imahori S, Yagiura M (2006) The vehicle routing problem with flexible time windows and traveling times. Discret Appl Math 154(16):2271–2290MathSciNetzbMATHGoogle Scholar
  20. Ibaraki T, Imahori S, Kubo M, Masuda T, Uno T, Yagiura M (2005) Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transp Sci 39(2):206–232Google Scholar
  21. Koç Ç, Bektaş T, Jabali O, Laporte G (2016) Thirty years of heterogeneous vehicle routing. Eur J Oper Res 249(1):1–21MathSciNetzbMATHGoogle Scholar
  22. Laalaoui Y, M’Hallah R (2016) A binary multiple knapsack model for single machine scheduling with machine unavailability. Comput Oper Res 72(8):71–82MathSciNetzbMATHGoogle Scholar
  23. M’Hallah R (2007) Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Comput Oper Res 34(10):3126–3142zbMATHGoogle Scholar
  24. M’Hallah R (2014) Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP. Comput Ind Eng 75:142–156Google Scholar
  25. M’Hallah R, Alkhabbaz A (2013) Scheduling of nurses: a case study of a Kuwaiti health care unit. Oper Res Healthcare 2(1–2):1–19Google Scholar
  26. M’Hallah R, Al-Khamis T (2012) Minimizing total weighted earliness and tardiness on parallel machines using a hybrid heuristic. Int J Prod Res 50(10):2639–2664Google Scholar
  27. M’Hallah R, Alkandari A, Mladenovic N (2013) Packing unit spheres into the smallest sphere using VNS and NLP. Comput Oper Res 40(2):603–615MathSciNetzbMATHGoogle Scholar
  28. Minocha B, Tripathi S (2013) Two phase algorithm for solving VRPTW problem. Int J Artif Intel Expert Syst 4:1–16Google Scholar
  29. Moccia L, Cordeau JF, Laporte G (2012) An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. J Oper Res Soc 63(2):232–244Google Scholar
  30. Mulvey JM, Vanderbei RJ, Zenios SA (1995) Robust optimization of large-scale systems. Oper Res 43(2):264–281MathSciNetzbMATHGoogle Scholar
  31. Nagata Y, Bräysy O (2009) Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks 54(4):205–215MathSciNetzbMATHGoogle Scholar
  32. Nagata Y, Bräysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37(4):724–737zbMATHGoogle Scholar
  33. Nazif H, Lee L (2012) Optimized crossover genetic algorithm for capacitated vehicle routing problem. Appl Math Models 36(5):2110–2117zbMATHGoogle Scholar
  34. Polyakoskiy S, M’Hallah R (2018) A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates. Eur J Oper Res 266:819–839MathSciNetzbMATHGoogle Scholar
  35. Polyakovskiy S, M’Hallah R (2014) A multi-agent system for the weighted earliness tardiness parallel machine problem. Comput Oper Res 44(4):15–136MathSciNetzbMATHGoogle Scholar
  36. Rincon-Garcia N, Waterson BJ, Cherrett TJ (2018) Requirements from vehicle routing software: perspectives from literature, developers and the freight industry. Transp Rev 38(1):117–138Google Scholar
  37. Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265MathSciNetzbMATHGoogle Scholar
  38. Toth T, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discret Appl Math 123:427–512MathSciNetzbMATHGoogle Scholar
  39. Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur J Oper Res 231(1):1–21MathSciNetzbMATHGoogle Scholar
  40. Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur J Oper Res 234(3):658–673MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Statistics and Operations ResearchCollege of Science, Kuwait UniversityKuwait CityKuwait

Personalised recommendations