An agent-based approach to the two-dimensional guillotine bin packing problem
From MaRDI portal
Recommendations
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Guillotineable bin packing: A genetic approach
- Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
Cites work
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- A lower bound for the non-oriented two-dimensional bin packing problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An improved typology of cutting and packing problems
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
- Exact solution of the two-dimensional finite bin packing problem
- Guided local search for the three-dimensional bin-packing problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- scientific article; zbMATH DE number 1488076 (Why is no real title available?)
- scientific article; zbMATH DE number 2230208 (Why is no real title available?)
- Models and algorithms for three-stage two-dimensional bin packing
- On Packing Two-Dimensional Bins
- Recent advances on two-dimensional bin packing problems
- Resource augmentation in two-dimensional packing with orthogonal rotations
- Some experiments with simulated annealing techniques for packing problems
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-dimensional packing problems: a survey
Cited in
(18)- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- An analysis on convergence of data-driven approach to ship lock scheduling
- A multi-agent system for the weighted earliness tardiness parallel machine problem
- Constructive heuristics for the canister filling problem
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Sequential heuristic for the two-dimensional bin-packing problem
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- Metaheuristics for truck loading in the car production industry
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Cost-based decision-making in middleware virtualization environments
- 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
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
This page was built for publication: An agent-based approach to the two-dimensional guillotine bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011220)
