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

DOI10.1016/J.EJOR.2004.02.020zbMATH Open1074.90022OpenAlexW2104943808MaRDI QIDQ2484340FDOQ2484340

Authors: Shinji Imahori, Toshihide Ibaraki, 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

Recommendations

• Local search algorithms for the rectangle packing problem with general spatial costs
• The rectangular packing problem: local optimum search methods based on block structures
• Oriented aligned rectangle packing problem
• scientific article; zbMATH DE number 4091172
• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM

zbMATH Keywords

Dynamic programmingLocal searchPackingGeneral spatial costSequence pair

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Multistage Cutting Stock Problems of Two and More Dimensions
• Two-dimensional packing problems: a survey
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• Formulation and tabu search algorithm for the resource constrained project scheduling problem.
• Title not available (Why is that?)
• Packing problems
• An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
• 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
• Local search algorithms for the rectangle packing problem with general spatial costs

Cited In (15)

• Bidirectional best-fit heuristic for orthogonal rectangular strip packing
• A Local Optimization-based Solution to the Rectangle Layout Problem
• The rectangular packing problem: local optimum search methods based on block structures
• Optimizing yard assignment in an automotive transshipment terminal
• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• Space and time allocation in a shipyard assembly hall
• An exact strip packing algorithm based on canonical forms
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
• An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
• Packing squares independently
• A personal perspective on problem solving by general purpose solvers
• 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
• Local search algorithms for the rectangle packing problem with general spatial costs
• Dynamic reduction heuristics for the rectangle packing area minimization problem

This page was built for publication: Improved local search algorithms for the rectangle packing problem with general spatial costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484340)