@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",
}
