A morph-based simulated annealing heuristic for a modified bin-packing problem
From MaRDI portal
Recommendations
- Bin-packing by simulated annealing
- scientific article; zbMATH DE number 4133847
- A simulated annealing algorithm for solving the two-dimensional rectangular packing problem in bins with tabu areas
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Modified subset sum heuristics for bin packing
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
Cited in
(6)- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- Bin-packing by simulated annealing
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- scientific article; zbMATH DE number 4133847 (Why is no real title available?)
- Exact and approximate methods for a one-dimensional minimax bin-packing problem
- Augmented neural networks and problem structure-based heuristics for the bin-packing problem
This page was built for publication: A morph-based simulated annealing heuristic for a modified bin-packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363746)
