Solving the one-dimensional bin packing problem with a weight annealing heuristic

Authors:
Kok-Hua Loh;Bruce Golden;Edward Wasil
Affiliations:
R. H. Smith School of Business, University of Maryland, College Park, MD 20742, USA;R. H. Smith School of Business, University of Maryland, College Park, MD 20742, USA;Kogod School of Business, American University, Washington, DC 20016, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 10
Cited 3

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
New heuristics for one-dimensional bin-packing

Computers and Operations Research
Performance of Various Computers Using Standard Linear Equations Software

Performance of Various Computers Using Standard Linear Equations Software
Guided Local Search for the Three-Dimensional Bin-Packing Problem

INFORMS Journal on Computing
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

Journal of Heuristics
See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
The noising method: a new method for combinatorial optimization

Operations Research Letters

Solving an avionics real-time scheduling problem by advanced IP-methods

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms

Information Sciences: an International Journal
Improving the performance of heuristic algorithms based on causal inference

MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we develop a new procedure that uses the concept of weight annealing to solve the one-dimensional bin packing problem. Our procedure is straightforward and easy to follow. We apply it to 1587 instances taken from benchmark problem sets and compare our results to those found in the literature. We find that our procedure produces very high-quality solutions very quickly and generates several new optimal solutions.