Hybrid Approaches based on Simulated Annealing, Tabu Search and Ant Colony Optimization for Solving the k-Minimum Spanning Tree Problem

In graph theory, the k-minimum spanning tree problem is considered to be one of the well-known NP hard problems to solve. This paper address this problem by proposing several hybrid approximate approaches based on the combination of simulated annealing, tabu search and ant colony optimization algori...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of advanced computer science & applications Jg. 12; H. 2
Hauptverfasser:	Addou, El Houcine, Serghini, Abelhafid, Bekkaye, El
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	West Yorkshire Science and Information (SAI) Organization Limited 2021
Schlagworte:	Algorithms Ant colony optimization Computer science Experiments Graph theory Methods Neighborhoods Optimization algorithms Simulated annealing Tabu search Trees
ISSN:	2158-107X, 2156-5570
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!