Ant colony optimization for container loading problem.
Problem statement: The Container Loading Problem (CLP) considers packing a subset of given rectangular boxes into a rectangular container of fixed dimensions in the most optimum way. This was very important in the logistics industries and warehousing problems, since the cost can be reduced by increa...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Science Publications
2012
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/25257/ http://psasir.upm.edu.my/id/eprint/25257/1/Ant%20colony%20optimization%20for%20container%20loading%20problem.pdf |
| _version_ | 1848845259587452928 |
|---|---|
| author | Yap, Ching Nei Lee, Lai Soon Abdul Majid, Zanariah Seow, Hsin Vonn |
| author_facet | Yap, Ching Nei Lee, Lai Soon Abdul Majid, Zanariah Seow, Hsin Vonn |
| author_sort | Yap, Ching Nei |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Problem statement: The Container Loading Problem (CLP) considers packing a subset of given rectangular boxes into a rectangular container of fixed dimensions in the most optimum way. This was very important in the logistics industries and warehousing problems, since the cost can be reduced by increasing the space utilization ratio. Approach: This problem was solved in a two phased Ant Colony Optimization (ACO) where a tower building approach was used as the inner heuristic. In the first phase, ACO with its probabilistic decision rule was used to construct a sequence of boxes. The boxes were then arranged into a container with the tower building heuristic in the second phase. The pheromone feedback of ACO using pheromone updating rule helped to improve the solutions. Results: Computational experiments were conducted on benchmark data set and the results obtained from the proposed algorithm are shown to be comparable with other methods from the literatures. Conclusion: ACO has the capability to solve the CLP. |
| first_indexed | 2025-11-15T08:43:59Z |
| format | Article |
| id | upm-25257 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T08:43:59Z |
| publishDate | 2012 |
| publisher | Science Publications |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-252572015-10-26T03:05:39Z http://psasir.upm.edu.my/id/eprint/25257/ Ant colony optimization for container loading problem. Yap, Ching Nei Lee, Lai Soon Abdul Majid, Zanariah Seow, Hsin Vonn Problem statement: The Container Loading Problem (CLP) considers packing a subset of given rectangular boxes into a rectangular container of fixed dimensions in the most optimum way. This was very important in the logistics industries and warehousing problems, since the cost can be reduced by increasing the space utilization ratio. Approach: This problem was solved in a two phased Ant Colony Optimization (ACO) where a tower building approach was used as the inner heuristic. In the first phase, ACO with its probabilistic decision rule was used to construct a sequence of boxes. The boxes were then arranged into a container with the tower building heuristic in the second phase. The pheromone feedback of ACO using pheromone updating rule helped to improve the solutions. Results: Computational experiments were conducted on benchmark data set and the results obtained from the proposed algorithm are shown to be comparable with other methods from the literatures. Conclusion: ACO has the capability to solve the CLP. Science Publications 2012 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/25257/1/Ant%20colony%20optimization%20for%20container%20loading%20problem.pdf Yap, Ching Nei and Lee, Lai Soon and Abdul Majid, Zanariah and Seow, Hsin Vonn (2012) Ant colony optimization for container loading problem. Journal of Mathematics and Statistics, 8 (2). pp. 169-175. ISSN 1549-3644 10.3844/jmssp.2012.169.175 English |
| spellingShingle | Yap, Ching Nei Lee, Lai Soon Abdul Majid, Zanariah Seow, Hsin Vonn Ant colony optimization for container loading problem. |
| title | Ant colony optimization for container loading problem. |
| title_full | Ant colony optimization for container loading problem. |
| title_fullStr | Ant colony optimization for container loading problem. |
| title_full_unstemmed | Ant colony optimization for container loading problem. |
| title_short | Ant colony optimization for container loading problem. |
| title_sort | ant colony optimization for container loading problem. |
| url | http://psasir.upm.edu.my/id/eprint/25257/ http://psasir.upm.edu.my/id/eprint/25257/ http://psasir.upm.edu.my/id/eprint/25257/1/Ant%20colony%20optimization%20for%20container%20loading%20problem.pdf |