A 2-exchange heuristic for nesting problems
From MaRDI portal
Publication:1847180
DOI10.1016/S0377-2217(02)00130-3zbMath1081.90611OpenAlexW2106783129MaRDI QIDQ1847180
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00130-3
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (30)
Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming ⋮ A hybrid approach for packing irregular patterns using evolutionary strategies and neural network ⋮ A hybrid algorithm for constrained order packing ⋮ Fast neighborhood search for two- and three-dimensional nesting problems ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ An effective heuristic for the two-dimensional irregular bin packing problem ⋮ Heuristics for a dynamic rural postman problem ⋮ A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands ⋮ Algorithms for nesting with defects ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet ⋮ A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems ⋮ Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations ⋮ A beam search implementation for the irregular shape packing problem ⋮ Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem ⋮ Mathematical model and efficient algorithms for object packing problem ⋮ A cutting stock problem and its solution in the manufacturing industry of large electric generators ⋮ Cutting path optimization in CNC cutting processes using a two-step genetic algorithm ⋮ Two-dimensional profile-packing approach for multi-torch flame cutting ⋮ Dynamic programming algorithms for generating optimal strip layouts ⋮ Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ MIP-based heuristic for non-standard 3D-packing problems ⋮ Solving the irregular strip packing problem via guided local search for overlap minimization ⋮ An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem ⋮ Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives ⋮ Irregular packing: MILP model based on a polygonal enclosure ⋮ A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
Uses Software
Cites Work
- Compaction and separation algorithms for non-convex polygons and their applications
- TOPOS -- A new constructive algorithm for nesting problems
- An algorithm for polygon placement using a bottom-left strategy
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
- Jostling for position: local improvement for irregular cutting patterns
This page was built for publication: A 2-exchange heuristic for nesting problems
