Show simple item record

dc.contributor.authorTurky, A
dc.contributor.authorSabar, NR
dc.contributor.authorSattar, A
dc.contributor.authorSong, A
dc.date.accessioned2018-02-12T12:30:29Z
dc.date.available2018-02-12T12:30:29Z
dc.date.issued2016
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-319-50127-7_13
dc.identifier.urihttp://hdl.handle.net/10072/340425
dc.description.abstractGoogle 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.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofpagefrom163
dc.relation.ispartofpageto174
dc.relation.ispartofjournalLecture Notes in Computer Science
dc.relation.ispartofvolume9992
dc.subject.fieldofresearchOther information and computing sciences not elsewhere classified
dc.subject.fieldofresearchcode469999
dc.titleParallel late acceptance hill-climbing algorithm for the google machine reassignment problem
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.hasfulltextNo Full Text
gro.griffith.authorSattar, Abdul


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record