Skip to main content
Log in

An integrated approach to the vehicle routing and container loading problems

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

Real-world distribution problems raise some practical considerations that usually are not considered in a realistic way in more theoretical studies. One of these considerations is related to the vehicle capacity, not only in terms of cubic meters or weight capacity but also in terms of the cargo physical arrangements. In a distribution scene, two combinatorial optimization problems, the vehicle routing problem with time windows and the container loading problem, are inherently related to each other. This work presents a framework to integrate these two problems using two different resolution methods. The first one treats the problem in a sequential approach, while the second uses a hierarchical approach. To test the quality and efficiency of the proposed approaches, some test problems were created based on the well-known Solomon, Bischoff and Ratcliff test problems. The results of the integrated approaches are presented and compared with results of the vehicle routing problem with time windows and the container loading problem applied separately.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Bent R, Van Hentenryck P (2004) A two-stage hybrid local search for the vehicle routing problem with time windows. Transpor Sci 38(4): 515–530

    Article  Google Scholar 

  • Bischoff EE (2006) Three-dimensional packing of items with limited load bearing strength. Eur J Oper Res 168(3): 952–966

    Article  Google Scholar 

  • Bischoff EE, Ratcliff MSW (1995) Issues in the development of approaches to container loading. Omega—Int J Manag Sci 23: 377–390

    Article  Google Scholar 

  • Bortfeldt A, Gehring H (1998) A tabu search algorithm for weakly heterogeneous container loading problems. OR Spektrum 20: 237–250

    Article  Google Scholar 

  • Bortfeldt A, Gehring H (2001) A hybrid genetic algorithm for the container loading problem. Eur J Oper Res 131: 143–161

    Article  Google Scholar 

  • Bortfeldt A, Gehring H, Mack D (2002) A parallel tabu search algorithm for solving the container loading problem. Working Paper, Diskussionsbeiträge des Fachbereichs Wirtschaftswissenschaft der Fern Universität Hagen

  • Bräysy O (2003) A reactive variable neighborhood search algorithm for the vehicle routing problem with time windows. Informs J Computing 15(4): 347–368

    Article  Google Scholar 

  • Bräysy O, Hasle G, Dullaert W (2004) A multi-start local search algorithm for the vehicle routing problem with time windows. Eur J Oper Res 159(3): 586–605

    Article  Google Scholar 

  • Carrabs F, Cordeau JF, Laporte G (2007) Variable neigborhood search for the pickup and delivery travelling Salesman Problem with LIFO loading. INFORMS J Comput 19(4): 618–632

    Article  Google Scholar 

  • Czech ZJ, Czarnas P (2002) A parallel simulated annealing for the vehicle routing problem with time windows. In: Vajda I, Podhorszki (eds) Proceedings of the 10th Euromicro workshop on parallel distributed and network-based processing, Canary Islands, Spain, 9–11 Janvary 2002, pp 376–383

  • Gehring H, Homberger J (2001) Parallelization of a two phase metaheuristic for routing problems with time windows. Asia-Pacific J Oper Res 18: 35–47

    Google Scholar 

  • Gehring H, Bortfeldt A (2002) A parallel genetic algorithm for solving the container loading problem. Int Trans Oper Res 9: 497–511

    Article  Google Scholar 

  • Gendreau M, Iori M, Laporte G, Martello S (2006) A tabu search algorithm for a routing and container loading problem. Trans Sci 9(3): 342–350

    Article  Google Scholar 

  • George JA, Robinson DF (1980) A heuristic for packing boxes into a container. Comput Oper Res 7: 147–156

    Article  Google Scholar 

  • Iori MI, Salazar Gonzalez JJ, Vigo D (2007) An exact approach for the vehicle routing problem with two dimensional loading constraints. Transport Sci 41(2): 253–264

    Article  Google Scholar 

  • Moura A, Oliveira JF (2005) A GRASP approach to the Container Loading Problem. IEEE Intell Syst—Spec Issue Metaheuristic Methods Transport Logistics (July/August) 20(4): 50–57

    Google Scholar 

  • Moura A, Oliveira JF (2004) Uma heurística composta para a determinação de rotas para veículos em problemas com janelas temporais e entregas e recolhas. Investigação Operacional 24(1): 45–62

    Google Scholar 

  • Petersen HL (2006) Heuristic solution approaches to the double TSP with multiple stacks. Technical report, Technical University of Denmark

  • Resende MGC, Pitsoulis LS (2002) Greedy randomized adaptive search procedures. In: Resende MGC, Pitsoulis LS(eds) Handbook of applied optimization. Oxford University Press, New York, pp 168–181

    Google Scholar 

  • Sixt M (1996) Dreidimensionale Packprobleme: Losungsverfahren basierend auf den Mate-Heuristiken Simulated Annealing und Tabu-Suche. Peter Lang, Frankfurt and Main, ISBN 3-631-30193-6

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper Res 35: 254–265

    Article  Google Scholar 

  • Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, ISBN 0-89871-579-2

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ana Moura.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moura, A., Oliveira, J.F. An integrated approach to the vehicle routing and container loading problems. OR Spectrum 31, 775–800 (2009). https://doi.org/10.1007/s00291-008-0129-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-008-0129-4

Keywords

Navigation