Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem | |
Leung, Stephen C. H. ; Lin, Yangbin ; Zhang, Defu ; Zhang DF(张德富) | |
刊名 | http://dx.doi.org/10.1016/j.cor.2011.05.025
![]() |
2012-03 | |
关键词 | NO-FIT POLYGON NESTING PROBLEMS DEPTH |
英文摘要 | National Nature Science Foundation of China [60773126]; This paper presents an extended local search algorithm (ELS) for the irregular strip packing problem. It adopts two neighborhoods, swapping two given polygons in a placement and placing one polygon into a new position. The local search algorithm is used to minimize the overlap on the basis of the neighborhoods mentioned above and the unconstrained nonlinear programming model is adopted to further minimize the overlap during the search process. Moreover, the tabu search algorithm is used to avoid local minima, and a compact algorithm is presented to improve the result. The results of standard test instances indicate that when compared with other existing algorithms, the presented algorithm does not only show some signs of competitive power but also updates several best known results. (C) 2011 Elsevier Ltd. All rights reserved. |
语种 | 英语 |
内容类型 | 期刊论文 |
源URL | [http://dspace.xmu.edu.cn/handle/2288/70921] ![]() |
专题 | 信息技术-已发表论文 |
推荐引用方式 GB/T 7714 | Leung, Stephen C. H.,Lin, Yangbin,Zhang, Defu,et al. Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem[J]. http://dx.doi.org/10.1016/j.cor.2011.05.025,2012. |
APA | Leung, Stephen C. H.,Lin, Yangbin,Zhang, Defu,&张德富.(2012).Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem.http://dx.doi.org/10.1016/j.cor.2011.05.025. |
MLA | Leung, Stephen C. H.,et al."Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem".http://dx.doi.org/10.1016/j.cor.2011.05.025 (2012). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论