Analysis of distributed genetic algorithms for solving cutting problems

DOI10.1111/j.1475-3995.2006.00555.xzbMath1127.90057OpenAlexW2035061460MaRDI QIDQ3422369

Carolina Salto, Juan Molina, Enrique Alba

Publication date: 13 February 2007

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2006.00555.x

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• MALLBA
• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recent advances on two-dimensional bin packing problems
• Guillotineable bin packing: A genetic approach
• The parallel genetic algorithm as function optimizer
• On genetic algorithms for the packing of polygons
• The solution of two-stage guillotine cutting stock problems having extremely varying order demands
• Parallel evolutionary algorithms can achieve super-linear performance
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
• Two-Dimensional Finite Bin-Packing Algorithms
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Multistage Cutting Stock Problems of Two and More Dimensions
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: Analysis of distributed genetic algorithms for solving cutting problems