An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
From MaRDI portal
Publication:1806919
DOI10.1016/S0377-2217(97)00437-2zbMath0970.90077OpenAlexW2095301036MaRDI QIDQ1806919
Publication date: 20 December 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00437-2
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (36)
A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ A hybrid genetic algorithm for the two-dimensional single large object placement problem ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ Packing unequal rectangles and squares in a fixed size circular container using formulation space search ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations ⋮ Generalized hyper-heuristics for solving 2D regular and irregular packing problems ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ On solving multiobjective bin packing problems using evolutionary particle swarm optimization ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Design of rectangular packings using decoders of block structure ⋮ 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 ⋮ Matheuristics for the irregular bin packing problem with free rotations ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ An efficient deterministic heuristic for two-dimensional rectangular packing ⋮ Improved local search algorithms for the rectangle packing problem with general spatial costs ⋮ 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 ⋮ Data set generation for rectangular placement problems ⋮ An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization ⋮ 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 ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems ⋮ An algorithm for polygon placement using a bottom-left strategy ⋮ An effective quasi-human based heuristic for solving the rectangle packing problem ⋮ An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
Uses Software
Cites Work
This page was built for publication: An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
