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

  • Dimitris Souravlias
  • Sandra Huber
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11353)


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.


Swap-body vehicle routing problem Benchmarks Patterns 


  1. 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)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Chao, I.M.: A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. 29(1), 33–51 (2002). Scholar
  3. 3.
    Derigs, U., Pullmann, M., Vogel, U.: Truck and trailer routing - problems, heuristics and computational experience. Comput. Oper. Res. 40(2), 536–546 (2013).,
  4. 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. 5.
    Heid, W., Hasle, G., Vigo, D.: VeRoLog solver challenge 2014 VSC2014 problem description. Technical report (2014).
  6. 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).,
  7. 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)CrossRefGoogle Scholar
  8. 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)MathSciNetCrossRefGoogle Scholar
  9. 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).,
  10. 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)MathSciNetCrossRefGoogle Scholar
  11. 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)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Logistics Management DepartmentHelmut-Schmidt UniversityHamburgGermany

Personalised recommendations