Hybrid Approaches based on Simulated Annealing, Tabu Search and Ant Colony Optimization for Solving the k-Minimum Spanning Tree Problem
DOI: 10.14569/IJACSA.2021.0120288
Abstract
Keywords
How to Cite this Article
Addou, E. H., Serghini, A., & Mermri, E. B. (2021). Hybrid Approaches based on Simulated Annealing, Tabu Search and Ant Colony Optimization for Solving the k-Minimum Spanning Tree Problem. International Journal of Advanced Computer Science and Applications, 12(2). https://doi.org/10.14569/IJACSA.2021.0120288
Addou, El Houcine, et al.. "Hybrid Approaches based on Simulated Annealing, Tabu Search and Ant Colony Optimization for Solving the k-Minimum Spanning Tree Problem." International Journal of Advanced Computer Science and Applications, vol. 12, no. 2, 2021, https://doi.org/10.14569/IJACSA.2021.0120288.
@article{Addou2021,
title = {Hybrid Approaches based on Simulated Annealing, Tabu Search and Ant Colony Optimization for Solving the k-Minimum Spanning Tree Problem},
journal = {International Journal of Advanced Computer Science and Applications},
volume = {12},
number = {2},
year = {2021},
publisher = {The Science and Information Organization},
author = {El Houcine Addou and Abelhafid Serghini and El Bekkaye Mermri},
doi = {10.14569/IJACSA.2021.0120288},
url = {https://doi.org/10.14569/IJACSA.2021.0120288}
}Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.
