The multiple container loading cost minimization problem

European Journal of Operational Research

Volumn 214, Issue 3, 2011, Pages 501-511

  Che, Chan Hou ^a   Huang, Weili ^a   Lim, Andrew ^a   Zhu, Wenbin ^b,c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Container loading; Design of experiments; Heuristics; Integer programming; Packing

Indexed keywords

CONTAINERS; DESIGN OF EXPERIMENTS; INTEGER PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; OPTIMAL SYSTEMS; OPTIMIZATION; PACKING;

ASSOCIATED COSTS; CONTAINER LOADING; COST MINIMIZATION; HEURISTICS; LINEAR INTEGER PROGRAMMING; OPTIMAL SOLUTIONS; SET COVER PROBLEM; TRANSPORTATION INDUSTRY;

COSTS;

EID: 84861182079     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.04.017     Document Type: Article

References (29)

1. Bischoff, E.E., Ratcliff, M.S.W., 1995a. Issues in the development of approaches to container loading. OMEGA the International Journal of Management Science 23, 377-390.
2. Bischoff, E.E., Ratcliff, M.S.W., 1995b. Loading multiple pallets. Journal of the Operational Research Society 46, 1322-1336.
3. Bortfeldt, A., 2000. A heuristic for multiple container loading problems. OR Spectrum 22, 239-261.
4. Christensen, S.G., Rousøe, D.M., 2009. Container loading with multi-drop constraints. International Transactions in Operational Research 16, 727-743.
5. Crainic, T.G., Perboli, G., Tadei, R., 2008. Extreme point-based heuristics for threedimensional bin packing. INFORMS Journal on Computing 20, 368-384.
6. Crainic, T.G., Perboli, G., Tadei, R., 2009. TS2PACK: A two-level tabu search for the three-dimensional bin packing problem. European Journal of Operational Research 195, 744-760.
7. Dyckhoff, H., Finke, U., 1992. Cutting and Packing in Production and Distribution: A Typology and Bibliography. Contributions to Management Science, first ed. Physica-Verlag, Heidelberg, German.
8. Eley, M., 2002. Solving container loading problems by block arrangement. European Journal of Operational Research 141, 393-409. (Pubitemid 34623945)
9. Eley, M., 2003. A bottleneck assignment approach to the multiple container loading problem. OR Spectrum 25, 45-60. (Pubitemid 38260023)
10. Faroe, O., Pisinger, D., Zachariasen, M., 2003. Guided local search for the threedimensional bin-packing problem. INFORMS Journal on Computing 15, 267-283. (Pubitemid 39042721)
11. Fekete, S.P., van der Veen, J.C., 2007. PackLib2: An integrated library of multidimensional packing problems. European Journal of Operational Research 183, 1131-1135. (Pubitemid 47030731)
12. George, J.A., Robinson, D.F., 1980. A heuristic for packing boxes into a container. Computers & Operations Research 7, 147-156.
13. Ivancic, N., Mathur, K., Mohanty, B.B., 1989. An integer programming based heuristic approach to the three-dimensional packing problem. Journal of Manufacturing and Operations Management 2, 268-298.
14. Lesh, N., Marks, J., McMahon, A., Mitzenmacher, M., 2004. Exhaustive approaches to 2d rectangular perfect packings. Information Processing Letters 90, 7-14.
15. Lim, A., Zhang, X., 2005. The container loading problem. In: SAC '05: Proceedings of the 2005 ACM Symposium on Applied Computing. ACM, New York, NY, USA.
16. Lins, L., Lins, S., Morabito, R., 2002. An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container. European Journal of Operational Research 141, 421-439. (Pubitemid 34623947)
17. Lodi, A., Martello, S., Vigo, D., 2002. Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research 141, 410-420. (Pubitemid 34623946)
18. Martello, S., Pisinger, D., Vigo, D., 2000. The three-dimensional bin packing problem. Operations Research 48, 256-267.
19. Monaci, M., Toth, P., 2006. A set-covering-based heuristic approach for bin-packing problems. INFORMS Journal on Computing 18, 71-85. (Pubitemid 43515947)
20. Moura, A., Oliveira, J.F., 2005. A grasp approach to the container-loading problem. IEEE Intelligent Systems 20, 50-57. (Pubitemid 41263300)
21. Murata, H., Fujiyoshi, K., Nakatake, S., Kajitani, Y., 1996. Vlsi module placement based on rectangle-packing by the sequence-pair. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15, 1518-1524. (Pubitemid 126780413)
22. Parreño, F., Alvarez-Valdes, R., Oliveira, J.F., Tamarit, J.M., 2008. A hybrid GRASP/VND algorithm for two-and-three-dimensional bin packing. Annals of Operations Research 179, 203-220.
23. Scheithauer, G., Terno, J., 1996. The G4-heuristic for the pallet loading problem. Journal of the Operational Research Society 47, 511-522. (Pubitemid 126576094)
24. Takahara, S., 2006. A simple meta-heuristic approach for the multiple container loading problem, in: SMC '06: IEEE International Conference on Systems, Man and Cybernetics, vol. 3, 2006, pp. 2328-2333.
25. Takahara, S., 2008. A multi-start local search approach to the multiple container loading problem, in: W. Bednorz (Ed.), Advances in Greedy Algorithms, I-TECH Education and Publishing, Zieglergasse 14, 1070 Vienna Austria, European Union: IN-TECH, pp. 55-68.
26. Takahara, S., Miyamoto, S., 2005. An evolutionary approach for the multiple container loading problem, in: HIS '05: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems, pp. 227-232.
27. Terno, J., Scheithauer, G., Sommerweiß, U., Riehme, J., 2000. An efficient approach for the multi-pallet loading problem. European Journal of Operational Research 123, 372-381. (Pubitemid 30596939)
28. Verweij, B., 1996. Multiple Destination Bin Packing, Technical Report CS-1996-39, Department of Information and Computing Sciences, Faculty of Science, Utrecht University 3508 TC Utrecht, Netherlands.
29. Wäscher, G., Haußner, H., Schumann, H., 2007. An improved typology of cutting and packing problems. European Journal of Operational Research 183, 1109-1130. (Pubitemid 47030730)