Heuristic Solution of Open Bin Packing Problems

Authors:
Ian P. Gent
Affiliations:
Department of Computer Science, University of Strathclyde, Glasgow G1 1XH, United Kingdom. E-mail: ipg@cs.strath.ac.uk
Venue:
Journal of Heuristics
Year:
1998

Citing 6
Cited 18

Lower bounds and reduction procedures for the bin packing problem

Discrete Applied Mathematics - Combinatorial Optimization
Phase transitions and the search problem

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
From approximate to optimal solutions: constructing pruning and propagation rules

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
The constrainedness of search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

On Method Overfitting

Journal of Heuristics
A Response to ’’On method overfitting‘‘

Journal of Heuristics
Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics

Journal of Heuristics
Incremental bin packing

Neural, Parallel & Scientific Computations
New Classes of Lower Bounds for Bin Packing Problems

Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
A new algorithm for optimal bin packing

Eighteenth national conference on Artificial intelligence
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

Journal of Heuristics
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing

Computers and Operations Research
An improved algorithm for optimal bin packing

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
A hyper-heuristic framework with XCS: learning to create novel problem-solving algorithms constructed from simpler algorithmic ingredients

IWLCS'03-05 Proceedings of the 2003-2005 international conference on Learning classifier systems
A composite algorithm for multiprocessor scheduling

Journal of Heuristics
Review: Measuring instance difficulty for combinatorial optimization problems

Computers and Operations Research
Solving problems with CP: four common pitfalls to avoid

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A hyper-heuristic classifier for one dimensional bin packing problems: improving classification accuracy by attribute evolution

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Weibull-Based benchmarks for bin packing

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Comparing several heuristics for a packing problem

International Journal of Advanced Intelligence Paradigms
Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Benchmark problems should be hard. I report on the solution of the five open benchmark problems introduced by Falkenauer in this journal for testing bin packing problems. Since the solutions were found either by hand or by using very simple heuristic methods, these problems would appear to be easy. In four cases I give improved packings to refute conjectures that previously reported packings were optimal, and I give a proof that the fifth conjecture was correct. In some cases this led to implemented heuristic methods which produced better solutions than those reported by Falkenauer and up to 10,000 times faster. Future experimenters should be careful to perform tests on problems that can reasonably be regarded as hard.