A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
From MaRDI portal
Publication:1761945
DOI10.1016/j.cor.2010.10.022zbMath1251.90245OpenAlexW2104860035MaRDI QIDQ1761945
Defu Zhang, Tao Wu, Stephen C. H. Leung, Chang-Le Zhou
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.022
Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm ⋮ Model and algorithm for container allocation problem with random freight demands in synchromodal transportation ⋮ An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery ⋮ A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ Rectangle packing with a recursive pilot method ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? ⋮ Two-dimensional knapsack-block packing problem ⋮ Scheduling with job-rejection and position-dependent processing times on proportionate flowshops ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ A comparative analysis of two matheuristics by means of merged local optima networks ⋮ The maximum diversity assortment selection problem ⋮ Designing vehicle routes for a mix of different request types, under time windows and loading constraints
Cites Work
- A new heuristic algorithm for rectangle packing
- Reactive GRASP for the strip-packing problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Packing problems
- Exact algorithms for the guillotine strip cutting/packing problem.
- On the two-dimensional knapsack problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Heuristics for the container loading problem
- Two-dimensional packing problems: a survey
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- Dynamic programming algorithms for generating optimal strip layouts
- An improved typology of cutting and packing problems
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- An Exact Approach to the Strip-Packing Problem
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
