摘要
针对三维方形板材切割问题,提出一种有效的三维切割问题的聚合启发式混合算法(AG_HA)。该算法基于三维装箱的基本块,利用评估规则对可聚合基本块进行局部聚合,然后运用启发式算法得到初始切割方案,最后利用遗传算法对切割方案进行优化。对具有代表性测试数据的计算结果表明,该算法是解决三维方形板材切割问题的一种有效方法,且可与目前经典算法竞争。
T hree-dim ensional board partitioning is one of the typical NP hard problem . This paper presents an efficientaggreg ateheuristicsearch algorithm forthree-dimensionalboard partitioning problem.Thisal gorithm partition aggregate block is determ ined by selection algorithm w ith evaluation rule in block partition phase according to a heuristic algorithm until one partition solution is founded. And then genetic algorithm is further used to im prove the partition plan. Com putational results on LN exam ple show that the algorithm is an effective m ethod to solve the three-dim ensionalboard partitioning problem and can com pete w ith the currentheuristics from the literature.
出处
《莆田学院学报》
2014年第5期26-29,共4页
Journal of putian University
基金
福建省教育厅科技项目(JB12175)
莆田市科技项目(2014G16)
关键词
三维方形板材切割
聚合
启发式算法
遗传算法
three-dim ensionalpartitioning
aggregate
heuristic algorithm
genetic algorithm
