An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem

DOI10.1111/ITOR.12138zbMATH Open1338.90357OpenAlexW2029453238MaRDI QIDQ2803256FDOQ2803256

Xianhao Xu, Lijun Wei, Brenda Cheang, Hu Qin

Publication date: 4 May 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12138

Recommendations

• A recursive heuristic algorithm for 2D rectangular strip packing problems
• An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
• Computational Science – ICCS 2005
• A simple randomized algorithm for two-dimensional strip packing
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem

zbMATH Keywords

heuristiclocal searchpackingintelligent search algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• An improved typology of cutting and packing problems
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Two-dimensional packing problems: a survey
• Orthogonal Packings in Two Dimensions
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• A typology of cutting and packing problems
• A reference length approach for the 3D strip packing problem
• A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
• A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
• Constraints in container loading -- a state-of-the-art review
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• A new heuristic recursive algorithm for the strip rectangular packing problem
• Exact solution of the two-dimensional finite bin packing problem
• A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Two-Dimensional Finite Bin-Packing Algorithms
• An Algorithm for Two-Dimensional Cutting Problems
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• The multiple container loading cost minimization problem
• A branch and bound algorithm for the strip packing problem
• Packing problems
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• A simple randomized algorithm for two-dimensional strip packing
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• Reactive GRASP for the strip-packing problem
• A least wasted first heuristic algorithm for the rectangular packing problem
• An efficient deterministic heuristic for two-dimensional rectangular packing
• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
• An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
• A squeaky wheel optimisation methodology for two-dimensional strip packing
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
• An improved best-fit heuristic for the orthogonal strip packing problem

Cited In (11)

• Exact solution techniques for two-dimensional cutting and packing
• An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
• VCS: A new heuristic function for selecting boxes in the single container loading problem
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries
• A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
• Rectangle packing with a recursive pilot method
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
• Triple-solution approach for the strip packing problem with two-staged patterns

This page was built for publication: An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem

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