Solving the n-queens problem using a tuned hybrid imperialist competitive algorithm
المؤلفون المشاركون
Masehian, Ellips
Akbaripour, Husayn
Mohabbati-Kalejahi, Nisrin
المصدر
The International Arab Journal of Information Technology
العدد
المجلد 11، العدد 6 (30 نوفمبر/تشرين الثاني 2014)10ص.
الناشر
تاريخ النشر
2014-11-30
دولة النشر
الأردن
عدد الصفحات
10
التخصصات الرئيسية
تكنولوجيا المعلومات وعلم الحاسوب
الموضوعات
الملخص EN
The n-queens problem is a classical combinatorial optimization problem 'which has been proved to be NP-hard.
The goal is to place n non-attacking queens on an n*n chessboard.
In this paper, the Imperialist Competitive Algorithm (ICA), which is a recent evolutionary metaheuristic method, has been applied for solving the n-queens problem.
As another variation, the ICA was combined with a local search method, resulting the Hybrid ICA (HICA).
Since the parameters of heuristic and metaheuristic algorithms have a great influence on the performance of the search, parameter tuning is used for handling the problems in an efficient manner.
Hence, a TOPSIS-based parameters tuning is proposed, which not only considers the number of fitness function evaluations, but also aims to minimize the running time of the presented heuristics.
In order to investigate the performance of the suggested approach, a computational analysis on the n-queens problem was performed.
Extensive ex¬perimental results showed that the proposed HICA outperformed the basic ICA in terms of average runtimes and average number of fitness function evaluations.
The developed algorithms were also compared to the Cooperative PSO (CPSO) algo¬rithm, which is currently the best algorithm in the literature for finding the first valid solution to the n-queens problem, and the results showed that the HICA dominates the CPSO by evaluating the fitness function fewer times.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
Masehian, Ellips& Akbaripour, Husayn& Mohabbati-Kalejahi, Nisrin. 2014. Solving the n-queens problem using a tuned hybrid imperialist competitive algorithm. The International Arab Journal of Information Technology،Vol. 11, no. 6.
https://search.emarefa.net/detail/BIM-380132
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
Masehian, Ellips…[et al.]. Solving the n-queens problem using a tuned hybrid imperialist competitive algorithm. The International Arab Journal of Information Technology Vol. 11, no. 6 (Nov. 2014).
https://search.emarefa.net/detail/BIM-380132
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
Masehian, Ellips& Akbaripour, Husayn& Mohabbati-Kalejahi, Nisrin. Solving the n-queens problem using a tuned hybrid imperialist competitive algorithm. The International Arab Journal of Information Technology. 2014. Vol. 11, no. 6.
https://search.emarefa.net/detail/BIM-380132
نوع البيانات
مقالات
لغة النص
الإنجليزية
الملاحظات
Includes bibliographical references.
رقم السجل
BIM-380132
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر