Authors: Roman Potarusov, Hamid Allaoui, Gilles Goncalves, Victor Kureychik
Addresses: Department of CAD, Taganrog Institute of Technology, Southern Federal University, Taganrog, Russia. ' Faculte des Sciences Appliquees, Universite d'Artois, Technoparc Futura, 62400 Bethune, France. ' Faculte des Sciences Appliquees, Universite d'Artois, Technoparc Futura, 62400 Bethune, France. ' Department of CAD, Taganrog Institute of Technology, Southern Federal University, Taganrog, Russia
Abstract: This paper deals with the one-dimensional Bin Packing Problem (1-D BPP). Exact solution methods can only be used for very small instances, hence for real-world problems we have to focus on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to this problem, including Genetic Algorithms and Evolutionary Programming. In this paper, we propose a Hybrid Genetic Algorithm (HGA) to solve 1-D BPP. We compare our approach with algorithms given by Scholl et al., Alvim et al. and Kok-Hua et al. Then we discuss the performance of the approach. We show that giving at least the same performance on term of quality solution, our HGA approach outperforms these algorithms on term of computational time. This performance is due to new mechanisms of hybridisation of genetic algorithms and local search.
Keywords: bin packing; hybrid genetic algorithms; one-dimensional problems; heuristic methods; evolutionary programming; quality solutions; computational time; hybridisation; local searches; Kok-Hua Loh; Armin Scholl; Adriana Alvim; services operations; services management; informatics; logistics.
International Journal of Services Operations and Informatics, 2011 Vol.6 No.1/2, pp.71 - 85
Available online: 28 Jan 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article