TOPOS -- A new constructive algorithm for nesting problems

DOI10.1007/S002910050105zbMATH Open0970.90123OpenAlexW2061458770MaRDI QIDQ1569799FDOQ1569799

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

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

Recommendations

• A 2-exchange heuristic for nesting problems
• Fast neighborhood search for two- and three-dimensional nesting problems
• A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
• scientific article; zbMATH DE number 1313602
• Algorithms for nesting with defects

Mathematics Subject Classification ID

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

Cited In (29)

• A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
• An algorithm for polygon placement using a bottom-left strategy
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Packing problems in space solved by CPLEX: an experimental analysis
• An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
• Solving the irregular strip packing problem via guided local search for overlap minimization
• A beam search implementation for the irregular shape packing problem
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
• Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
• A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
• A 2-exchange heuristic for nesting problems
• A clique covering MIP model for the irregular strip packing problem
• Raster penetration map applied to the irregular packing problem
• Algorithms for nesting with defects
• TOPOS
• An improved typology of cutting and packing problems
• Fast neighborhood search for two- and three-dimensional nesting problems
• A customized branch-and-bound approach for irregular shape nesting
• Exact approaches for the cutting path determination problem
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
• A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
• Heuristics for a dynamic rural postman problem
• An Algorithm for Optimal Procedural Nesting
• Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
• A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
• An object-based evolutionary algorithm for solving nesting problems
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
• Dealing with nonregular shapes packing

This page was built for publication: TOPOS -- A new constructive algorithm for nesting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569799)