Yet Another Local Search Method for Constraint Solving
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms
Software—Practice & Experience
Grid computing for parallel bioinspired algorithms
Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
A Modeling Layer for Constraint-Programming Libraries
INFORMS Journal on Computing
A local search system for solving constraint problems of declarative graph-based global constraints
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
Knowledge management in different software development approaches
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
International Journal of Applied Metaheuristic Computing
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
Journal of Heuristics
Hi-index | 0.00 |
Local search is one of the fundamental approaches to tackle large combinatorial optimization problems. Yet relatively little support is available to facilitate the design and implementation of local search algorithms. This paper introduces Localizer++, an extensible object-oriented library for local search. Localizer++ supports both declarative abstractions to describe the neighborhood and high-level search constructs to specify local moves and meta-heuristics. It also supports a variety of features typically found only in modeling languages and its extensibility allows for an easy integration of new, user-defined, abstractions. Of particular interest is the conciseness and readability of Localizer++ statements and the efficiency of the Localizer++ implementation.