𝔖 Bobbio Scriptorium

✦ LIBER ✦

A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems

✍ Scribed by Hideki Katagiri; Tomohiro Hayashida; Ichiro Nishizaki; Qingqiang Guo

Book ID: 113607344
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 536 KB
Volume: 39
Category: Article
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2011.11.103

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A novel hybrid algorithm based on partic

A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum

✍ Mustafa Servet Kıran; Mesut Gündüz; Ömer Kaan Baykan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 212 KB

[IEEE 1999. Congress on Evolutionary Com

[IEEE 1999. Congress on Evolutionary Computation-CEC99 - Washington, DC, USA (6-9 July 1999)] Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) - A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem

✍ Merz, P.; Freisleben, B. 📂 Article 📅 1999 🏛 IEEE ⚖ 792 KB