An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem-Reference-Cited by-同舟云学术

An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

Published:2009-11 Issue:4 Volume:6 Page:345-361
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Imamichi Takashi,Yagiura Mutsunori,Nagamochi Hiroshi

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference20 articles.

1. B.K. Nielsen, A. Odgaard, Fast neighborhood search for the nesting problem, Technical Report 03/03, DIKU, Department of Computer Science, University of Copenhagen, 2003

2. Nesting two-dimensional shapes in rectangular modules;Adamowicz;Computer-Aided Design,1976

3. Optimal allocation of two-dimensional irregular shapes using heuristic search methods;Albano;IEEE Transactions on Systems, Man and Cybernetics SMC,1980

4. A 2-exchange heuristic for nesting problems;Gomes;European Journal of Operational Research,2002

5. TOPOS — a new constructive algorithm for nesting problems;Oliveira;OR Spektrum,2000

Cited by 66 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A hybrid Multi-Objective Optimization Approach for Efficient 3D Container Loading Problem;2024-08-30

2. An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry;Computers & Operations Research;2024-02

3. Optimizing Two-Dimensional Irregular Packing: A Hybrid Approach of Genetic Algorithm and Linear Programming;Applied Sciences;2023-11-18

4. A separation and compaction algorithm for the two-open dimension nesting problem using penetration-fit raster and obstruction map;Expert Systems with Applications;2023-06

5. Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes;European Journal of Operational Research;2022-12