Exact approaches for the cutting path determination problem

DOI10.1016/J.COR.2019.104772MaRDI QIDQ2329729zbMATH OpenOpenAlexWikidataFDO

Authors Everton Fernandes Silva, Larissa Tebaldi Oliveira, José Fernando Oliveira, Franklina M. B. Toledo

Publication date 18 October 2019

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2019.104772

zbMATH Keywords

cutting and packingcutting pathmathematical model

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Heuristics for a dynamic rural postman problem
• A two-phase roll cutting problem
• Cut scheduling in the apparel industry
• An algorithm for the determination of optimal cutting patterns
• scientific article; zbMATH DE number 2042671

Cites work

• A clique covering MIP model for the irregular strip packing problem
• A compact transformation of arc routing problems into node routing problems
• A comparative analysis of several asymmetric traveling salesman problem formulations
• Algorithms for nesting with defects
• An improved typology of cutting and packing problems
• Arc Routing
• Arc Routing Problems, Part II: The Rural Postman Problem
• Capacitated arc routing problems
• Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
• Exact methods based on node-routing formulations for undirected arc-routing problems
• Heuristics for a dynamic rural postman problem
• scientific article; zbMATH DE number 3278972 (Why is no real title available?)
• scientific article; zbMATH DE number 3298367 (Why is no real title available?)
• scientific article; zbMATH DE number 3335671 (Why is no real title available?)
• Jostling for position: local improvement for irregular cutting patterns
• On general routing problems
• On genetic algorithms for the packing of polygons
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• The open capacitated arc routing problem
• TOPOS -- A new constructive algorithm for nesting problems
• Transforming arc routing into node routing problems
• Using a tabu search approach for solving the two-dimensional irregular cutting problem

Cited in

(8)

• Exact solutions for constrained two-dimensional cutting problems
• Constructing of OE-postman path for a planar graph
• scientific article; zbMATH DE number 3978796 (Why is no real title available?)
• scientific article; zbMATH DE number 2042671 (Why is no real title available?)
• Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment
• Exact approaches for the unconstrained two-dimensional cutting problem with defects
• Construction of a technologically feasible cutting with pierce points placement constraints
• A parameterized lower bounding method for the open capacitated arc routing problem

Describes a project that uses

Uses Software

• TOPOS

This page was built for publication: Exact approaches for the cutting path determination problem

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