New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
From MaRDI portal
Publication:1046097
DOI10.1016/j.ejor.2009.07.024zbMath1177.90349OpenAlexW2078833192MaRDI QIDQ1046097
Nthabiseng Ntene, Jan H. van Vuuren, Frank G. Ortmann
Publication date: 21 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.07.024
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (16)
A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ Scheduling non-preemptible jobs to minimize peak demand ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ iGreen: green scheduling for peak demand minimization ⋮ An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Scheduling inspired models for two-dimensional packing problems ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ Lower bounds for three-dimensional multiple-bin-size bin packing problems ⋮ Constructive heuristics for the canister filling problem ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
- Average-case analysis of cutting and packing in two dimensions
- Recent advances on two-dimensional bin packing problems
- Reactive GRASP for the strip-packing problem
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- An application of simulated annealing to the cutting stock problem
- A 2.5 times optimal algorithm for packing in two dimensions
- On genetic algorithms for the packing of polygons
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Evaluation of algorithms for one-dimensional cutting
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- Approximation algorithm for the oriented two-dimensional bin 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
- Algorithms for the variable sized bin packing problem
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- Models and bounds for two-dimensional level packing problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- The two-dimensional bin packing problem with variable bin sizes and costs
- An improved typology of cutting and packing problems
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- Mathematical Methods of Organizing and Planning Production
- The Trim Problem
- An Exact Approach to the Strip-Packing Problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- A Linear Programming Approach to the Cutting-Stock Problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Variable Sized Bin Packing
- Two-Dimensional Finite Bin-Packing Algorithms
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- A algorithm for two-dimensional packing
- On Packing Two-Dimensional Bins
- Performance Bound for Bottom-Left Guillotine Packing of Rectangles
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- An algorithm for a cutting stock problem on a strip
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- Data set generation for rectangular placement problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
This page was built for publication: New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
