n a recent paper, a solution approach to the Maximum Happy Vertices Problem has been proposed. The approach is based on a constructive heuristic improved by a matheuristic local search phase. We propose a new procedure able to outperform the previous solution algorithm both in terms of solution quality and computational time. Our approach is based on simple ingredients implying as starting solution gen- erator an approximation algorithm and as an improving phase a new matheuristic local search. The procedure is then extended to a multi-start configuration, able to further improve the solution quality at the cost of an acceptable increase in compu- tational time.
A simple and effective algorithm for the maximum happy vertices problem / Ghirardi, Marco; Salassa, Fabio. - In: TOP. - ISSN 1134-5764. - ELETTRONICO. - (2021). [10.1007/s11750-021-00610-4]
|Titolo:||A simple and effective algorithm for the maximum happy vertices problem|
|Data di pubblicazione:||2021|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/s11750-021-00610-4|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto:
|Ghirardi-Salassa2021_Article_ASimpleAndEffectiveAlgorithmFo.pdf||2a Post-print versione editoriale / Version of Record||Visibile a tuttiVisualizza/Apri|