Solving nesting problems with non-convex polygons by constraint logic programming

DOI10.1111/1475-3995.00434MaRDI QIDQ4814103zbMATH OpenOpenAlexFDO

Authors Maria Antónia Carravilla, Cristina Ribeiro, José Fernando Oliveira

Publication date 7 September 2004

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/1475-3995.00434

zbMATH Keywords

packingnofit polygon

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Logic programming (68N17)

Recommendations

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Mixed-integer programming models for nesting problems
• Industrial linear optimization problems solved by constraint logic programming
• A customized branch-and-bound approach for irregular shape nesting
• A fully general, exact algorithm for nesting irregular shapes

Cites work

• scientific article; zbMATH DE number 1312992 (Why is no real title available?)
• A Solution of the Rectangular Cutting-Stock Problem
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
• Packing problems
• Solution approaches to irregular nesting problems

Cited in

(11)

• A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
• Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
• The irregular nesting problem: a new approach for nofit polygon calculation
• Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
• A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
• A clique covering MIP model for the irregular strip packing problem
• Irregular packing problems: a review of mathematical models
• Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
• An improved typology of cutting and packing problems
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Describes a project that uses

Uses Software

• SICStus

This page was built for publication: Solving nesting problems with non-convex polygons by constraint logic programming

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