skip to main content

Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem.(Report)

Leung, Stephen C. H. ; Lin, Yangbin ; Zhang, Defu

Computers & Operations Research, March, 2012, Vol.39(3), p.678(9) [Periódico revisado por pares]

Texto completo disponível

Citações Citado por
  • Título:
    Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem.(Report)
  • Autor: Leung, Stephen C. H. ; Lin, Yangbin ; Zhang, Defu
  • Assuntos: Algorithms ; Management Science
  • É parte de: Computers & Operations Research, March, 2012, Vol.39(3), p.678(9)
  • Descrição: To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.cor.2011.05.025 Byline: Stephen C.H. Leung (a), Yangbin Lin (b), Defu Zhang (b) Keywords: Irregular strip packing problem; Nesting; Local search; Unconstrained nonlinear programming; Tabu search Abstract: 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. Author Affiliation: (a) Department of Management Sciences, City University of Hong Kong, Hong Kong (b) Department of Computer Science, Xiamen University, Xiamen 361005, China
  • Idioma: English

Buscando em bases de dados remotas. Favor aguardar.