کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
497147 | 862877 | 2008 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An Iterative local-search framework for solving constraint satisfaction problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
In this article, we introduce a new solving framework based on using alternatively two local-search algorithms to solve constraint satisfaction and optimization problems. The technique presented is based on the integration of local-search algorithm as a mechanism to diversify the search instead of using a build on diversification mechanisms. Thus, we avoid tuning the multiple parameters to escape from a local optimum. This technique improves the existing methods: it is generic especially when the given problem can be expressed as a constraint satisfaction problem. We present the way the local-search algorithm can be used to diversify the search in order to solve real examination timetabling problems. We describe how the local-search algorithm can be used to assist any other specific local-search algorithm to escape from local optimality. We showed that such framework is efficient on real benchmarks for timetabling problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 8, Issue 4, September 2008, Pages 1530-1535
Journal: Applied Soft Computing - Volume 8, Issue 4, September 2008, Pages 1530-1535
نویسندگان
Mohamed Tounsi, Samir Ouis,