An agent-based approach to the two-dimensional guillotine bin packing problem
From MaRDI portal
Publication:1011220
DOI10.1016/j.ejor.2007.10.020zbMath1157.90514OpenAlexW2058056194MaRDI QIDQ1011220
Rym M'Hallah, Sergey Polyakovskiy
Publication date: 8 April 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.2007.10.020
Related Items (18)
A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ Constrained order packing: comparison of heuristic approaches for a new bin packing problem ⋮ Sequential heuristic for the two-dimensional bin-packing problem ⋮ A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Metaheuristics for truck loading in the car production industry ⋮ An analysis on convergence of data-driven approach to ship lock scheduling ⋮ Cost-based decision-making in middleware virtualization environments ⋮ A multi-agent system for the weighted earliness tardiness parallel machine problem ⋮ Constructive heuristics for the canister filling problem ⋮ Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers ⋮ Hybrid approach for the two-dimensional bin packing problem with two-staged patterns ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem ⋮ Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
Cites Work
- Recent advances on two-dimensional bin packing problems
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
- Some experiments with simulated annealing techniques for packing problems
- A lower bound for the non-oriented two-dimensional bin packing problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Two-dimensional packing problems: a survey
- A population heuristic for constrained two-dimensional non-guillotine cutting
- Resource augmentation in two-dimensional packing with orthogonal rotations
- An improved typology of cutting and packing problems
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
- Models and algorithms for three-stage two-dimensional bin packing
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- On Packing Two-Dimensional Bins
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Unnamed Item
- Unnamed Item
This page was built for publication: An agent-based approach to the two-dimensional guillotine bin packing problem
