IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v27y2021i6d10.1007_s10732-021-09475-z.html
   My bibliography  Save this article

Conflict history based heuristic for constraint satisfaction problem solving

Author

Listed:
  • Djamal Habet

    (Aix Marseille Univ, Université de Toulon, CNRS, LIS)

  • Cyril Terrioux

    (Aix Marseille Univ, Université de Toulon, CNRS, LIS)

Abstract

The variable ordering heuristic is an important module in algorithms dedicated to solve Constraint Satisfaction Problems (CSP), while it impacts the efficiency of exploring the search space and the size of the search tree. It also exploits, often implicitly, the structure of the instances. In this paper, we propose Conflict-History Search (CHS), a dynamic and adaptive variable ordering heuristic for CSP solving. It is based on the search failures and considers the temporality of these failures throughout the solving steps. The exponential recency weighted average is used to estimate the evolution of the hardness of constraints throughout the search. The experimental evaluation on XCSP3 instances shows that integrating CHS to solvers based on MAC (Maintaining Arc Consistency) and BTD (Backtracking with Tree Decomposition) achieves competitive results and improvements compared to the state-of-the-art heuristics. Beyond the decision problem, we show empirically that the solving of the constraint optimization problem (COP) can also take advantage of this heuristic.

Suggested Citation

  • Djamal Habet & Cyril Terrioux, 2021. "Conflict history based heuristic for constraint satisfaction problem solving," Journal of Heuristics, Springer, vol. 27(6), pages 951-990, December.
  • Handle: RePEc:spr:joheur:v:27:y:2021:i:6:d:10.1007_s10732-021-09475-z
    DOI: 10.1007/s10732-021-09475-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-021-09475-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10732-021-09475-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:27:y:2021:i:6:d:10.1007_s10732-021-09475-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.