An integrated approach to the vehicle routing and container loading problems

OR Spectrum

Volumn 31, Issue 4, 2009, Pages 775-800

  Moura, Ana ^a,b   Oliveira, José Fernando ^c,d  

^a UNIVERSITY OF AVEIRO   (Portugal)

^b INESC COIMBRA   (Portugal)

^c UNIVERSITY OF PORTO   (Portugal)

^d UNIVERSITY OF PORTO   (Portugal)

Author keywords

Container loading problem; GRASP; Vehicle routing problem with time windows

Indexed keywords

EID: 77349100608     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-008-0129-4     Document Type: Article

References (22)

1. 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.
2. Bischoff EE (2006) Three-dimensional packing of items with limited load bearing strength. Eur J Oper Res 168(3): 952-966.
3. Bischoff EE, Ratcliff MSW (1995) Issues in the development of approaches to container loading. Omega-Int J Manag Sci 23: 377-390.
4. Bortfeldt A, Gehring H (1998) A tabu search algorithm for weakly heterogeneous container loading problems. OR Spektrum 20: 237-250.
5. Bortfeldt A, Gehring H (2001) A hybrid genetic algorithm for the container loading problem. Eur J Oper Res 131: 143-161.
6. 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.
7. 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.
8. 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.
9. 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.
10. 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.
11. 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.
12. Gehring H, Bortfeldt A (2002) A parallel genetic algorithm for solving the container loading problem. Int Trans Oper Res 9: 497-511.
13. 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.
14. George JA, Robinson DF (1980) A heuristic for packing boxes into a container. Comput Oper Res 7: 147-156.
15. 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.
16. 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.
17. 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.
18. Petersen HL (2006) Heuristic solution approaches to the double TSP with multiple stacks. Technical report, Technical University of Denmark.
19. 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.
20. 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.
21. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper Res 35: 254-265.
22. Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, ISBN 0-89871-579-2.