×

zbMATH — the first resource for mathematics

Adaptive constructive interval disjunction: algorithms and experiments. (English) Zbl 1329.90152
Summary: An operator called CID and an efficient variant 3BCID were proposed in [G. Trombettoni and G. Chabert, Lect. Notes Comput. Sci. 4741, 635–650 (2007; Zbl 1145.68530)]. For the numerical CSP handled by interval methods, these operators compute a partial consistency equivalent to Partition-1-AC for the discrete CSP. In addition to the constraint propagation procedure used to refute a given subproblem, the main two parameters of CID are the number of times the main CID procedure is called and the maximum number of sub-intervals treated by the procedure. The 3BCID operator is state-of-the-art in numerical CSP, but not in constrained global optimization, for which it is generally too costly. This paper proposes an adaptive variant of 3BCID called ACID. The number of variables handled is auto-adapted during the search, the other parameters are fixed and robust to modifications. On a representative sample of instances, ACID appears to work efficiently, both with the HC4 constraint propagation algorithm and with the state-of-the-art Mohc algorithm. Experiments also highlight that it is relevant to auto-adapt only a number of handled variables, instead of a specific set of selected variables. Finally, ACID appears to be the best interval constraint programming operator for solving and optimization, and has been therefore added to the default strategies of the Ibex interval solver.

MSC:
90C35 Programming involving graphs or networks
90-04 Software, source code, etc. for problems pertaining to operations research and mathematical programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Araya, I., Trombettoni, G., Neveu, B. (2010). Exploiting monotonicity in interval constraint propagation. In Proceeding of AAAI (pp. 9-14). · Zbl 1274.65184
[2] Araya, I., Trombettoni, G., Neveu, B. (2010). Making adaptive an interval constraint propagation algorithm exploiting monotonicity. In Proceedings of CP, Constraint Programming, LNCS 6308 (pp. 61-68). Springer. · Zbl 0978.70004
[3] Araya, I., Trombettoni, G., Neveu, B. (2012). A Contractor based on convex interval Taylor. In CPAIOR 2012, no. 7298 in LNCS (pp. 1-16). · Zbl 1191.68628
[4] Balafrej, A., Bessiere, C., Bouyakhf, E., Trombettoni, G. (2014). Adaptive singleton-based consistencies. In AAAI (pp. 2601-2607). AAAI Press.
[5] Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.F. (1999). Revising hull and box consistency. In Proceedings of ICLP (pp. 230-244). · Zbl 1047.37012
[6] Bennaceur, H., & Affane, M.S. (2001). Partition-k-AC: an efficient filtering technique combining domain partition and arc consistency. In Proceedings of CP (pp. 560-564). · Zbl 1067.68614
[7] Bessiere, C., & Debruyne, R. (2005). Optimal and suboptimal singleton arc consistency algorithms. In Proceedings of IJCAI (pp. 54-59).
[8] Chabert, G; Jaulin, L, Contractor programming, Artificial Intelligence, 173, 1079-1100, (2009) · Zbl 1191.68628
[9] Chabert, G., & Jaulin, L. (2009). Hull consistency under monotonicity. In Proceedings of CP, LNCS 5732 (pp. 188-195). · Zbl 1047.37012
[10] Debruyne, R., & Bessiere, C. (1997). Some practicable filtering techniques for the constraint satisfaction problem. In Proceedings of IJCAI (pp. 412-417).
[11] Hansen, E. (1992). Global optimization using interval analysis. Marcel Dekker Inc. · Zbl 0762.90069
[12] Kieffer, M; Jaulin, L; Walter, E; Meizel, D, Robust autonomous robot localization using interval analysis, Reliable Computing, 3, 337-361, (2000) · Zbl 0978.70004
[13] Lebbah, Y; Michel, C; Rueher, M; Daney, D; Merlet, J, Efficient and safe global constraints for handling numerical constraint systems, SIAM Journal on Numerical Analysis, 42, 2076-2097, (2005) · Zbl 1082.65051
[14] Lhomme, O. (1993). Consistency techniques for numeric CSPs. In IJCAI (pp. 232-238). · Zbl 1099.90047
[15] Mackworth, A, Consistency in networks of relations, Artificial Intelligence, 8, 99-118, (1977) · Zbl 0341.68061
[16] Merlet, J.P. (2007). Interval analysis and robotics. In Symposium of Robotics Research.
[17] Messine, F. (1997). Méthodes d’optimisation globale basées sur l’analyse d’intervalle pour la résolution des problèmes avec contraintes. Ph.D. thesis, LIMA-IRIT-ENSEEIHT-INPT, Toulouse.
[18] Messine, F, Extensions of affine arithmetic: application to global optimization, Journal of Universal Computer Science, 8, 992-1015, (2002) · Zbl 1274.65184
[19] Messine, F; Laganouelle, JL, Enclosure methods for multivariate differentiable functions and application to global optimization, Journal of Universal Computer Science, 4, 589-603, (1998) · Zbl 1063.90574
[20] Min Li, C. (1997). Anbulagan: Heuristics based on unit propagation for satisfiability problems. In Proceedings IJCAI (pp. 366-371).
[21] Tawarmalani, M; Sahinidis, NV, A polyhedral branch-and-cut approach to global optimization, Mathematical Programming, 103, 225-249, (2005) · Zbl 1099.90047
[22] Trombettoni, G., Araya, I., Neveu, B., Chabert, G. (2011). Inner regions and interval linearizations for global optimization. In AAAI (pp. 99-104). · Zbl 1274.65184
[23] Trombettoni, G., & Chabert, G. (2007). Constructive interval disjunction. In Proceedings of CP, LNCS 4741 (pp. 635-650). · Zbl 1145.68530
[24] Tucker, W, A rigorous ODE solver and smale’s 14th problem, Foundations of Computational Mathematics, 2, 53-117, (2002) · Zbl 1047.37012
[25] Van Hentenryck, P., Michel, L., Deville, Y. (1997). Numerica : a modeling language for global optimization: MIT Press.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.