Dealing with nonregular shapes packing

DOI10.1155/2014/548957zbMath1407.90275OpenAlexW1973286186WikidataQ59065952 ScholiaQ59065952MaRDI QIDQ1718651

Bonfim Amaro Júnior, Pedro Gabriel Calíope Dantas Pinheiro, Rommel Dias Saraiva, Placido Rogerio Pinheiro

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/548957

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (4)

A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems ⋮ A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems ⋮ Raster penetration map applied to the irregular packing problem ⋮ A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation

Cites Work

• A hybrid approach of bundle and Benders applied large mixed linear integer problem
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• A beam search implementation for the irregular shape packing problem
• On genetic algorithms for the packing of polygons
• TOPOS -- A new constructive algorithm for nesting problems
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
• An improved typology of cutting and packing problems
• Fast neighborhood search for two- and three-dimensional nesting problems
• Orthogonal Packings in Two Dimensions
• Unnamed Item
• Unnamed Item

This page was built for publication: Dealing with nonregular shapes packing