A Simple and Efficient Local Search Algorithm for the Machine Reassignment Problem
Considering a computational service as a set of processes, several issues can impact its performance, such as failures and shutdowns. Many strategies can be used to reduce this impact as the assignment of one service in several machines or the distribution of machines in different locations by respe...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-07-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/15/13/7474 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850118907896004608 |
|---|---|
| author | Darío Canales María-Cristina Riff Elizabeth Montero |
| author_facet | Darío Canales María-Cristina Riff Elizabeth Montero |
| author_sort | Darío Canales |
| collection | DOAJ |
| description | Considering a computational service as a set of processes, several issues can impact its performance, such as failures and shutdowns. Many strategies can be used to reduce this impact as the assignment of one service in several machines or the distribution of machines in different locations by respecting some constraints such as process dependency and capacity. The Machine Reassignment Problem is a hard problem that consists of a set of machines with associated resources and processes already assigned to these machines. The goal is to obtain a redistribution of the processes according to some optimization criteria, satisfying a set of constraints. In this work, we propose an efficient collaborative local search algorithm to solve the Machine Reassignment Problem. We pay special attention to designing an easily understandable algorithm that requires less computational resources than other more sophisticated well-known approaches in the literature. We show that our approach is effective using the ROADEF competition instances as a benchmark and that can obtain high-quality solutions. |
| format | Article |
| id | doaj-art-46717a6f9d044ff0b40a63456cb4711b |
| institution | OA Journals |
| issn | 2076-3417 |
| language | English |
| publishDate | 2025-07-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj-art-46717a6f9d044ff0b40a63456cb4711b2025-08-20T02:35:46ZengMDPI AGApplied Sciences2076-34172025-07-011513747410.3390/app15137474A Simple and Efficient Local Search Algorithm for the Machine Reassignment ProblemDarío Canales0María-Cristina Riff1Elizabeth Montero2Departament of Computer Science, Universidad Técnica Federico Santa María, Valparaíso 2390151, ChileDepartament of Computer Science, Universidad Técnica Federico Santa María, Valparaíso 2390151, ChileDepartament of Computer Science, Universidad Técnica Federico Santa María, Valparaíso 2390151, ChileConsidering a computational service as a set of processes, several issues can impact its performance, such as failures and shutdowns. Many strategies can be used to reduce this impact as the assignment of one service in several machines or the distribution of machines in different locations by respecting some constraints such as process dependency and capacity. The Machine Reassignment Problem is a hard problem that consists of a set of machines with associated resources and processes already assigned to these machines. The goal is to obtain a redistribution of the processes according to some optimization criteria, satisfying a set of constraints. In this work, we propose an efficient collaborative local search algorithm to solve the Machine Reassignment Problem. We pay special attention to designing an easily understandable algorithm that requires less computational resources than other more sophisticated well-known approaches in the literature. We show that our approach is effective using the ROADEF competition instances as a benchmark and that can obtain high-quality solutions.https://www.mdpi.com/2076-3417/15/13/7474machine reassignment problemlocal searchadaptive metaheuristics |
| spellingShingle | Darío Canales María-Cristina Riff Elizabeth Montero A Simple and Efficient Local Search Algorithm for the Machine Reassignment Problem Applied Sciences machine reassignment problem local search adaptive metaheuristics |
| title | A Simple and Efficient Local Search Algorithm for the Machine Reassignment Problem |
| title_full | A Simple and Efficient Local Search Algorithm for the Machine Reassignment Problem |
| title_fullStr | A Simple and Efficient Local Search Algorithm for the Machine Reassignment Problem |
| title_full_unstemmed | A Simple and Efficient Local Search Algorithm for the Machine Reassignment Problem |
| title_short | A Simple and Efficient Local Search Algorithm for the Machine Reassignment Problem |
| title_sort | simple and efficient local search algorithm for the machine reassignment problem |
| topic | machine reassignment problem local search adaptive metaheuristics |
| url | https://www.mdpi.com/2076-3417/15/13/7474 |
| work_keys_str_mv | AT dariocanales asimpleandefficientlocalsearchalgorithmforthemachinereassignmentproblem AT mariacristinariff asimpleandefficientlocalsearchalgorithmforthemachinereassignmentproblem AT elizabethmontero asimpleandefficientlocalsearchalgorithmforthemachinereassignmentproblem AT dariocanales simpleandefficientlocalsearchalgorithmforthemachinereassignmentproblem AT mariacristinariff simpleandefficientlocalsearchalgorithmforthemachinereassignmentproblem AT elizabethmontero simpleandefficientlocalsearchalgorithmforthemachinereassignmentproblem |