Reactive GRASP for the strip-packing problem
From MaRDI portal
Publication:941532
DOI10.1016/j.cor.2006.07.004zbMath1179.90269OpenAlexW1982886000MaRDI QIDQ941532
Ramón Alvarez-Valdés, José Manuel Tamarit, Francisco Parreño
Publication date: 1 September 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.07.004
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (38)
A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ An effective shaking procedure for 2D and 3D strip packing problems ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ A nonmonotone GRASP ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ A customized branch-and-bound approach for irregular shape nesting ⋮ Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ Triple-solution approach for the strip packing problem with two-staged patterns ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A reference length approach for the 3D strip packing problem ⋮ The leader multipurpose shopping location problem ⋮ A new search procedure for the two-dimensional orthogonal packing problem ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ Scheduling inspired models for two-dimensional packing problems ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Ant colony optimization for the two-dimensional loading vehicle routing problem ⋮ 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 ⋮ Order and static stability into the strip packing problem ⋮ Bidirectional best-fit heuristic for orthogonal rectangular strip packing ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ 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 ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ A branch and bound algorithm for the strip packing problem ⋮ Exact algorithms for the two-dimensional strip packing problem with and without rotations ⋮ A hybrid metaheuristic for the two-dimensional strip packing problem ⋮ Using a greedy random adaptative search procedure to solve the cover printing problem ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle ⋮ Towards an efficient resolution of printing problems ⋮ An improved best-fit heuristic for the orthogonal strip packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- A probabilistic heuristic for a computationally difficult set covering problem
- On genetic algorithms for the packing of polygons
- Some experiments with simulated annealing techniques for packing problems
- GRASP for set packing problems.
- 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
- A typology of cutting and packing problems
- 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
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Resolution of strip-packing problems with genetic algorithms
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- Orthogonal Packings in Two Dimensions
- An Algorithm for Two-Dimensional Cutting Problems
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- New heuristic and interactive approaches to 2D rectangular strip packing
- Data set generation for rectangular placement problems
This page was built for publication: Reactive GRASP for the strip-packing problem
