A Local Search Algorithm for SMTI and its extension to HRT Problems

• Autor(es): Munera, Danny ; Diaz, Daniel ; Abreu, Salvador ; Rossi, Francesca ; Saraswat, Vijay ; Codognet, Philippe
• Data: 2016
• Identificador Persistente: http://hdl.handle.net/10174/17129
• Origem: Repositório Científico da Universidade de Évora
• Tipo de Documento: Artigo científico
• Idioma: Português

Descrição

Hospitals/Residents with Ties (HRT) forms a class of problems with many applications, some of which are of considerable size. Solving these problems has been shown to be NP-hard. In previous work, we developed a local search algorithm which displays very high performance in solving Stable Matching with Ties and Incomplete lists (SMTI) problems. In this paper, we propose a method to tackle HRT problems with a slightly modified version of our SMTI solver. We describe our method and provide an initial performance assessment, which turns out to show that the resulting solver can deal with significant HRT problems, providing optimal solutions in most cases, in a very short time.