Abstract
One of the aspects of applying software engineering to Stochastic Local Search (SLS) is the principled analysis of the features of the problem instances and the behavior of SLS algorithms, which —because of their stochastic nature— might need sophisticated statistical tools.
In this paper we describe EasyAnalyzer, an object-oriented framework for the experimental analysis of SLS algorithms, developed in the C++ language. EasyAnalyzer integrates with EasyLocal++, a framework for the development of SLS algorithms, in order to provide a unified development and analysis environment. Moreover, the tool has been designed so that it can be easily interfaced also with SLS solvers developed using other languages/tools and/or with command-line executables.
We show an example of the use of EasyAnalyzer applied to the analysis of SLS algorithms for the k-GraphColoring problem.
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
Michel, L., Van Hentenryck, P.: Localizer. Constraints 5(1–2), 43–84 (2000)
Van Hentenryck, P., Michel, L. (eds.): Constraint-Based Local Search. MIT Press, Cambridge (2005)
Van Hentenryck, P., Michel, L.: Control abstractions for local search. Constraints 10(2), 137–157 (2005)
Fink, A., Voß, S.: HotFrame: A heuristic optimization framework. In: [25] pp. 81–154
Cahon, S., Melab, N., Talbi, E.G.: ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics. Journal of Heuristics 10(3), 357–380 (2004)
Voudouris, C., Dorne, R., Lesaint, D., Liret, A.: iOpt: A software toolkit for heuristic search methods. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 716–719. Springer, Heidelberg (2001)
Di Gaspero, L., Schaerf, A.: Writing local search algorithms using EasyLocal++. In: [25]
Di Gaspero, L., Schaerf, A.: EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software—Practice and Experience 33(8), 733–765 (2003)
Hoos, H., Stützle, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann, San Francisco (2005)
Halim, S., Yap, R., Lau, H.: Viz: a visual analysis suite for explaining local search behavior. In: UIST 2006. Proceedings of the 19th annual ACM symposium on User interface software and technology, pp. 57–66. ACM Press, New York (2006)
Lau, H., Wan, W., Lim, M., Halim, S.: A development framework for rapid meta-heuristics hybridization. In: Proceedings of the 28th Annual International Computer Software and Applications Conference (COMPSAC 2004), pp. 362–367 (2004)
Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: elements of reusable object-oriented software. Addison-Wesley Publishing, Reading (1995)
Fonlupt, C., Robilliard, D., Preux, P., Talbi, E.G.: Fitness landscapes and performance of metaheuristic. In: Voß, S., Martello, S., Osman, I., Roucairol, C. (eds.) Metaheuristics – Advances and Trends in Local Search Paradigms for Optimization, pp. 255–266. Kluwer Academic Publishers, Dordrecht (1999)
Pilone, D., Pitman, N.: UML 2.0 in a Nutshell. O’Reilly Media, Inc., Sebastopol (2005)
Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: GECCO 2002. Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA (9-13 July 2002), pp. 11–18. Morgan Kaufmann Publishers, San Francisco (2002)
Prestwich, S., Roli, A.: Symmetry breaking and local search spaces. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, Springer, Heidelberg (2005)
Jones, T., Rawlins, G.: Reverse hillclimbing, genetic algorithms and the busy beaver problem. In: ICGA 1993. Genetic Algorithms: Proceedings of the Fifth International Conference, San Mateo (CA), USA, pp. 70–75. Morgan Kaufmann Publishers, San Francisco (1993)
Birattari, M.: The race package for R. racing methods for the selection of the best. Technical Report TR/IRIDIA/2003-37, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium (2003)
Taillard, E.: Few guidelines for analyzing methods. In: Proceedings of the 6th Metaheuristics International Conference (MIC 2005), Vienna, Austria (August 2005)
Garey, M.R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345–351 (1987)
Culberson, J.: Graph coloring page. URL Viewed: March 2007, Updated: March 2004, (2004), http://www.cs.ualberta.ca/~joe/Coloring/
Di Gaspero, L., Chiarandini, M., Schaerf, A.: A study on the short-term prohibition mechanisms in tabu search. In: Proc. of the 17th European Conf. on Artificial Intelligence (ECAI-2006) Riva del Garda, Italy pp. 83–87 (2006)
Chiarandini, M., Basso, D., Stützle, T.: Statistical methods for the comparison of stochastic optimizers. In: Proceedings of the 6th Metaheuristics International Conference (MIC 2005), Vienna, Austria, pp. 189–195 (2005)
Voß, S., Woodruff, D. (eds.): Optimization Software Class Libraries. OR/CS. Kluwer Academic Publishers, Dordrecht, the Netherlands (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Gaspero, L., Roli, A., Schaerf, A. (2007). EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms. In: Stützle, T., Birattari, M., H. Hoos, H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2007. Lecture Notes in Computer Science, vol 4638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74446-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-74446-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74445-0
Online ISBN: 978-3-540-74446-7
eBook Packages: Computer ScienceComputer Science (R0)