Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Constraints
Reverse HillclimbingGenetic Algorithms and the Busy Beaver Problem
Proceedings of the 5th International Conference on Genetic Algorithms
A Racing Algorithm for Configuring Metaheuristics
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
iOpt: A Software Toolkit for Heuristic Search Methods
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms
Software—Practice & Experience
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
A Development Framework for Rapid Meta-Heuristics Hybridization
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Control Abstractions for Local Search
Constraints
Constraint-Based Local Search
Viz: a visual analysis suite for explaining local search behavior
UIST '06 Proceedings of the 19th annual ACM symposium on User interface software and technology
UML 2.0 in a Nutshell (In a Nutshell (O'Reilly))
UML 2.0 in a Nutshell (In a Nutshell (O'Reilly))
A Study on the Short-Term Prohibition Mechanisms in Tabu Search
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Symmetry breaking and local search spaces
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
EasySyn++: a tool for automatic synthesis of stochastic local search algorithms
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
Journal of Heuristics
| Hi-index | 0.00 |
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.