Localizer++: an open library for local search. 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-de ned, abstractions. Of particular interest is the conciseness and readability of Localizer++ statements and the eciency of the Localizer++ implementation.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Humeau, J.; Liefooghe, A.; Talbi, E.-G.; Verel, S.: ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms (2013)
- Katriel, Irit; Michel, Laurent; Van Hentenryck, Pascal: Maintaining longest paths incrementally (2005)
- Michel, Laurent; Van Hentenryck, Pascal: A modeling layer for constraint-programming libraries (2005)
- Michel, Laurent; Van Hentenryck, Pascal: Maintaining longest paths incrementally (2003)