IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v74y2019i1d10.1007_s10898-019-00738-5.html
   My bibliography  Save this article

Enhancing interval constraint propagation by identifying and filtering n-ary subsystems

Author

Listed:
  • Ignacio Araya

    (Pontificia Universidad Católica de Valparaíso)

  • Victor Reyes

    (Pontificia Universidad Católica de Valparaíso)

Abstract

When interval branch and bound solvers are used for solving numerical constraint satisfaction problems, constraint propagation algorithms are commonly used for filtering/contracting the variable domains. However, these algorithms suffer from the locality problem which is related to the reduced scope of local consistencies. In this work we propose a preprocessing and a filtering technique to reduce the locality problem and to enhance the contraction power of constraint propagation algorithms. The preprocessing consists in constructing a directed acyclic graph (DAG) by merging equivalent nodes (or common subexpressions) and identifying subsystems of n-ary sums in the DAG. The filtering technique consists in applying iteratively HC4 and an ad-hoc technique for contracting the subsystems until reaching a fixed point. Experiments show that the new approach outperforms state-of-the-art strategies using a well known set of benchmark instances.

Suggested Citation

  • Ignacio Araya & Victor Reyes, 2019. "Enhancing interval constraint propagation by identifying and filtering n-ary subsystems," Journal of Global Optimization, Springer, vol. 74(1), pages 1-20, May.
    • Handle: RePEc:spr:jglopt:v:74:y:2019:i:1:d:10.1007_s10898-019-00738-5
    DOI: 10.1007/s10898-019-00738-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00738-5
    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/s10898-019-00738-5?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.

    References listed on IDEAS

    as
    1. Ignacio Araya & Victor Reyes, 2016. "Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects," Journal of Global Optimization, Springer, vol. 65(4), pages 837-866, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. N. Kazazakis & C. S. Adjiman, 2018. "Arbitrarily tight $$\alpha $$ α BB underestimators of general non-linear functions over sub-optimal domains," Journal of Global Optimization, Springer, vol. 71(4), pages 815-844, August.
    2. Victor Reyes & Ignacio Araya, 2023. "Non-Convex Optimization: Using Preconditioning Matrices for Optimally Improving Variable Bounds in Linear Relaxations," Mathematics, MDPI, vol. 11(16), pages 1-19, August.
    3. Victor Reyes & Ignacio Araya, 2021. "AbsTaylor: upper bounding with inner regions in nonlinear continuous global optimization problems," Journal of Global Optimization, Springer, vol. 79(2), pages 413-429, February.
    4. Li, Yan & Zhang, Peng & Yue, Meng, 2018. "Networked microgrid stability through distributed formal analysis," Applied Energy, Elsevier, vol. 228(C), pages 279-288.

    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:jglopt:v:74:y:2019:i:1:d:10.1007_s10898-019-00738-5. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.