首页 | 本学科首页   官方微博 | 高级检索  
     检索      

条形装箱问题的基于后缀表达式的混合遗传算法
引用本文:汤岩,贾红雨,纪贤标.条形装箱问题的基于后缀表达式的混合遗传算法[J].喀什师范学院学报,2007,28(3):76-78.
作者姓名:汤岩  贾红雨  纪贤标
作者单位:1. 集美大学,工商管理学院,福建,厦门,361021
2. 大连海事大学,经济管理学院,辽宁,大连,116026
摘    要:装箱问题作为一种常见的运筹问题,在很多领域有着重要的应用,装箱问题可以分为一维、二维和三维装箱.主要讨论了二维装箱中条形装箱问题的遗传算法的求解,其中采用后缀表达式的形式对装箱方案进行编码,并详细提出了解码的算法和有关的证明,最后通过实例证明了该算法是可行的.

关 键 词:装箱问题  条形装箱问题  后缀表达式  混合遗传算法
文章编号:1006-432X(2007)03-0076-03
修稿时间:2007-01-14

A Hybrid Genetic Algorithm Based on Suffix Expression of Strip Bin Packing
TANG Yan,JIA Hong-yu,JI Xian-biao.A Hybrid Genetic Algorithm Based on Suffix Expression of Strip Bin Packing[J].Journal of Kashgar Teachers College,2007,28(3):76-78.
Authors:TANG Yan  JIA Hong-yu  JI Xian-biao
Institution:1. School of Business Administration, Jimei University, Xiamen 361021, Fujian 2. School of economy and management, Dalian Maritime University, Dalian 116026, Liaonin
Abstract:Bin packing is a common operational problem,which is used widely in society.Bin packing problem can be divided into one dimension,two dimension,three dimension.The article mainly discusses the solution of strip bin packing of two dimension,which is combined with Genetic algorithm.And it uses suffix expression to encode the bin packing pattern and proposes the algorithm of decoding in detail.Finally it proves the algorithm is practical by using example.
Keywords:Bin packing problems  Strip bin packing  Suffix expression  Hybrid genetic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号