Abstract
This paper promotes the application of empirical techniques of analysis within computer science in order to construct models that explain the performance of heuristic algorithms for NP-hard problems. We show the application of an experimental approach that combines exploratory data analysis and causal inference with the goal of explaining the algorithmic optimization process. The knowledge gained about problem structure, the heuristic algorithm behavior and the relations among the characteristics that define them, can be used to: a) classify instances of the problem by degree of difficulty, b) explain the performance of the algorithm for different instances c) predict the performance of the algorithm for a new instance, and d) develop new strategies of solution. As a case study we present an analysis of a state of the art genetic algorithm for the Bin Packing Problem (BPP), explaining its behavior and correcting its effectiveness of 84.89% to 95.44%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M.R., Jonson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company. A classic introduction to the field (1979)
Basse, S.: Computer Algorithms, Introduction to Design and Analysis. Editorial Addison-Wesley Publishing Company (1998)
Cruz Reyes, L., Nieto-Yáñez, D.M., Rangel-Valdez, N., Herrera Ortiz, J.A., González B, J., Castilla Valdez, G., Delgado-Orta, J.F.: DiPro: An Algorithm for the Packing in Product Transportation Problems with Multiple Loading and Routing Variants. In: Gelbukh, A., Kuri Morales, Á.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 1078–1088. Springer, Heidelberg (2007)
McGeoch, C.C.: Experimental Analysis of Algorithms. In: Pardalos, P.M., Romeijn (eds.) Handbook of Global Optimization, vol. 2, pp. 489–513 (2002)
Hoos, H.H., Stützle, T.: Empirical Analysis of Randomized Algorithms. In: Handbook of Approximation Algorithms and Metaheuristics. Chapman & Hall/CRC, Taylor & Francis Group (2007)
Hooker, J.N.: Needed: An empirical science of algorithms. Operations Research 42(2), 201–212 (1994)
Barr, S., Golden, L., Kelly, P., Resendez, M., Stewart, R.: Designing and Reporting on Computational Experiments with Heuristic Methods. Journal of Heuristics 1, 9–32 (1995)
Cohen, P.R.: Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge (1995)
Lemeire, J.: Learning Causal Models of Multivariate Systems and the Value of it for the Performance Modeling of Computer Programs. PhD thesis. Vrije Universiteit Brussel (2007)
Tukey, J.W.: Exploratory Data Analysis. Addison-Wesley (1977)
Hartwig, F., Dearing, B.E.: Exploratory Data Analysis. Sage University Paper Series on Quantitative Research Methods, vol. 16. Sage, Newbury Park (1979)
Liu, X.: Intelligent Data Analysis: Issues and Challenges. The Knowledge Engineering Review 11, 365–371 (1996)
Quiroz, M.: Caracterización de Factores de Desempeño de Algoritmos de Solución de BPP. Tesis de maestría, Instituto Tecnológico de Cd. Madero, Tamaulipas, México (2009)
Beasley, J.E.: OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990), http://people.brunel.ac.uk/~mastjjb/jeb/orlib/binpackinfo.html
Klein, R., Scholl, A.: Bin Packing benchmark data sets, http://www.wiwi.uni-jena.de/Entscheidung/binpp/
Euro Especial Interest Group on Cutting and Packing. One Dimensional Cutting and Packing Data Sets, http://paginas.fe.up.pt/~esicup/tiki-list_file_gallery.php?galleryId=1
Cutting and Packing at Dresden University. Benchmark data sets, http://www.math.tu-dresden.de/~capad/cpd-ti.html#pmp
Pérez, J., Pazos, R.R.A., Frausto, J., Rodríguez, G., Romero, D., Cruz, L.: A Statistical Approach for Algorithm Selection. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 417–431. Springer, Heidelberg (2004)
Álvarez, V.: Modelo para representar la Complejidad del problema y el desempeño de algoritmos. Tesis de maestría, Instituto Tecnológico de Cd. Madero, Tamaulipas, México (2006)
The TETRAD Project: Causal Models and Statistical Data. TETRAD Homepage, http://www.phil.cmu.edu/projects/tetrad/
Alvim, A.C.F., Ribeiro, C.C., Glover, F., Aloise, D.J.: A hybrid improvement heuristic for the onedimensional bin packing problem. Journal of Heuristics 10(2), 205–229 (2004)
Fleszar, K., Charalambous, C.: Average-weight-controlled bin-oriented heuristics for the onedimensional bin-packing problem. European Journal of Operational Research 210(2), 176–184 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Quiroz C., M., Cruz-Reyes, L., Torres-Jiménez, J., Gómez S., C.G., Fraire H., H.J., Melin, P. (2013). Improving the Performance of Heuristic Algorithms Based on Exploratory Data Analysis. In: Castillo, O., Melin, P., Kacprzyk, J. (eds) Recent Advances on Hybrid Intelligent Systems. Studies in Computational Intelligence, vol 451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33021-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-33021-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33020-9
Online ISBN: 978-3-642-33021-6
eBook Packages: EngineeringEngineering (R0)