کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4943029 1437614 2018 21 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Enhancing set constraint solvers with bound consistency
ترجمه فارسی عنوان
تقویت حل کننده های محدود کننده با قوام محدود
کلمات کلیدی
محدودیت برنامه ریزی، برنامه ریزی، حل کننده های عدد صحیح، محدودیت دامنه محدود
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی
Constraint solvers have proved to be a powerful tool for both expressing and solving complex problems in many contexts, in particular in Automated Planning and Scheduling. In this work, we propose new constraints to enhancing an implementation of a constraint solver for sets of integers (ic_sets) embedded in the ECLiPSe system. This way, we confer a new vision of modelling that in particular allows a task to be planned on alternate days. In addition, these new constraints make finite domain and finite sets domains to cooperate, reducing the search space and improving the efficiency of the existing set solvers for some specific cases. We report on a prototype implementation and apply these constraints to modelling scheduling problems as benchmarks for a performance analysis. Experiments reveal a relevant improvement with respect to the standard ic_sets solver which only features cardinality as cooperation mechanism between domains. Both enhanced expressiveness and performance are key points for practical applications of such solvers.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 92, February 2018, Pages 485-494
نویسندگان
, , ,