Top > JACIII > Metaheuristic Algorithms for Container Loading Problems: Frame ...

single-jc.php

JACIII Vol.11 No.1 pp. 51-60
doi: 10.20965/jaciii.2007.p0051
(2007)

Paper:

Views over last 60 days: 418

Metaheuristic Algorithms for Container Loading Problems: Framework and Knowledge Utilization

Sadaaki Miyamoto*, Yasunori Endo*, Koki Hanzawa**,
and Yukihiro Hamasuna**

*Department of Risk Engineering, Faculty of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, Ibaraki 305-8573, Japan

**Master’s Program in Risk Engineering, Graduate School of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, Ibaraki 305-8573, Japan

Received:
October 31, 2005
Accepted:
March 31, 2006
Published:
January 20, 2007
Creative Commons License
Keywords:
container loading, metaheuristic optimization, knowledge system
Abstract
A family of automatic container loading problems is studied and algorithms are proposed. The algorithms are constructed with metaheuristics and include flat and/or vertical loading schemes, loading efficiency, stability of loaded objects, and computational requirement. Commonsense and expert knowledge incorporation is considered to combine with metaheuristics. Handling groups of objects in a metaheuristic scheme is moreover considered. Numerical examples are given.
Cite this article as:
S. Miyamoto, Y. Endo, K. Hanzawa, and Y. Hamasuna, “Metaheuristic Algorithms for Container Loading Problems: Framework and Knowledge Utilization,” J. Adv. Comput. Intell. Intell. Inform., Vol.11 No.1, pp. 51-60, 2007.
Data files:
References
  1. [1] A. Albano and G. Sapuppo, “Optimal allocation of two-dimensional irregular shapes using heuristic search methods,” IEEE Trans. Syst., Man, Cybern., Vol.10, No.5, pp. 242-248, 1980.
  2. [2] E. E. Bischoff and M. S. W. Ratcliff, “Issues in the development of approaches to container loading,” Omega, Vol.23, No.4, pp. 377-390, 1995.
  3. [3] A. Bortfeldt and H. Gehring, “A hybrid genetic algorithm for the container loading problem,” European J. Oper. Res., Vol.131, pp. 143-161, 2001.
  4. [4] M. R. Garey and D. S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness,” San Francisco: Freeman, 1979.
  5. [5] P. C. Gilmore and R. E. Gomory, “Multistage cutting stock problems of two or more dimensions,” Oper. Res., Vol.13, pp. 94-120, 1965.
  6. [6] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, Vol.220, pp. 671-680, 1983.
  7. [7] OR library (http://mscmga.ms.ic.ac.uk)
  8. [8] S. Takahara and S. Miyamoto, “Adaptive algorithms of metaheuristics with application to optimal allocation problems,” Proc. 1999 IEEE Int. Conf. Systems, Man, and Cybernetics, Tokyo, pp. III-545–III-550, 1999.
  9. [9] S. Takahara, Y. Kusumoto, and S. Miyamoto, “An adaptive metaheuristic approach using partial optimization to non-convex polygons allocation problem,” Proc. 10th IEEE Int. Conf. Fuzzy Systems, Melbourne, 2001.
  10. [10] D. Smith, “Bin packing with adaptive search,” Proc. 1st Int. Conf. Genetic Algorithms and Their Applications, Pittsburgh, pp. 202-207, 1985.
  11. [11] Y. G. Stoyan, M. V. Novozhilova, and A. V. Kartashov, “Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem,” European J. Oper. Res., Vol.92, pp. 193-210, 1996.
  12. [12] Patent, No.11-208604, Japan, 1999.
  13. [13] S. Miyamoto, Y. Endo, S. Takahara, K. Urayama, and K. Terada, “Metaheuristic methods and system development for automatization in freight systems,” Proc. 14th Intelligent System Symposium (FAN2004), pp. 331-334, 2004.

Creative Commons License  This article is published under a Creative Commons Attribution-NoDerivatives 4.0 Internationa License.

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Apr. 19, 2024