Solving Euclidean minimal spanning tree problem using a new meta-heuristic approach: Imperialist Competitive algorithm (ICA)

The minimum spanning tree (MST) problem has numerous applications in design of communication, computer and transportation networks. This paper proposes an application of a new meta-heuristic called Imperialist Competitive algorithm (ICA) for solving a special case of MST defined on a Euclidean plane...

Full description

Saved in:
Bibliographic Details
Published in2012 IEEE International Conference on Industrial Engineering and Engineering Management pp. 176 - 181
Main Authors Hosseini, S. M., Khaled, A. A., Jin, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2012
Subjects
Convergence
Cost function
Educational institutions
EMST
ICA
Sociology
Spanning tree
Statistics
Systems engineering and theory
Vectors
Online AccessGet full text
ISSN2157-3611
DOI10.1109/IEEM.2012.6837725

Cover

More Information
Summary:The minimum spanning tree (MST) problem has numerous applications in design of communication, computer and transportation networks. This paper proposes an application of a new meta-heuristic called Imperialist Competitive algorithm (ICA) for solving a special case of MST defined on a Euclidean plane, called the Euclidean minimum spanning tree (EMST) problem. ICA is inspired by human's socio-political evolution. The solution quality and speed of the proposed are verified by numerical examples compared to a commercial optimization solver.
ISSN:2157-3611
DOI:10.1109/IEEM.2012.6837725