Easy analyzer: An object-oriented framework for the experimental analysis of stochastic local search algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4638 LNCS, Issue , 2007, Pages 76-90

  Di Gaspero, Luca ^a   Roli, Andrea ^b   Schaerf, Andrea ^a  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); PROBLEM SOLVING; RANDOM PROCESSES; SOFTWARE ENGINEERING; STATISTICAL METHODS;

COMMAND-LINE EXECUTABLES; K-GRAPHCOLORING PROBLEM; SLS ALGORITHMS; STOCHASTIC LOCAL SEARCH ALGORITHMS;

OBJECT ORIENTED PROGRAMMING;

EID: 38049186733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (25)

1. Michel, L., Van Hentenryck, P.: Localizer. Constraints 5(1-2), 43-84 (2000)
2. Van Hentenryck, P., Michel, L. (eds.): Constraint-Based Local Search. MIT Press, Cambridge (MA), USA (2005)
3. Van Hentenryck, P., Michel, L.: Control abstractions for local search. Constraints 10(2), 137-157 (2005)
4. Fink, A., Voß, S.: HotFrame: A heuristic optimization framework. In [25] pp. 81-154
5. 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)
6. 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)
7. Di Gaspero, L., Schaerf, A.: Writing local search algorithms using EasyLocal++. In [25]
8. 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)
9. Hoos, H., Stützle, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann, San Francisco (CA), USA (2005)
10. Halim, S., Yap, R., Lau, H.: Viz: a visual analysis suite for explaining local search behavior. In: Proceedings of the 19th annual ACM symposium on User interface software and technology (UIST '06), pp. 57-66. ACM Press, New York (2006)
11. 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)
12. Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: elements of reusable object-oriented software. Addison-Wesley Publishing, Reading (MA), USA (1995)
13. 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)
14. Pilone, D., Pitman, N.: UML 2.0 in a Nutshell. O'Reilly Media, Inc. Sebastopol (CA), USA (2005)
15. Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), New York, USA (9-13 July 2002), pp. 11-18. Morgan Kaufmann Publishers, San Francisco (2002)
16. 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)
17. Jones, T., Rawlins, G.: Reverse hillclimbing, genetic algorithms and the busy beaver problem. In: Genetic Algorithms: Proceedings of the Fifth International Conference (ICGA 1993), San Mateo (CA), USA, pp. 70-75. Morgan Kaufmann Publishers, San Francisco (1993)
18. 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)
19. Taillard, E.: Few guidelines for analyzing methods. In: Proceedings of the 6th Metaheuristics International Conference (MIC'05), Vienna, Austria (August 2005)
20. Garey, M.R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
21. Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345-351 (1987)
22. Culberson, J.: Graph coloring page. URL (2004) Viewed: March 2007, Updated: March 2004, http://www.cs.ualberta.ca/-joe/Coloring/
23. 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)
24. Chiarandini, M., Basso, D., Stützle, T.: Statistical methods for the comparison of stochastic optimizers. In: Proceedings of the 6th Metaheuristics International Conference (MIC'05), Vienna, Austria, pp. 189-195 (2005)
25. Voß, S., Woodruff, D. (eds.): Optimization Software Class Libraries. OR/CS. Kluwer Academic Publishers, Dordrecht, the Netherlands (2002)