A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem

DOI10.1080/03155986.1994.11732256MaRDI QIDQ4834078zbMATH OpenOpenAlexFDO

Authors Ahmed El-Bouri, N. Popplewell, Subramaniam Balakrishnan, Attahiru Sule Alfa

Publication date 23 May 1995

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1994.11732256

zbMATH Keywords

heuristicpriority rulesrestricted search proceduretwo-dimensional, bin-packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Sequential heuristic for the two-dimensional bin-packing problem
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Two-Dimensional Finite Bin-Packing Algorithms
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics

Cited in

(29)

• Two heuristics for the one-dimensional bin-packing problem
• A dynamic programming based heuristic for industrial buying of cardboard
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms
• A lower bound for the non-oriented two-dimensional bin packing problem
• Local search algorithms for the bin packing problem and their relationships to various construction heuristics
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• Approximation algorithm for the oriented two-dimensional bin packing problem
• A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
• Sequential heuristic for the two-dimensional bin-packing problem
• Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
• A two-phase heuristic algorithm for the label printing problem
• Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
• A set-covering-based heuristic approach for bin-packing problems
• A heuristic for solving large bin packing problems in two and three dimensions
• scientific article; zbMATH DE number 5911854 (Why is no real title available?)
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• Sum-of-squares heuristics for bin packing and memory allocation
• scientific article; zbMATH DE number 5732394 (Why is no real title available?)
• Two-Dimensional Finite Bin-Packing Algorithms
• A morph-based simulated annealing heuristic for a modified bin-packing problem
• A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
• Heuristic search algorithm for the rectangular fixed-size guillotine bin packing problem
• scientific article; zbMATH DE number 2163587 (Why is no real title available?)
• New heuristics for one-dimensional bin-packing
• Two heuristics for the label printing problem
• A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem
• Recent advances on two-dimensional bin packing problems
• A short note on a simple search heuristic for the diskspacking problem

This page was built for publication: A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem

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