Heuristics for the variable sized bin-packing problem

Authors:
Mohamed Haouari;Mehdi Serairi
Affiliations:
Department of Industrial and Systems Engineering, Faculty of Engineering, Ozyegin University, Istanbul, Turkey and ROI-Combinatorial Optimization Research Group, Ecole Polytechnique de Tunisie, BP ...;ROI-Combinatorial Optimization Research Group, Ecole Polytechnique de Tunisie, BP 743, 2078, La Marsa, Tunisia
Venue:
Computers and Operations Research
Year:
2009

Citing 14
Cited 8

Variable sized bin packing

SIAM Journal on Computing
An efficient approximation scheme for variable-sized bin packing

SIAM Journal on Computing
Bin packing with divisible item sizes

Journal of Complexity
Algorithms for railway crew management

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
A Lagrangian-based heuristic for large-scale set covering problems

Mathematical Programming: Series A and B - Special issue on computational integer programming
A genetic algorithm for a 2D industrial packing problem

Computers and Industrial Engineering
Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms

SIAM Journal on Computing
A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem

INFORMS Journal on Computing
A Heuristic Method for the Set Covering Problem

Operations Research
Modified subset sum heuristics for bin packing

Information Processing Letters
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems

INFORMS Journal on Computing
Relaxations and exact solution of the variable sized bin packing problem

Computational Optimization and Applications
The two-dimensional bin packing problem with variable bin sizes and costs

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

Operations Research Letters

A dynamic optimization model for power and performance management of virtualized clusters

Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Hybrid algorithms for the variable sized bin packing problem

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A genetic algorithm for the freight consolidation problem with one-dimensional container loading

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Variable neighbourhood search for the variable sized bin packing problem

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

Computers and Operations Research
Exploiting application dynamism and cloud elasticity for continuous dataflows

SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Energy-efficient task allocation techniques for asymmetric multiprocessor embedded systems

ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
The classroom assignment problem: Complexity, size reduction and heuristics

Applied Soft Computing

Quantified Score

Hi-index	0.02

Visualization

Abstract

We investigate the one-dimensional variable-sized bin-packing problem. This problem requires packing a set of items into a minimum-cost set of bins of unequal sizes and costs. Six optimization-based heuristics for this problem are presented and compared. We analyze their empirical performance on a large set of randomly generated test instances with up to 2000 items and seven bin types. The first contribution of this paper is to provide evidence that a set covering heuristic proves to be highly effective and capable of delivering very-high quality solutions within short CPU times. In addition, we found that a simple subset-sum problem-based heuristic consistently outperforms heuristics from the literature while requiring extremely short CPU times.