微信服务号

微信订阅号

2025-4-25- 15
Home > Archive>Volume 12, Issue 9, 2001 >1380-1385
PDF HTML XML Export Cite reminder
Research on Solution to Complex Container-Loading Problem Based on Genetic Algorithm
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [12]
    • |
  • Related [20]
    • |
  • Cited by [33]
    • | |
  • Comments
    Abstract:

    The container-loading problem occurring in on-the-spot freight production is often with several constraints and objectives, i.e., complex container-loading problem. The robustness, parallelism, and a variety of applications in the solution of NP complete problem of genetic algorithm demonstrate genetic algorithm is an effective approach to solve complex container loading problem. In this paper, the genetic algorithm for complex container-loading problem is studied, the effective coding and decoding method is given. The numerical solution of example shows that the algorithm is effective.

    Reference
    [1] Dowsland, K.A., Dowsland, W.B. Packing problems. European Journal of Operational Research, 1992,56:2～14.
    [2] Sweeney, P.E., Paternoster, E.R. Cutting and packing problems: a categorized, application-orientated research. Journal of Operation Research Society, 1992,43(7):691～706.
    [3] Wang, Ai-hu, Zha, Jian-zhong. A heuristic algorithm for rectangular packing based on bintree expression. Journal of Software, 1996,7(4):252～257 (in Chinese).王爱虎,查建中.一种基于二叉树结构表达的矩形物体布局的启发式方法.软件学报,1996,7(4):252～257.
    [4] Yang, Chuan-min, Chen, Shao-wei. Discontinuous optimization on the containerization of cubic. Package Engineering, 1996,17(2):6～9 (in Chinese).杨传民,陈少为.立方体包装件集装的离散优化.包装工程,1996,17(2):6～9.
    [5] Mannchen, K. Solution methods for two and three dimensional packing problems [Ph.D. Thesis]. Kar Lsruhe, Germany: Kar Lsruhe University, 1989.
    [6] Gehring, H. A computer-based heuristic for packing pooled shipment containers. European Journal of Operational Research, 1990,44(2):277～288.
    [7] Dai, Zuo, Zha, Jian-zhong, Ni, Zhong-li. A fast decomposition algorithm of octree node in 3D-packing. Journal of Software, 1995,6(11):679～685 (in Chinese). 戴佐,查建中,倪仲力.三维布局中八叉树节点的快速分解算法.软件学报,1995,6(11):679～685.
    [8] Dai, Zuo, Yuan, Jun-liang, Zha, Jian-zhong. An octree-based heuristic algorithm for three dimensional packing. Journal of Software, 1995,6(10):629～636 (in Chinese).戴佐,袁俊良,查建中.一种基于八叉树结构表达的三维实体布局启发式算法.软件学报,1995,6(10):629～636.
    [9] Wang, Jin-min, Chen, Dong-xiang, Zha, Jian-zhong. A heuristic method for constrained pallet loading problem. Journal of Software, 1996,7(10):616～620 (in Chinese).王金敏,陈东祥,查建中.关于约束底盘装载问题的一种启发式方法.软件学报,1996,7(10):616～620.
    [10] Jakobs, S. On genetic algorithms for the packing of polygons. European Journal of Operational Research, 1996,88(1):165～181.
    [11] He, Da-yong. Research on solution to container loading problem [MS. Thesis]. Beijing: Northern Jiaotong University, 2000 (in Chinese).何大勇,集装箱布局问题求解方法研究[硕士学位论文].北京:北方交通大学,2000.
    [12] Zhou, Ming, Sun, Shu-dong. Genetic Algorithms: Theory and Applications. Beijing: National Defense Industry Press, 1999 (in Chinese).周明,孙树栋.遗传算法原理及应用.北京:国防工业出版社,1999.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

何大勇,查建中,姜义东.遗传算法求解复杂集装箱装载问题方法研究.软件学报,2001,12(9):1380-1385

Copy
Share
Article Metrics
  • Abstract:4993
  • PDF: 5834
  • HTML: 0
  • Cited by: 0
History
  • Received:January 20,2000
  • Revised:May 15,2000
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2038724Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063