On genetic algorithms for the packing of polygons
From MaRDI portal
Publication:1266576
DOI10.1016/0377-2217(94)00166-9zbMath0913.90229MaRDI 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
Related Items
Applying genetic algorithms and neural networks to the container loading problem, An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization, 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, The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio, Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory, Reactive GRASP for the strip-packing problem, Heuristic approaches for the two- and three-dimensional knapsack packing problem, Heuristics for the variable sized bin-packing problem, Exact algorithms for the two-dimensional strip packing problem with and without rotations, Cutting circles and polygons from area-minimizing rectangles, Exact algorithms for the guillotine strip cutting/packing problem., An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles, 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, Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem, A population heuristic for constrained two-dimensional non-guillotine cutting, On solving multiobjective bin packing problems using evolutionary particle swarm optimization, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, Design of rectangular packings using decoders of block structure, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces, A new heuristic recursive algorithm for the strip rectangular packing problem, Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle, 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, A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes, Analysis of distributed genetic algorithms for solving cutting problems, Two-dimensional profile-packing approach for multi-torch flame cutting
Uses Software
Cites Work
- A 2.5 times optimal algorithm for packing in two dimensions
- An improved BL lower bound
- Optimal packing and covering in the plane are NP-complete
- Orthogonal Packings in Two Dimensions
- A Multistage Solution of the Template-Layout Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
