A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
سال انتشار: 1397
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 484
فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
این مقاله در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JACET-4-2_003
تاریخ نمایه سازی: 18 تیر 1398
چکیده مقاله:
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve the n-Queen problem. Parallelizing island genetic algorithm and Cellular genetic algorithm was implemented and run. The results show that these algorithms have the ability to find related solutions to this problem. The algorithms are not only faster but also they lead to better performance even without the use of parallel hardware and just running on one core processor. Good comparisons were made between the proposed method and serial genetic algorithms in order to measure the performance of the proposed method. The experimental results show that the algorithm has high efficiency for large-size problems in comparison with genetic algorithms, and in some cases it can achieve super linear speedup. The proposed method in the present study can be easily developed to solve other optimization problems.
کلیدواژه ها:
نویسندگان
Monire Taheri Sarvetamin
Department of Computer engineering, Islamic Azad University of Kerman, Kerman, Iran
Amid Khatibi
Computer engineering department, Bardsir branch, Islamic Azad University, Bardsir, IRAN
Mohammad Hadi Zahedi
Faculty of Electrical and Computer Engineering, Khaje Nasir Toosi University of Technology, Tehran, Iran