Advertisement

Heuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries

  • Mikhail BatsynEmail author
  • Alexander Ponomarenko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9432)

Abstract

In this paper we develop an iterative insertion heuristic for a site-dependent truck and trailer routing problem with soft and hard time windows and split deliveries. In the considered problem a truck can leave its trailer for unloading or parking, make a truck-subtour to serve truck-customers, and return back to take the trailer. This can be done several times in one route. In our heuristic every route is constructed by sequentially inserting customers to it in the way similar to Solomon’s (1987) approach developed for simple vehicle routes. Our contributions include: heuristic insertion procedure for complex truck and trailer routes with transshipment locations; efficient randomized mechanisms for choosing the first customer for insertion, for making time window violations, and for making split-deliveries; an improvement procedure shifting deliveries in a route to earlier time; an efficient approach dealing with site-dependency feature based on the transportation problem in case of arbitrary intersecting vehicle sets and a fast vehicle assignment procedure in case of nested vehicle sets.

Keywords

Truck and trailer Site-dependent Soft time windows Split-deliveries Insertion heuristic 

Notes

Acknowledgments

The authors are supported by LATNA Laboratory, NRU HSE, RF government grant, ag. 11.G34.31.0057.

References

  1. Batsyn, M., Ponomarenko, A.: Heuristic for a real-life truck and trailer routing problem. Procedia Comput. Sci. 31, 778–792 (2014). The 2nd International Conference on Information Technology and Quantitative Management, ITQM 2014CrossRefGoogle Scholar
  2. Caramia, M., Guerriero, F.: A heuristic approach for the truck and trailer routing problem. J. Oper. Res. Soc. 61, 1168–1180 (2010a)zbMATHCrossRefGoogle Scholar
  3. Caramia, M., Guerriero, F.: A milk collection problem with incompatibility constraints. Interfaces 40(2), 130–143 (2010b)CrossRefGoogle Scholar
  4. Chao, I.M.: A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. 29(1), 33–51 (2002)zbMATHCrossRefGoogle Scholar
  5. Drexl, M.: Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem. J. Quant. Methods Econ. Bus. Adm. 12(1), 5–38 (2011)Google Scholar
  6. Hoff, A.: Heuristics for rich vehicle routing problems. Ph.D. Thesis. Molde University College (2006)Google Scholar
  7. Hoff, A., Lokketangen, A.: A tabu search approach for milk collection in western Norway using trucks and trailers. In: The Sixth Triennial Symposium on Transportation Analysis TRISTAN VI, Phuket, Tailand (2007)Google Scholar
  8. Lin, S.-W., Yu, V.F., Chou, S.-Y.: Solving the truck and trailer routing problem based on a simulated annealing heuristic. Comput. Oper. Res. 36(5), 1683–1692 (2009)zbMATHCrossRefGoogle Scholar
  9. Lin, S.-W., Yu, V.F., Chou, S.-Y.: A note on the truck and trailer routing problem. Expert Syst. Appl. 37(1), 899–903 (2010)CrossRefGoogle Scholar
  10. Lin, S.-W., Yu, V.F., Lu, C.-C.: A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Syst. Appl. 38, 15244–15252 (2011)CrossRefGoogle Scholar
  11. Scheuerer, S.: A tabu search heuristic for the truck and trailer routing problem. Comput. Oper. Res. 33, 894–909 (2006)zbMATHCrossRefGoogle Scholar
  12. Semet, F., Taillard, E.: Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. 41, 469–488 (1993)CrossRefGoogle Scholar
  13. Semet, F.: A two-phase algorithm for the partial accessibility constrained vehicle routing problem. Ann. Oper. Res. 61, 45–65 (1995)zbMATHMathSciNetCrossRefGoogle Scholar
  14. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35, 254–265 (1987)zbMATHMathSciNetCrossRefGoogle Scholar
  15. Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N.: A GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput. Oper. Res. 38(9), 1319–1334 (2011a)zbMATHCrossRefGoogle Scholar
  16. Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N.: Heuristic column generation for the truck and trailer routing problem. In: International Conference on Industrial Engineering and Systems Management IESM2011, Metz, France (2011b)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Laboratory of Algorithms and Technologies for Network AnalysisNational Research University Higher School of EconomicsNiznhy NovgorodRussia

Personalised recommendations