Neighbourhood analysis: A case study on google machine reassignment problem

8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is known that neighbourhood structures affect search performance. In this study we analyse a series of neighbourhood structures to facilitate the search. The well known steepest descent (SD) local search algorithm is used in this study as it is parameter free. The search problem used is the Google Machine Reassignment Problem (GMRP). GMRP is a recent real world problem proposed at ROADEF/EURO challenge 2012 competition. It consists in reassigning a set of services into a set of machines for which the aim is to improve the machine usage while satisfying numerous constraints. In this paper, the effectiveness of three neighbourhood structures and their combinations are evaluated on GMRP instances, which are very diverse in terms of number of processes, resources and machines. The results show that neighbourhood structure does have impact on search performance. A combined neighbourhood structures with SD can achieve results better than SD with single neighbourhood structure.

Cite

CITATION STYLE

APA

Turky, A., Sabar, N. R., & Song, A. (2017). Neighbourhood analysis: A case study on google machine reassignment problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10142 LNAI, pp. 228–237). Springer Verlag. https://doi.org/10.1007/978-3-319-51691-2_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free