An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

From MaRDI portal
Revision as of 03:19, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1592734

DOI10.1016/S0377-2217(99)00357-4zbMath0982.90044OpenAlexW2163144548MaRDI QIDQ1592734

B. C. H. Turton, E. Hopper

Publication date: 11 April 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00357-4




zbMATH Keywords

optimizationsimulated annealinggenetic algorithmspackingcutting


Mathematics Subject Classification ID

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


Related Items (86)

A block-based layer building approach for the 2D guillotine strip packing problem ⋮ A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang ⋮ A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ Boosting ant colony optimization via solution prediction and machine learning ⋮ An effective shaking procedure for 2D and 3D strip packing problems ⋮ An improved typology of cutting and packing problems ⋮ PackLib\(^{2}\): an integrated library of multi-dimensional 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 ⋮ A heuristic for the three-dimensional strip packing problem ⋮ Efficient implementations of construction heuristics for the rectilinear block packing problem ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ Exhaustive approaches to 2D rectangular perfect packings ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ Exact and approximate methods for parallel multiple-area spatial scheduling with release times ⋮ A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ Packing into the smallest square: worst-case analysis of lower bounds ⋮ Corner occupying theorem for the two-dimensional integral rectangle packing problem ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ A new heuristic algorithm for rectangle packing ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Generalized hyper-heuristics for solving 2D regular and irregular packing problems ⋮ Two dimensional guillotine cutting stock and scheduling problem in printing industry ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Rectangle packing with a recursive pilot method ⋮ A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM ⋮ A new search procedure for the two-dimensional orthogonal packing problem ⋮ A hybrid placement strategy for the three-dimensional strip packing problem ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ On solving multiobjective bin packing problems using evolutionary particle swarm optimization ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Metaheuristics for truck loading in the car production industry ⋮ A variable neighborhood search algorithm for the leather nesting problem ⋮ The Meet-in-the-Middle Principle for Cutting and Packing Problems ⋮ Asymptotically optimal scheduling of random malleable demands in smart grid ⋮ Packing Optimization of Free-Form Objects in Engineering Design ⋮ Reactive GRASP for the strip-packing problem ⋮ A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem ⋮ A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems ⋮ Spatial scheduling optimization algorithm for block assembly in shipbuilding ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ An efficient deterministic heuristic for two-dimensional rectangular packing ⋮ Improved local search algorithms for the rectangle packing problem with general spatial costs ⋮ Human-guided search ⋮ A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces ⋮ A new heuristic recursive algorithm for the strip rectangular packing problem ⋮ Bidirectional best-fit heuristic for orthogonal rectangular strip packing ⋮ A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes ⋮ An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ A fast implementation for the 2D/3D box placement problem ⋮ Packaging optimization using the dynamic vector fields method ⋮ The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ The maximum diversity assortment selection problem ⋮ An agent-based approach to the two-dimensional guillotine bin packing problem ⋮ A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem ⋮ A branch and bound algorithm for the strip packing problem ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints ⋮ Exact algorithms for the two-dimensional strip packing problem with and without rotations ⋮ A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces ⋮ Three-dimensional bin packing problem with variable bin height ⋮ Packing solar cells on a roof ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing ⋮ An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle ⋮ An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem ⋮ An improved best-fit heuristic for the orthogonal strip packing problem ⋮ An efficient deterministic optimization approach for rectangular packing problems ⋮ Effective loading in combined vehicle routing and container loading problems ⋮ 2DPackLib: a two-dimensional cutting and packing library ⋮ Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering


Uses Software



Cites Work




This page was built for publication: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1592734&oldid=13883298"
Powered by MediaWiki