A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
From MaRDI portal
Publication:3401326
DOI10.1111/j.1475-3995.2009.00701.xzbMath1179.90275OpenAlexW1987129798MaRDI QIDQ3401326
Tobias Winter, Andreas Bortfeldt
Publication date: 29 January 2010
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.2009.00701.x
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (13)
A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ A joint replenishment problem considering multiple trucks with shipment and resource constraints ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Two-dimensional knapsack-block packing problem ⋮ Solving 0-1 knapsack problems based on amoeboid organism algorithm ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ Heuristics for packing semifluids ⋮ The maximum diversity assortment selection problem
Cites Work
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Solution for the constrained Guillotine cutting problem by simulated annealing
- On genetic algorithms for the packing of polygons
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- On the two-dimensional knapsack problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- An improved version of Wang's algorithm for two-dimensional cutting problems
- 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
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- 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
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- Handbook of metaheuristics
- A hybrid genetic algorithm for the container loading problem
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
This page was built for publication: A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
