A hybrid ant colony algorithm for solving container loading

Jiamin Liu; Xiaorui Zhang; Carsten Maple; Yong Yue

doi:10.1109/iciii.2012.6339960

A hybrid ant colony algorithm for solving container loading

Jiamin Liu^*
, Xiaorui Zhang
, Carsten Maple
, Yong Yue

^*Corresponding author for this work

Shenyang University of Technology
University of Bedfordshire

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

1 Citation (Scopus)

Abstract

Container loading is a combinatorial optimization problem in three-dimensional packing which is an area of cutting and packing. It belongs to a NP-hard problem. To solve this problem, a hybrid approach is proposed in this paper. The approach integrated a loading heuristic into an ant colony optimization algorithm. The loading sequence is generated by the ant colony algorithm which configures the quantity of pheromone trails, transition probability and objective function. The loading sequence is transformed into the loading layout of boxes by using a loading heuristic which combines the heuristic strategy of generated blocks and the method for handling remaining spaces. The approach is tested through the test instance. The experimental result has shown that the approach is superior to the DNA generic algorithm.

Original language	English
Title of host publication	Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012
Publisher	IEEE Computer Society
Pages	224-227
Number of pages	4
ISBN (Print)	9781467319324
DOIs	https://doi.org/10.1109/iciii.2012.6339960
Publication status	Published - 2012
Externally published	Yes
Event	2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012 - Sanya, China Duration: 20 Oct 2012 → 21 Oct 2012

Publication series

Name	Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012
Volume	3

Conference

Conference	2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012
Country/Territory	China
City	Sanya
Period	20/10/12 → 21/10/12

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Keywords

Ant colony optimization
Container loading
Heuristic
Remaining space
Utilization

Access to Document

10.1109/iciii.2012.6339960

Cite this

Liu, J., Zhang, X., Maple, C., & Yue, Y. (2012). A hybrid ant colony algorithm for solving container loading. In Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012 (pp. 224-227). (Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012; Vol. 3). IEEE Computer Society. https://doi.org/10.1109/iciii.2012.6339960

Liu, Jiamin ; Zhang, Xiaorui ; Maple, Carsten et al. / A hybrid ant colony algorithm for solving container loading. Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012. IEEE Computer Society, 2012. pp. 224-227 (Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012).

@inproceedings{f30b86f5f01c49a98c94cf9515c7ffeb,

title = "A hybrid ant colony algorithm for solving container loading",

abstract = "Container loading is a combinatorial optimization problem in three-dimensional packing which is an area of cutting and packing. It belongs to a NP-hard problem. To solve this problem, a hybrid approach is proposed in this paper. The approach integrated a loading heuristic into an ant colony optimization algorithm. The loading sequence is generated by the ant colony algorithm which configures the quantity of pheromone trails, transition probability and objective function. The loading sequence is transformed into the loading layout of boxes by using a loading heuristic which combines the heuristic strategy of generated blocks and the method for handling remaining spaces. The approach is tested through the test instance. The experimental result has shown that the approach is superior to the DNA generic algorithm.",

keywords = "Ant colony optimization, Container loading, Heuristic, Remaining space, Utilization",

author = "Jiamin Liu and Xiaorui Zhang and Carsten Maple and Yong Yue",

year = "2012",

doi = "10.1109/iciii.2012.6339960",

language = "English",

isbn = "9781467319324",

series = "Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012",

publisher = "IEEE Computer Society",

pages = "224--227",

booktitle = "Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012",

note = "2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012 ; Conference date: 20-10-2012 Through 21-10-2012",

}

Liu, J, Zhang, X, Maple, C & Yue, Y 2012, A hybrid ant colony algorithm for solving container loading. in Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012. Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012, vol. 3, IEEE Computer Society, pp. 224-227, 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012, Sanya, China, 20/10/12. https://doi.org/10.1109/iciii.2012.6339960

A hybrid ant colony algorithm for solving container loading. / Liu, Jiamin; Zhang, Xiaorui; Maple, Carsten et al.
Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012. IEEE Computer Society, 2012. p. 224-227 (Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012; Vol. 3).

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

TY - GEN

T1 - A hybrid ant colony algorithm for solving container loading

AU - Liu, Jiamin

AU - Zhang, Xiaorui

AU - Maple, Carsten

AU - Yue, Yong

PY - 2012

Y1 - 2012

N2 - Container loading is a combinatorial optimization problem in three-dimensional packing which is an area of cutting and packing. It belongs to a NP-hard problem. To solve this problem, a hybrid approach is proposed in this paper. The approach integrated a loading heuristic into an ant colony optimization algorithm. The loading sequence is generated by the ant colony algorithm which configures the quantity of pheromone trails, transition probability and objective function. The loading sequence is transformed into the loading layout of boxes by using a loading heuristic which combines the heuristic strategy of generated blocks and the method for handling remaining spaces. The approach is tested through the test instance. The experimental result has shown that the approach is superior to the DNA generic algorithm.

AB - Container loading is a combinatorial optimization problem in three-dimensional packing which is an area of cutting and packing. It belongs to a NP-hard problem. To solve this problem, a hybrid approach is proposed in this paper. The approach integrated a loading heuristic into an ant colony optimization algorithm. The loading sequence is generated by the ant colony algorithm which configures the quantity of pheromone trails, transition probability and objective function. The loading sequence is transformed into the loading layout of boxes by using a loading heuristic which combines the heuristic strategy of generated blocks and the method for handling remaining spaces. The approach is tested through the test instance. The experimental result has shown that the approach is superior to the DNA generic algorithm.

KW - Ant colony optimization

KW - Container loading

KW - Heuristic

KW - Remaining space

KW - Utilization

UR - https://www.scopus.com/pages/publications/84870726660

U2 - 10.1109/iciii.2012.6339960

DO - 10.1109/iciii.2012.6339960

M3 - Conference Proceeding

AN - SCOPUS:84870726660

SN - 9781467319324

T3 - Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012

SP - 224

EP - 227

BT - Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012

PB - IEEE Computer Society

T2 - 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012

Y2 - 20 October 2012 through 21 October 2012

ER -

Liu J, Zhang X, Maple C, Yue Y. A hybrid ant colony algorithm for solving container loading. In Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012. IEEE Computer Society. 2012. p. 224-227. (Proceeding of 2012 International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2012). doi: 10.1109/iciii.2012.6339960

A hybrid ant colony algorithm for solving container loading

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this