CORC  > 北京大学  > 信息科学技术学院
A Hybrid Algorithm for solving the Optimal Layout Problem of Rectangular Pieces
Jiang, Xingbo ; Lu, Xiaoqing ; Liu, Chengcheng ; Li, Monan
2008
关键词PACKING
英文摘要In this paper, a hybrid algorithm, combined the adaptive simulated annealing genetic algorithm with the improved bottom-left algorithm, is presented for the optimal layout problem of rectangle pieces which is a NP-complete problem and possesses widespread applications in the industry. Adaptive genetic algorithm is adopted to change the probabilities of crossover and mutation automatically. Simulated annealing algorithm is used to modify the individuals whose fitness value is higher than the average fitness value of the population. The presented algorithm provides with global search capability of adaptive genetic algorithm and local search capability of simulated annealing algorithm. The computation results show that the optimal layout problem of rectangular pieces can be effectively solved by the hybrid algorithm.; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000269081800161&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 ; Computer Science, Theory & Methods; EI; CPCI-S(ISTP); 0
语种英语
DOI标识10.1109/ICYCS.2008.425
内容类型其他
源URL[http://ir.pku.edu.cn/handle/20.500.11897/162020]  
专题信息科学技术学院
推荐引用方式
GB/T 7714
Jiang, Xingbo,Lu, Xiaoqing,Liu, Chengcheng,et al. A Hybrid Algorithm for solving the Optimal Layout Problem of Rectangular Pieces. 2008-01-01.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace