A population heuristic for constrained two-dimensional non-guillotine cutting
From MaRDI portal
Publication:1877899
DOI10.1016/S0377-2217(03)00139-5zbMath1056.90011MaRDI QIDQ1877899
Publication date: 19 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems, A hybrid heuristic algorithm for the 2D variable-sized bin packing problem, A hybrid evolutionary algorithm for the two-dimensional packing problem, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, 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 best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem, A multi-objective programming approach to 1.5-dimensional assortment problem, Infeasibility handling in genetic algorithm using nested domains for production planning, An EDA for the 2D knapsack problem with guillotine constraint, A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects, A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM, Maximizing revenue with allocation of multiple advertisements on a Web banner, A new quasi-human algorithm for solving the packing problem of unit equilateral triangles, Trim loss optimization by an improved differential evolution, Characterization and modelling of guillotine constraints, A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, Heuristic approaches for the two- and three-dimensional knapsack packing problem, A least wasted first heuristic algorithm for the rectangular packing problem, Three-dimensional container loading models with cargo stability and load bearing constraints, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects, The maximum diversity assortment selection problem, An agent-based approach to the two-dimensional guillotine bin packing problem, A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces, Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints, 2DPackLib: a two-dimensional cutting and packing library
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Cutting stock problems and solution procedures
- Packing problems
- On genetic algorithms for the packing of polygons
- A genetic algorithm for the multidimensional knapsack problem
- A genetic algorithm for the set covering problem
- An optimal algorithm for rectangle placement
- A genetic algorithm for the generalised assignment problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Heuristics for cardinality constrained portfolio optimization
- An evolutionary heuristic for the index tracking problem.
- A typology of cutting and packing problems
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Obtaining test problems via Internet
- Constraint handling in genetic algorithms: the set partitioning problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Modeling of packing problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An Algorithm for Two-Dimensional Cutting Problems
- Feature Article—Genetic Algorithms for the Operations Researcher
- Scheduling aircraft landings at London Heathrow using a population heuristic
