.png){kind=icon}
.png){kind=icon}
Return
Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.05.025.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Irregular strip packing problem
Nesting
Local search
Unconstrained nonlinear programming
Tabu search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W