CAJ | 학술논문

针对三维方形板材切割问题，提出一种有效的三维切割问题的聚合启发式混合算法（AG_HA）。该算法基于三维装箱的基本块，利用评估规则对可聚合基本块进行局部聚合，然后运用启发式算法得到初始切割方案，最后利用遗传算法对切割方案进行优化。对具有代表性测试数据的计算结果表明，该算法是解决三维方形板材切割问题的一种有效方法，且可与目前经典算法竞争。
침대삼유방형판재절할문제，제출일충유효적삼유절할문제적취합계발식혼합산법（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.