New heuristics for one-dimensional bin-packing

Authors:
Krzysztof Fleszar;Khalil S. Hindi
Affiliations:
Department of Systems Engineering, Brunel University, Uxbridge, Middlesex, UK;Department of Systems Engineering, Brunel University, Uxbridge, Middlesex, UK
Venue:
Computers and Operations Research
Year:
2002

Citing 3
Cited 21

BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem

Computers and Operations Research
Variable neighborhood search

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

A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

Journal of Heuristics
An effective hybrid algorithm for the problem of packing circles into a larger containing circle

Computers and Operations Research
Modified subset sum heuristics for bin packing

Information Processing Letters
Hybrid procedure to determine optimal workforce without noise hazard exposure

Computers and Industrial Engineering
A genetic algorithm with exon shuffling crossover for hard bin packing problems

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Solving the one-dimensional bin packing problem with a weight annealing heuristic

Computers and Operations Research
Evolutionary based heuristic for bin packing problem

Computers and Industrial Engineering
An Application of Causality for Representing and Providing Formal Explanations about the Behavior of the Threshold Accepting Algorithm

ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic

Expert Systems with Applications: An International Journal
Evaluating performance advantages of grouping genetic algorithms

Engineering Applications of Artificial Intelligence
Modified subset sum heuristics for bin packing

Information Processing Letters
Benchmarking a wide spectrum of metaheuristic techniques for the radio network design problem

IEEE Transactions on Evolutionary Computation
A causal approach for explaining why a heuristic algorithm outperforms another in solving an instance set of the bin packing problem

ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Solving an avionics real-time scheduling problem by advanced IP-methods

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A genetic algorithm for the freight consolidation problem with one-dimensional container loading

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Frequency distribution based hyper-heuristic for the bin-packing problem

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
A reconfigurable computing platform for real time embedded applications

Microprocessors & Microsystems
Energy efficient spatial TDMA scheduling in wireless networks

Computers and Operations Research
Efficient algorithms for real-life instances of the variable size bin packing problem

Computers and Operations Research
Fast lifting procedures for the bin packing problem

Discrete Optimization
Worst-case analysis of the subset sum algorithm for bin packing

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

Several new heuristics for solving the one-dimensional bin packing problem are presented. Some of these are based on the minimal bin slack (MBS) heuristic of Gupta and Ho. A different algorithm is one based on the variable neighbourhood search metaheuristic. The most effective algorithm turned out to be one based on running one of the former to provide an initial solution for the latter. When tested on 1370 benchmark test problem instances from two sources, this last hybrid algorithm proved capable of achieving the optimal solution for 1329, and could find for 4 instances solutions better than the best known. This is remarkable performance when set against other methods, both heuristic and optimum seeking.