Container packing problem with balance constraints

OR Spectrum

Volumn 36, Issue 4, 2014, Pages 837-878

  Moon, Ilkyeong ^a   Nguyen, Thi Viet Ly ^b  

^a Seoul National University   (South Korea)

^b DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Balance constraints; Container packing; Hybrid genetic algorithm

Indexed keywords

EID: 84907684419     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-013-0356-1     Document Type: Article

References (24)

1. Crainic T, Perboli G, Tadei R (2012) Recent advances in multi-dimensional packing problems. In: Volosencu C (ed) New technologies—trends, innovations and research. InTech, Chennai, pp 91–111. ISBN: 978-953-51-0480-3
2. Bortfeldt A, Gehring H (2001) A hybrid genetic algorithm for the container loading problem. Eur J Oper Res 131(1):143–161
3. Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 48(2):256–267
4. Bischoff EE, Ratcliff MSW (1995) Issue in the development of approaches to container loading. OMEGA Int J Manag Sci 23(4):377–390
5. Pisinger D (2002) Heuristics for the container loading problem. Eur J Oper Res 141:382–392
6. Bischoff EE, Janetz F, Ratcliff MSW (1995) Loading pallets with non-identical items. Eur J Oper Res 84(3):681–692
7. Eley M (2002) Solving container loading problems by block arrangement. Eur J Oper Res 141(2):393–409
8. Gehring H, Bortfeldt A (1997) A genetic algorithm for solving the container loading problem. Int Trans Oper Res 4(5–6):401–418
9. Bortfeldt A, Gehring H (1998) A tabu search algorithm for weakly heterogeneous container loading problems. OR Spect 20(4):237–250
10. Crainic TG, Perboli G, Tadei R (2008) Extreme-point-based heuristics for the three-dimensional bin packing problem. Informs J Comput 20:368–384
11. Zhang D, Wei L, Chen Q, Chen H (2007) A combinatorial heuristic algorithm for the three-dimensional packing problem. J Softw 18(9):2083–2089
12. Bortfeldt A, Gerhring H, Mack D (2003) A parallel tabu search algorithm for solving the container loading problem. Parallel Comput 29(5):641–662
13. Crainic T, Perboli G, Tadei R (2009) TS(Formula presented.)PACK: a two-level tabu search for the three-dimensional bin packing problem. Eur J Oper Res 195:744–760
14. Parreno F, Alvarez-Valdes R, Oliveira JF, Tamarit JM (2008) A maximal-space algorithm for the container loading problem. Informs J Comput 20(3):412–422
15. Parreno F, Alvarez-Valdes R, Oliveira JF, Tamarit JM (2010) Neighborhood structures for the container loading problem: a VNS implementation. J Heuristics 16(1):1–22
16. Perboli G, Crainic TG, Tadei R (2011) An efficient metaheuristic for multi-dimensional multi-container packing. In: IEEE Conference on Automation Science and Engineering (CASE). doi:10.1109/CASE.2011.6042476:563-568
17. Lim A, Rodrigues B, Yang Y (2005) 3-D container packing heuristics. Appl Intell 22(2):125–134
18. Moura A, Oliveira JF (2005) A GRASP approach to the container-loading problem. IEEE Intell Syst 20(4):50–57
19. Karabulut K, Inceoglu MM (2005) A hybrid genetic algorithm for packing in 3D with deepest bottom left with fill method. Comput Sci 3261(2005):441–450
20. Davies AP, Bischoff EE (1999) Weight distribution considerations in container loading. Eur J Oper Res 114(3):509–527
21. Liu J, Yue Y, Dong Z, Maple C, Keech M (2011) A novel hybrid tabu search approach to container loading. Comput Oper Res 38:797–807
22. Baldi MM, Perboli G, Tadei R (2012) The three-dimensional knapsack problem with balancing constraints. Appl Math Comput 218(19):9802–9818
23. Gen M, Lin L (2012) Multiobjective genetic algorithm for scheduling problems in manufacturing systems. Ind Eng Manag Syst 11(4):310–330
24. Parwananta H, Maghfiroh MFN, Yu VF (2013) Two-phase genetic algorithm for solving the paired single row facility layout problem. Ind Eng Manag Syst 12(3):181–189