A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
From MaRDI portal
Publication:1992380
DOI10.1155/2017/1670709zbMath1426.90173OpenAlexW2754611409MaRDI QIDQ1992380
Bonfim Amaro Júnior, Pedro Veras Coelho, Placido Rogerio Pinheiro
Publication date: 5 November 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/1670709
Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (3)
Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems ⋮ Raster penetration map applied to the irregular packing problem
Uses Software
Cites Work
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- 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
- Solution approaches to irregular nesting problems
- On genetic algorithms for the packing of polygons
- TOPOS -- A new constructive algorithm for nesting problems
- Dealing with nonregular shapes packing
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- A 2-exchange heuristic for nesting problems
- Mixed-integer programming models for nesting problems
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Orthogonal Packings in Two Dimensions
- A Solution of the Rectangular Cutting-Stock Problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Solving nesting problems with non-convex polygons by constraint logic programming
- Polygon decomposition for efficient construction of Minkowski sums
This page was built for publication: A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
