On genetic algorithms for the packing of polygons

DOI10.1016/0377-2217(94)00166-9zbMath0913.90229OpenAlexW2171979979MaRDI QIDQ1266576

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00166-9

zbMATH Keywords

genetic algorithm packing problems placing polygons on a rectangular board

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items

A population heuristic for constrained two-dimensional non-guillotine cutting, A hybrid approach for packing irregular patterns using evolutionary strategies and neural network, A hybrid evolutionary algorithm for the two-dimensional packing problem, An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry, An effective shaking procedure for 2D and 3D strip packing problems, Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory, An improved typology of cutting and packing problems, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A tabu search algorithm for a two-dimensional non-guillotine cutting problem, A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem, Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic, Fast neighborhood search for two- and three-dimensional nesting problems, Logic based Benders' decomposition for orthogonal stock cutting problems, A clique covering MIP model for the irregular strip packing problem, A simple randomized algorithm for two-dimensional strip packing, An exact strip packing algorithm based on canonical forms, A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem, The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview, An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations, Generalized hyper-heuristics for solving 2D regular and irregular packing problems, An introduction to the two‐dimensional rectangular cutting and packing problem, A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands, Algorithms for nesting with defects, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, A squeaky wheel optimisation methodology for two-dimensional strip packing, An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects, On solving multiobjective bin packing problems using evolutionary particle swarm optimization, Exact algorithms for the guillotine strip cutting/packing problem., An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, Dealing with nonregular shapes packing, A note on ``Reducing the number of binary variables in cutting stock problems, A pseudo-parallel genetic algorithm integrating simulated annealing for stochastic location-inventory-routing problem with consideration of returns in e-commerce, A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem, Design of rectangular packings using decoders of block structure, Reactive GRASP for the strip-packing problem, Methods for multi-objective optimization: an analysis, A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems, A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems, Matheuristics for the irregular bin packing problem with free rotations, Heuristic approaches for the two- and three-dimensional knapsack packing problem, A beam search implementation for the irregular shape packing problem, An efficient deterministic heuristic for two-dimensional rectangular packing, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces, A new heuristic recursive algorithm for the strip rectangular packing problem, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes, A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study, Data set generation for rectangular placement problems, An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization, Two-dimensional profile-packing approach for multi-torch flame cutting, Exact solution techniques for two-dimensional cutting and packing, Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle, A fast implementation for the 2D/3D box placement problem, The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio, Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry, The maximum diversity assortment selection problem, An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles, Heuristics for the variable sized bin-packing problem, Deterministic model for customized pilot manufacture production with various backplane sizes, Exact algorithms for the two-dimensional strip packing problem with and without rotations, Cutting circles and polygons from area-minimizing rectangles, A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces, Applying genetic algorithms and neural networks to the container loading problem, Exact approaches for the cutting path determination problem, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, Analysis of distributed genetic algorithms for solving cutting problems, An algorithm for polygon placement using a bottom-left strategy, Two-dimensional packing problems: a survey, An effective quasi-human based heuristic for solving the rectangle packing problem, Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six, An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, An improved best-fit heuristic for the orthogonal strip packing problem, Irregular packing: MILP model based on a polygonal enclosure, Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem, A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation, A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering

Uses Software

Genocop

Cites Work