Improved local search algorithms for the rectangle packing problem with general spatial costs

DOI10.1016/j.ejor.2004.02.020zbMath1074.90022OpenAlexW2104943808MaRDI QIDQ2484340

Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura

Publication date: 1 August 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.02.020

zbMATH Keywords

Dynamic programmingPackingLocal searchGeneral spatial costSequence pair

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Dynamic reduction heuristics for the rectangle packing area minimization problem, An exact strip packing algorithm based on canonical forms, Space and time allocation in a shipyard assembly hall, Optimizing yard assignment in an automotive transshipment terminal, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Handling precedence constraints in scheduling problems by the sequence pair representation, A personal perspective on problem solving by general purpose solvers, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio, Exact algorithms for the two-dimensional strip packing problem with and without rotations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing problems
• Local search algorithms for the rectangle packing problem with general spatial costs
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
• Two-dimensional packing problems: a survey
• An effective quasi-human based heuristic for solving the rectangle packing problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• Packing problems and project scheduling models: an integrating perspective
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Multistage Cutting Stock Problems of Two and More Dimensions