Parallel Late Acceptance Hill-Climbing Algorithm for the Google Machine Reassignment Problem

详细信息    查看全文

• 关键词：Google Machine Reassignment Problem ; Optimisation ; Resource allocation ; Late Acceptance Hill ; Climbing ; Parallel search ; Evolutionary algorithms
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9992
• 期：1
• 页码：163-174
• 丛书名：AI 2016: Advances in Artificial Intelligence
• ISBN：978-3-319-50127-7
• 卷排序：9992

文摘

Google Machine Reassignment Problem (GMRP) is an optimisation problem proposed at ROADEF/EURO challenge 2012. The task of GMRP is to allocate cloud computing resources by reassigning a set of services to a set of machines while not violating any constraints. We propose an evolutionary parallel late acceptance hill-climbing algorithm (P-LAHC) for GMRP in this study. The aim is to improve the efficiency of search by escaping local optima. Our P-LAHC method involves multiple search processes. It utilises a population of solutions instead of a single solution. Each solution corresponds to one LAHC process. These processes work in parallel to improve the overall search outcome. These LAHC processes start with different initial individuals and follow distinct search paths. That reduces the chance of falling into a same local optima. In addition, mutation operators will apply when the search becomes stagnated for a certain period of time. This further reduces the chance of being trapped by a local optima. Our results on GMRP instances show that the proposed P-LAHC performed better than single threaded LAHC. Furthermore P-LAHC can outperform or at least be comparable to the state-of-the-art methods from the literature, indicating that P-LAHC is an effective search algorithm.