Eric Monfroy
ABSTRACT
During the last decades, significant improvements have been achieved for solving complex combinatorial optimization problems issued from real world applications. To tackle large scale instances and intricate problem structures, sophisticated solving techniques have been developed, combined, and hybridized to provide efficient solvers. Combinatorial problems are often modeled as Constraint Satisfaction Problems or constraint optimization problems, which consist of a set of variables, a set of possible values for these variables and a set of constraints to be satisfied. However, solvers or hybridization of solvers become more and more complex: the user must select various solving and hybridization strategies and tune numerous parameters. Moreover, it is well-known that an a priori decision concerning strategies and parameters is very difficult since strategies and parameters effects are rather unpredictable and may change during solving.
- K. R. Apt. Principles of Constraint Programming. Cambridge Univ. Press, 2003. Google Scholar
Digital Library
- M. Berkelaar. lpsolve---simplex-based code for linear and integer programming.Google Scholar
- C. Castro, E. Monfroy, C. Figueroa, and R. Meneses. An approach for dynamic split strategies in constraint solving. In Proc. of MICAI 2005, volume 3789 of LNAI, pages 162--174. Springer, 2005. Google ScholarDigital Library
- Y. Hamadi, E. Monfroy, and F. Saubion, editors. Autonomous Search. Springer, 2010. To appear. Google ScholarDigital Library
- Y. Hamadi, E. Monfroy, and F. Saubion. What is autonomous search? In The Ten years of CP-AI-OR. Springer, 2010. To appear.Google Scholar
- R. Rodosek, M. Wallace, and M. Hajian. A new approach to integrating mixed integer programming and clp. Baltzer JOURNAL, 1998.Google Scholar
- C. Schulte, G. Tack, and M. Lagerkvist. Gecode: Generic constraint development environment. INFORMS Annual Meeting, 2006.Google Scholar
Recommendations
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search
An effective hybridisation of adaptive VNS with LNS is proposed.Intelligent selection mechanism is integrated in the local search of the AVNS.Introduction of effective data structure and a neighbourhood reduction scheme.A novel implementation of LNS ...
Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
The quadratic multiple knapsack problem (QMKP) concerns assigning a set of objects, which interact among themselves through paired profit values, to a set of capacity-constrained knapsacks such that the overall profit of the objects included in the ...
Intelligent search strategies based on adaptive Constraint Handling Rules
The most advanced implementation of adaptive constraint processing with Constraint Handling Rules (CHR) allows the application of intelligent search strategies to solve Constraint Satisfaction Problems (CSP). This presentation compares an improved ...
Comments