Abstract : An operator called CID and an efficient variant 3BCID were proposed in 2007. For numerical CSPs handled by interval methods, these operators compute a partial consistency equivalent to Partition-1-AC for discrete CSPs. The two main 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 solving, but not in constrained global optimization. This paper proposes an adaptive variant of 3BCID. 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 be the best approach in solving and optimization, and has been added to the default strategies of the Ibex interval solver.
ICTAI: International Conference on Tools with Artificial Intelligence, Nov 2013, Washington, DC, United States. 25th International Conference on Tools with Artificial Intelligence, pp.900-906, 2013, 〈http://cecs.wright.edu/cart/ictai13/〉. 〈10.1109/ICTAI.2013.138〉
https://hal-enpc.archives-ouvertes.fr/hal-00936654
Contributeur : Bertrand Neveu
<>
Soumis le : lundi 27 janvier 2014 - 10:39:58
Dernière modification le : lundi 16 juillet 2018 - 15:42:03
Document(s) archivé(s) le : dimanche 27 avril 2014 - 22:31:21
Bertrand Neveu, Gilles Trombettoni. Adaptive Constructive Interval Disjunction. ICTAI: International Conference on Tools with Artificial Intelligence, Nov 2013, Washington, DC, United States. 25th International Conference on Tools with Artificial Intelligence, pp.900-906, 2013, 〈http://cecs.wright.edu/cart/ictai13/〉. 〈10.1109/ICTAI.2013.138〉. 〈hal-00936654〉
