![](/images/graphics-bg.png)
Adaptive Black Hole Algorithm for Solving the Set Covering Problem
المؤلفون المشاركون
Soto, Ricardo
Paredes, Fernando
Castro, Carlos
Olivares, Rodrigo
Taramasco, Carla
Figueroa, Ignacio
Gómez, Álvaro
Crawford, Broderick
المصدر
Mathematical Problems in Engineering
العدد
المجلد 2018، العدد 2018 (31 ديسمبر/كانون الأول 2018)، ص ص. 1-23، 23ص.
الناشر
Hindawi Publishing Corporation
تاريخ النشر
2018-10-16
دولة النشر
مصر
عدد الصفحات
23
التخصصات الرئيسية
الملخص EN
Evolutionary algorithms have been used to solve several optimization problems, showing an efficient performance.
Nevertheless, when these algorithms are applied they present the difficulty to decide on the appropriate values of their parameters.
Typically, parameters are specified before the algorithm is run and include population size, selection rate, and operator probabilities.
This process is known as offline control and is even considered as an optimization problem in itself.
On the other hand, parameter settings or control online is a variation of the algorithm original version.
The main idea is to vary the parameters so that the algorithm of interest can provide the best convergence rate and thus may achieve the best performance.
In this paper, we propose an adaptive black hole algorithm able to dynamically adapt its population according to solving performance.
For that, we use autonomous search which appeared as a new technique that enables the problem solver to control and adapt its own parameters and heuristics during solving in order to be more efficient without the knowledge of an expert user.
In order to test this approach, we resolve the set covering problem which is a classical optimization benchmark with many industrial applications such as line balancing production, crew scheduling, service installation, and databases, among several others.
We illustrate encouraging experimental results, where the proposed approach is able to reach various global optimums for a well-known instance set from Beasley’s OR-Library, while improving various modern metaheuristics.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
Soto, Ricardo& Crawford, Broderick& Olivares, Rodrigo& Taramasco, Carla& Figueroa, Ignacio& Gómez, Álvaro…[et al.]. 2018. Adaptive Black Hole Algorithm for Solving the Set Covering Problem. Mathematical Problems in Engineering،Vol. 2018, no. 2018, pp.1-23.
https://search.emarefa.net/detail/BIM-1206121
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
Soto, Ricardo…[et al.]. Adaptive Black Hole Algorithm for Solving the Set Covering Problem. Mathematical Problems in Engineering No. 2018 (2018), pp.1-23.
https://search.emarefa.net/detail/BIM-1206121
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
Soto, Ricardo& Crawford, Broderick& Olivares, Rodrigo& Taramasco, Carla& Figueroa, Ignacio& Gómez, Álvaro…[et al.]. Adaptive Black Hole Algorithm for Solving the Set Covering Problem. Mathematical Problems in Engineering. 2018. Vol. 2018, no. 2018, pp.1-23.
https://search.emarefa.net/detail/BIM-1206121
نوع البيانات
مقالات
لغة النص
الإنجليزية
الملاحظات
Includes bibliographical references
رقم السجل
BIM-1206121
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
![](/images/ebook-kashef.png)
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر
![](/images/kashef-image.png)