Two natural heuristics for 3D packing with practical loading constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6230 LNAI, Issue , 2010, Pages 256-267

  Wang, Lei ^a   Guo, Songshan ^a   Chen, Shi ^a   Zhu, Wenbin ^b,c   Lim, Andrew ^d  

^a SUN YAT SEN UNIVERSITY   (China)

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

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^d CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

2-D PACKING; 3D PACKING; CAPACITATED VEHICLE ROUTING PROBLEM; LOADING CONSTRAINTS; NATURAL HEURISTICS; PROBLEM SIZE; TABU SEARCH ALGORITHMS; TRANSPORTATION INDUSTRY; VEHICLE LOADING;

ARTIFICIAL INTELLIGENCE; FLEET OPERATIONS; LOADING; TABU SEARCH; THREE DIMENSIONAL;

FREIGHT TRANSPORTATION;

EID: 78049308519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15246-7_25     Document Type: Conference Paper

References (15)

1. Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search algorithm for a routing and container loading problem. Transportation Science 40(3), 342-350 (2006) (Pubitemid 44147355)
2. Fuellerer, G., Doerner, K. F., Hartl, R. F., Iori, M.: Metaheuristics for vehicle routing problems with three-dimensional loading constraints. European Journal of Operational Research 201(3), 751-759 (2010)
3. Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)
4. Chazelle: The bottomn-left bin-packing heuristic: An efficient implementation. IEEE Transactions on Computers C-32 (8), 697-707 (1983)
5. Healy, P.: An optimal algorithm for rectangle placement. Operations Research Letters 24 (1-2), 73-80 (1999)
6. Bortfeldt, A.: A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research 131(1), 143-161 (2001) (Pubitemid 32264922)
7. Eley, M.: Solving container loading problems by block arrangement. European Journal of Operational Research 141(2), 393-409 (2002) (Pubitemid 34623945)
8. Pisinger, D.: Heuristics for the container loading problem. European Journal of Operational Research 141(2), 382-392 (2002) (Pubitemid 34623944)
9. Lim, A., Zhang, X.: The container loading problem. In: SAC 2005: Proceedings of the 2005 ACM Symposium on Applied Computing, pp. 913-917. ACM, New York (2005) (Pubitemid 43302680)
10. Lim, A., Rodrigues, B., Yang, Y.: 3-d container packing heuristics. Applied Intelligence 22(2), 125-134 (2005) (Pubitemid 40400729)
11. Parreno, F., Alvarez-Valdes, R., Tamarit, J. M., Oliveira, J. F.: A maximal-space algorithm for the container loading problem. Informs Journal on Computing 20(3), 412-422 (2008)
12. Fanslau, T., Bortfeldt, A.: A tree search algorithm for solving the container loading problem. Informs Journal on Computing, ijoc.1090.0338+ (July 2009)
13. Baker, B. S., Coffman, E. G., Rivest, R. L.: Orthogonal packings in two dimensions. SIAM Journal on Computing 9(4), 846-855 (1980)
14. Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. Informs Journal on Computing 11(4), 345-357 (1999)
15. Clarke, G., Wright, J. W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12(4), 568-581 (1964)