Abstract
We present a local search method combined with noising strategy to efficiently solve the Google Machine Reassignment problem (GMRP), proposed at the ROADEF/EURO Challenge 2012 competition. The GMRP is a challenging and novel optimization problem, aimed at maximizing the usage of a set of machines by reallocating processes among those machines in a cost-efficient manner, while respecting a set of technological constraints. The search explores three different neighborhoods. Intensification and diversification of the search is achieved through the noising strategy, sorting the processes and search restarts. The noising is done by simple and suitable change of the objective function. The method is tested on 30 instances proposed by Google and used challenge evaluation. Most of the numerical results obtained here are proven to be optimal, near optimal, or the best known. The presented method was ranked first at ROADEF/EURO Challenge 2012 competition.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
