Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem

DOI10.1080/0952813021000032699zbMath1036.68084OpenAlexW1963802054MaRDI QIDQ4407244

Mohamed Haouari, Peng-Yeng Yin, Bertrand M. T. Lin, Shyong Jian Shyu

Publication date: 25 August 2003

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0952813021000032699

zbMATH Keywords

genetic algorithmmeta-heuristic

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ The prize-collecting generalized minimum spanning tree problem ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ An Introduction to Learning Automata and Optimization ⋮ Ant colony optimization for the cell assignment problem in PCS networks ⋮ Upper and lower bounding strategies for the generalized minimum spanning tree problem

This page was built for publication: Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem