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

多约束三维装箱问题的混合遗传算法
引用本文:陈泽爽,何健明,林逵.多约束三维装箱问题的混合遗传算法[J].电脑与微电子技术,2011(1):14-19.
作者姓名:陈泽爽  何健明  林逵
作者单位:中山大学,广州510000
摘    要:三维装箱问题提出至今已有很多研究成果,各种启发式算法配合遗传算法、蚁群算法和模拟退火算法的设计层出不穷。而针对于三维装箱问题的各种约束,虽然各自有相应的处理方法,但却没有一种方法可以整合各种约束条件,这是因为启发式算法往往容易满足部分约束却很难满足所有约束的特点。在前人研究的基础上,针对各种遗传算法的约束条件,设计可以相互组合的解决各种约束条件的算法,通过对这些算法规则组合,可以解决各种约束条件下的三维装箱问题。

关 键 词:三维装箱  多约束  混合遗传算法

Constrained Hybrid Genetic Algorithm of Multi-Dimensional Packing Problem
Authors:CHEN Ze-shuang  HE Jian-ming  LIN Kui
Affiliation:(SUN Yat-sen University,Guangzhou 510000)
Abstract:Since the three-dimensional bin packing problem raise,many heuristic methods and hybrid methods had been designed to figure out the problem.In the aspect of adding the limit in the real world to the question,although there are some methods figure out the limits respectively,we don't have had a methods to figure out all the limits at a same time.Designs methods for each limit and ensures they can combine with each other.By combining the methods,we can figure out all three-dimensional bin packing problem with any kind of limit.
Keywords:Three-Dimensional Packing  Multi-Limit  Hybrid Grouping Genetic Algorithm
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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