Skip to main content
SpringerLink
Log in

Detecting Patterns in Benchmark Instances of the Swap-Body Vehicle Routing Problem

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 12 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11353))

Included in the following conference series:

Abstract

The present study aims at identifying possible relations between solution features and different characteristics of the Swap-body Vehicle Routing Problem. For this purpose, an investigation has been conducted on two established benchmark sets. Our analysis reveals the existence of hidden patterns with respect to various aspects of the corresponding problem instances. The detected patterns are then used to formulate problem-specific properties, which hold for the majority of the instances under consideration. Our findings may be employed as guidelines in the design of algorithmic components, such as new selection techniques that choose only a subset of specific nodes of interest from the vehicle routing network. Also, our work sheds further light on the effect of various problem characteristics on the structure of their best known solutions.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

References

  1. Absi, N., Cattaruzza, D., Feillet, D., Housseman, S.: A relax-and-repair heuristic for the Swap-Body Vehicle Routing Problem. Ann. Oper. Res. 253(2), 957–978 (2017)

    Article  MathSciNet  Google Scholar 

  2. Chao, I.M.: A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. 29(1), 33–51 (2002). https://doi.org/10.1016/S0305-0548(00)00056-3

    Article  MathSciNet  MATH  Google Scholar 

  3. Derigs, U., Pullmann, M., Vogel, U.: Truck and trailer routing - problems, heuristics and computational experience. Comput. Oper. Res. 40(2), 536–546 (2013). https://doi.org/10.1016/j.cor.2012.08.007, http://www.sciencedirect.com/science/article/pii/S0305054812001724

  4. Drexl, M.: Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem. J. Quant. Methods Econ. Bus. Adm. 12, 5 (2011)

    Google Scholar 

  5. Heid, W., Hasle, G., Vigo, D.: VeRoLog solver challenge 2014 VSC2014 problem description. Technical report (2014). http://verolog.deis.unibo.it/news-events/general-news/verolog-solver-challenge-2014

  6. Huber, S., Geiger, M.J.: Order matters - a variable neighborhood search for the swap-body vehicle routing problem. Eur. J. Oper. Res. 263(2), 419–445 (2017). https://doi.org/10.1016/j.ejor.2017.04.046, http://www.sciencedirect.com/science/article/pii/S0377221717303934

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

    Article  Google Scholar 

  8. Miranda-Bront, J.J., Curcio, B., Méndez-Díaz, I., Montero, A., Pousa, F., Zabala, P.: A cluster-first route-second approach for the swap body vehicle routing problem. Ann. Oper. Res. 253(2), 935–956 (2017)

    Article  MathSciNet  Google Scholar 

  9. Todosijević, R., Hanafi, S., Urošević, D., Jarboui, B., Gendron, B.: A general variable neighborhood search for the swap-body vehicle routing problem. Comput. Oper. Res. 78, 468–479 (2017). https://doi.org/10.1016/j.cor.2016.01.016, http://www.sciencedirect.com/science/article/pii/S0305054816300120

  10. Toffolo, T.A., Christiaens, J., Malderen, S.V., Wauters, T., Vanden Berghe, G.: Stochastic local search with learning automaton for the swap-body vehicle routing problem. Comput. Oper. Res. 89, 68–81 (2018)

    Article  MathSciNet  Google Scholar 

  11. Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845–858 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Logistics Management Department, Helmut-Schmidt University, Holstenhofweg 85, 22043, Hamburg, Germany

    Dimitris Souravlias & Sandra Huber

Authors
  1. Dimitris Souravlias
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandra Huber
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dimitris Souravlias .

Editor information

Editors and Affiliations

  1. University of Trento, Trento, Italy

    Roberto Battiti

  2. University of Trento, Trento, Italy

    Mauro Brunato

  3. Wilfrid Laurier University, Waterloo, ON, Canada

    Ilias Kotsireas

  4. University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Souravlias, D., Huber, S. (2019). Detecting Patterns in Benchmark Instances of the Swap-Body Vehicle Routing Problem. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 12 2018. Lecture Notes in Computer Science(), vol 11353. Springer, Cham. https://doi.org/10.1007/978-3-030-05348-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05348-2_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05347-5

  • Online ISBN: 978-3-030-05348-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation