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

一种用遗传算法求解装箱问题的新编码方法
引用本文:程浩,刘心报,刘林,经怀明. 一种用遗传算法求解装箱问题的新编码方法[J]. 合肥工业大学学报(自然科学版), 2006, 29(2): 144-146
作者姓名:程浩  刘心报  刘林  经怀明
作者单位:合肥工业大学,管理学院,安徽,合肥,230009;合肥工业大学,管理学院,安徽,合肥,230009;合肥工业大学,管理学院,安徽,合肥,230009;合肥工业大学,管理学院,安徽,合肥,230009
摘    要:装箱问题在实际生产中应用非常广泛,然而在传统装箱问题中箱子的容量是固定的,并没有考虑多种容量箱子的问题;文章提出一种用遗传算法求解装箱问题的新编码方法,并用单亲遗传算法实现;这种算法和混合遗传算法相比,有编码简单、收敛快及实现容易等优点。

关 键 词:单亲遗传算法  装箱问题  组合优化
文章编号:1003-5060(2006)02-0144-04
修稿时间:2005-02-25

A new coding method that uses the genetic algorithm to solve the bin-packing problem
CHENG Hao,LIU Xin-bao,LIU Lin,JING Huai-ming. A new coding method that uses the genetic algorithm to solve the bin-packing problem[J]. Journal of Hefei University of Technology(Natural Science), 2006, 29(2): 144-146
Authors:CHENG Hao  LIU Xin-bao  LIU Lin  JING Huai-ming
Abstract:The bin-packing problem has been applied widely in practical engineering,however,the capacity of the box is fixed in the traditional bin-packing problem,and the various capacity of the box has not been considered.In this paper,a new coding method is put forward in which the genetic algorithm is used to solve the bin-packing problem,and the partheno-genetic algorithm in employed to simulate it.Compared with the hybrid genetic algorithm,the presented algorithm has the advantages of coding simply,converging quickly and realizing easily.
Keywords:partheno-genetic algorithm  bin-packing problem  combinatorial optimization
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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