dc.contributor.author 陈胜达 dc.contributor.author 张德富 dc.contributor.author 刘艳娟 dc.date.accessioned 2017-11-14T03:19:28Z dc.date.available 2017-11-14T03:19:28Z dc.date.issued 2007-05-05 dc.identifier.citation 计算机工程,2007,(09):195-196,199 dc.identifier.issn 1000-3428 dc.identifier.other JSJC200709069 dc.identifier.uri https://dspace.xmu.edu.cn/handle/2288/156689 dc.description.abstract 提出了利用近似算法求解二维矩形装箱问题的最小高度的一种方法。该方法基于启发式递归策略和遗传算法。利用启发式递归策略把所有大小各异的矩形都装入宽度固定的矩形容器中,并计算装完后所需容器的高度,用遗传算法的进化能力优化高度,使得所需容器的高度尽可能小。计算数据证明这种方法能够得到很好的结果,特别是对数据量大的测试问题,效果更好。 dc.description.abstract An evolutionary approximation algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This method is mainly based on heuristic strategies and genetic algorithm.The heuristic strategies are used to calculate the height of the packing order,and then the evolutionary capability of genetic algorithm to reduce the height is used.The computational results on well-known benchmark problems show that the presented approximation algorithm can compete with other algorithms based on genetic algorithm.Especially for large test problems,it performs better. dc.description.sponsorship 厦门大学院士启动基金资助项目(XX01109) dc.language.iso zh_CN dc.subject 装箱问题 dc.subject 启发式 dc.subject 递归 dc.subject 遗传算法 dc.subject Packing problems dc.subject Heuristic dc.subject Recursive dc.subject Genetic algorithm dc.title 求解矩形装箱问题的一种近似算法 dc.title.alternative An Evolutionary Approximation Algorithm for Strip Rectangular Packing Problem dc.type Article
﻿