KIDS: A Semiautomatic Program Development System
IEEE Transactions on Software Engineering
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
A tabu search heuristic for the vehicle routing problem
Management Science
Automated support for software development with frameworks
SSR '95 Proceedings of the 1995 Symposium on Software reusability
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Computers and Operations Research
LOCAL ++: A C++ framework for local search algorithms
Software—Practice & Experience
Software—Practice & Experience - Special issue on discrete algorithm engineering
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Localizer++: An Open Library for local Search
Localizer++: An Open Library for local Search
Localizer: a modeling language for local search
Localizer: a modeling language for local search
Local search techniques for large high school timetabling problems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Grid computing for parallel bioinspired algorithms
Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
Combining relational algebra, SQL, constraint modelling, and local search
Theory and Practice of Logic Programming
Hybrid Local Search for Constrained Financial Portfolio Selection Problems
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Multi-neighborhood Local Search for the Patient Admission Problem
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
On the interactive resolution of multi-objective vehicle routing problems
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
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
Hybrid local search techniques for the resource-constrained project scheduling problem
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
A hybrid LS-CP solver for the shifts and breaks design problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Local search and lower bounds for the patient admission scheduling problem
Computers and Operations Research
OptLets: a generic framework for solving arbitrary optimization problems
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
Opt4J: a modular framework for meta-heuristic optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Kangaroo: an efficient constraint-based local search system using lazy propagation
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Computers and Operations Research
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
The balanced academic curriculum problem revisited
Journal of Heuristics
Local search for constrained financial portfolio selection problems with short sellings
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
HYPERION: a recursive hyper-heuristic framework
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Semantic components for timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Constraint propagation as the core of local search
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
Modeling and solving the dynamic patient admission scheduling problem under uncertainty
Artificial Intelligence in Medicine
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
Journal of Heuristics
Local search techniques for a routing-packing problem
Computers and Industrial Engineering
Hi-index | 0.00 |
Local search is a paradigm for search and optimization problems, which has recently evidenced to be very effective for a large number of combinatorial problems. Despite the increasing interest of the research community in this subject, there is still a lack of a widely-accepted software tools for local search.We propose EASYLOCAL++, an object-oriented framework for the design and the analysis of local-search algorithms. The abstract classes that compose the framework specify and implement the invariant part of the algorithm and are meant to be specialized by concrete classes that supply the problem-dependent part. The framework provides the full control structures of the algorithms, and the user has only to write the problem-specific code. Furthermore, the framework comes with some tools that simplify the analysis of the algorithms.The architecture of EASYLOCAL++ provides a principled modularization for the solution of combinatorial problems by local search and helps the user by deriving a neat conceptual scheme of the application. It also supports the design of combinations of basic techniques and/or neighborhood structures.The framework has been tested in some applicative domains and has proved to be flexible enough in the implementation of algorithms for the solution of various scheduling problems.