Electronic Resource
How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem
العنوان: | How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem |
---|---|
المؤلفون: | Matoušek, Radomil, Dobrovský, Ladislav, Kůdela, Jakub |
بيانات النشر: | Growing Science 2021-12-31 |
نوع الوثيقة: | Electronic Resource |
مستخلص: | The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems and is known for its diverse applications. The QAP is an NP-hard optimization problem which attracts the use of heuristic or metaheuristic algorithms that can find quality solutions in an acceptable computation time. On the other hand, there is quite a broad spectrum of mathematical programming techniques that were developed for finding the lower bounds for the QAP. This paper presents a fusion of the two approaches whereby the solutions from the computations of the lower bounds are used as the starting points for a metaheuristic, called HC12, which is implemented on a GPU CUDA platform. We perform extensive computational experiments that demonstrate that the use of these lower bounding techniques for the construction of the starting points has a significant impact on the quality of the resulting solutions. |
مصطلحات الفهرس: | Heuristics, Lower bounds, Metaheuristics, Quadratic assignment problem, Starting values |
URL: | International Journal of Industrial Engineering Computations |
الاتاحة: | Open access content. Open access content http://creativecommons.org/licenses/by/4.0 openAccess http://www.sherpa.ac.uk/romeo/issn/1923-2934 Creative Commons Attribution 4.0 International |
ملاحظة: | 2 13 English |
Other Numbers: | CZBUT oai:https://dspace.vut.cz:11012/203280 International Journal of Industrial Engineering Computations. 2021, vol. 13, issue 2, p. 151-164. 1923-2934 175648 10.5267/j.ijiec.2021.12.003 1427092359 |
المصدر المساهم: | BRNO UNIV OF TECHNOL From OAIster®, provided by the OCLC Cooperative. |
رقم الانضمام: | edsoai.on1427092359 |
قاعدة البيانات: | OAIster |
الوصف غير متاح. |