TOPOS -- A new constructive algorithm for nesting problems

DOI10.1007/s002910050105zbMath0970.90123OpenAlexW2061458770MaRDI QIDQ1569799

José Fernando Oliveira, José Soeiro Ferreira, Antonio Miguel Gomes

Publication date: 21 October 2001

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002910050105

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

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 ⋮ An improved typology of cutting and packing problems ⋮ Fast neighborhood search for two- and three-dimensional nesting problems ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ A customized branch-and-bound approach for irregular shape nesting ⋮ 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 ⋮ An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects ⋮ Dealing with nonregular shapes packing ⋮ Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet ⋮ Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning ⋮ A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems ⋮ A beam search implementation for the irregular shape packing problem ⋮ TOPOS ⋮ Raster penetration map applied to the irregular packing problem ⋮ 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 ⋮ Exact approaches for the cutting path determination problem ⋮ A 2-exchange heuristic for nesting problems ⋮ An algorithm for polygon placement using a bottom-left strategy ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis ⋮ 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