In this work we propose a Choice Function for guiding Constraint Programming in the resolution of Constraint Satisfaction Problems. We exploit some search process features to select on the fly the Enumeration Strategy (Variable + Value Selection Heuristics) in order to more efficiently solve the problem at hand. The main novelty of our approach is that we reconfigure the search based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Hyperheuristic Approach for Constraint Solving


    Contributors:
    Crawford, B (author) / Castro, C (author) / Monfroy, E (author)


    Publication date :

    2010-09-01


    Size :

    246265 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Hyperheuristic Approach Based on Reinforcement Learning for Air Traffic Complexity Mitigation

    Juntama, Paveen / Delahaye, Daniel / Chaimatanan, Supatcha et al. | AIAA | 2022


    A General Approach for Constraint Solving by Local Search

    Galinier, P. / Hao, J. K. | British Library Online Contents | 2004


    Geometric Sketch Constraint Solving with User Feedback

    Dxon, B. / Dannenhoffer, J. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2013


    Geometric Sketch Constraint Solving with User Feedback

    Dixon, Bridget M. / Dannenhoffer, John F. | AIAA | 2014


    Solving Transient Scheduling Problems with Constraint Programming

    Korbaa, O. / Yim, P. / Gentina, J.-C. | British Library Online Contents | 2000