A 2-exchange heuristic for nesting problems
From MaRDI portal
Recommendations
- Fast neighborhood search for two- and three-dimensional nesting problems
- TOPOS -- A new constructive algorithm for nesting problems
- scientific article; zbMATH DE number 437550
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- scientific article; zbMATH DE number 1313602
Cites work
- An algorithm for polygon placement using a bottom-left strategy
- Compaction and separation algorithms for non-convex polygons and their applications
- Jostling for position: local improvement for irregular cutting patterns
- TOPOS -- A new constructive algorithm for nesting problems
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
Cited in
(36)- MIP-based heuristic for non-standard 3D-packing problems
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- TOPOS -- A new constructive algorithm for nesting problems
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- A cutting stock problem and its solution in the manufacturing industry of large electric generators
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- Mathematical model and efficient algorithms for object packing problem
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- 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
- Irregular packing: MILP model based on a polygonal enclosure
- Fast neighborhood search for two- and three-dimensional nesting problems
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- A hybrid algorithm for constrained order packing
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
- Solving the irregular strip packing problem via guided local search for overlap minimization
- Two-dimensional profile-packing approach for multi-torch flame cutting
- An effective heuristic for the two-dimensional irregular bin packing problem
- Performance testing of rectangular parts-nesting heuristics
- Algorithms for nesting with defects
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
- A tetris beam search algorithm for the distributor's pallet loading problem
- A parallel branch-and-bound-and-check algorithm for nesting
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Heuristics for a dynamic rural postman problem
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- A beam search implementation for the irregular shape packing problem
This page was built for publication: A 2-exchange heuristic for nesting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847180)
