In this paper, we introduce carousel greedy, an enhanced greedy algorithm which seeks to overcome the traditional weaknesses of greedy approaches. We have applied carousel greedy to a variety of well-known problems in combinatorial optimization such as the minimum label spanning tree problem, the minimum vertex cover problem, the maximum independent set problem, and the minimum weight vertex cover problem. In all cases, the results are very promising. Since carousel greedy is very fast, it can be used to solve very large problems. In addition, it can be combined with other approaches to create a powerful, new metaheuristic. Our goal in this paper is to motivate and explain the new approach and present extensive computational results.
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1016/j.cor.2017.03.016|
|Codice identificativo ISI:||WOS:000401878000009|
|Codice identificativo Scopus:||2-s2.0-85017441028|
|Titolo:||Carousel greedy: A generalized greedy algorithm with applications in optimization|
|Appare nelle tipologie:||1.1 Articolo in rivista|