Dealing with nonregular shapes packing

DOI10.1155/2014/548957MaRDI QIDQ1718651zbMATH OpenOpenAlexWikidataFDO

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

Publication date 8 February 2019

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

Copyright license Creative Commons Attribution 3.0 Unported

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) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Irregular packing: MILP model based on a polygonal enclosure
• A tutorial in irregular shape packing problems
• Raster penetration map applied to the irregular packing problem
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A beam search implementation for the irregular shape packing problem
• A hybrid approach of bundle and Benders applied large mixed linear integer problem
• An improved typology of cutting and packing problems
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
• Fast neighborhood search for two- and three-dimensional nesting problems
• On genetic algorithms for the packing of polygons
• Orthogonal Packings in Two Dimensions
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• TOPOS -- A new constructive algorithm for nesting problems

Cited in

(19)

• Packing solar cells on a roof
• Non-uniform packings
• Placement of two- and three-dimensional irregular shapes for inertia moment and balance
• scientific article; zbMATH DE number 1708107 (Why is no real title available?)
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
• A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
• Irregular packing: MILP model based on a polygonal enclosure
• A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
• A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
• 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
• Jostling for position: local improvement for irregular cutting patterns
• A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
• A tutorial in irregular shape packing problems
• Raster penetration map applied to the irregular packing problem
• Descending packing algorithm for irregular graphics based on geometric feature points
• Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
• Geometric Packing under Nonuniform Constraints

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

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