Skip to main content
SpringerLink
Log in
Book cover

International Conference on Network Analysis

NET 2016: Models, Algorithms, and Technologies for Network Analysis pp 67–76Cite as

Iterative Local Search Heuristic for Truck and Trailer Routing Problem

  • Conference paper
  • First Online:

  • 744 Accesses

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 197))

Abstract

Vehicle Routing Problem is a well-known problem in logistics and transportation. There is a big variety of VRP problems in the literature, as they arise in many real-life situations. It is a NP-hard combinatorial optimization problem and finding an exact optimal solution is practically impossible in real-life formulations. There is an important subclass of VRP, which is called Truck and Trailer Routing Problem. For this class of problems, every vehicle contains truck and, possibly, trailer parts. In this work, Site-Dependent Truck and Trailer Routing Problem with Hard and Soft Time Windows and Split Deliveries are considered. We develop an Iterative Local Search heuristic for solving this problem. The heuristic is based on the local search approach and also allows infeasible solutions. A greedy heuristic is applied to construct an initial solution.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2002)

    Book  MATH  Google Scholar 

  2. Semet, F., Taillard, E.: Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. 41(4), 469–488 (1993)

    Article  MATH  Google Scholar 

  3. Chao, I.: A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. 29(1), 33–51 (2002)

    Article  MATH  Google Scholar 

  4. Scheuerer, S.: A tabu search heuristic for the truck and trailer routing problem. Comput. Oper. Res. 33(4), 894–909 (2006)

    Article  MATH  Google Scholar 

  5. Lin, S., Yu, V.F., Lu, C.: A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Syst. Appl. 38(12), 15244–15252 (2011)

    Article  Google Scholar 

  6. 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 

  7. Batsyn, M., Ponomarenko, A.: Heuristic for a real-life truck and trailer routing problem. Procedia Comput. Sci. 31, 778–792 (2014)

    Article  Google Scholar 

  8. Batsyn, M., Ponomarenko, A.: Heuristic for site-dependent truck and trailer routing problem with soft and hard time windows and split deliveries. In: Machine Learning, Optimization, and Big Data, Lecture Notes in Computer Science, pp. 65–79 (2015)

    Google Scholar 

  9. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35, 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work is partially supported by Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics.

Author information

Authors and Affiliations

  1. National Research University Higher School of Economics, Laboratory of Algorithms and Technologies for Network Analysis, 136 Rodionova St, Nizhny Novgorod, 603093, Russia

    Ivan S. Grechikhin

Authors
  1. Ivan S. Grechikhin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan S. Grechikhin .

Editor information

Editors and Affiliations

  1. National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Valery A. Kalyagin

  2. National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Alexey I. Nikolaev

  3. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  4. Department of Industrial Engineering, University of Pittsburgh , Pittsburgh, Pennsylvania, USA

    Oleg A. Prokopyev

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Grechikhin, I.S. (2017). Iterative Local Search Heuristic for Truck and Trailer Routing Problem . In: Kalyagin, V., Nikolaev, A., Pardalos, P., Prokopyev, O. (eds) Models, Algorithms, and Technologies for Network Analysis. NET 2016. Springer Proceedings in Mathematics & Statistics, vol 197. Springer, Cham. https://doi.org/10.1007/978-3-319-56829-4_6

Download citation

Publish with us

Policies and ethics

Search

Navigation