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

IEEE International Conference on Industrial Engineering and Engineering Management

Volumn , Issue , 2012, Pages 176-181

  Hosseini, S M ^a   Khaled, A A ^a   Jin, M ^b  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

^b University of Tennessee Knoxville   (United States)

Author keywords

EMST; ICA; Spanning tree

Indexed keywords

GEOMETRY; HEURISTIC METHODS; INDEPENDENT COMPONENT ANALYSIS; INDUSTRIAL ENGINEERING; OPTIMIZATION; PARALLEL ARCHITECTURES;

EMST; EUCLIDEAN MINIMUM SPANNING TREES; IMPERIALIST COMPETITIVE ALGORITHM (ICA); META-HEURISTIC APPROACH; MINIMAL SPANNING TREE; MINIMUM SPANNING TREE PROBLEM; SPANNING TREE; TRANSPORTATION NETWORK;

HEURISTIC ALGORITHMS;

EID: 84903829620     PISSN: 21573611     EISSN: 2157362X     Source Type: Conference Proceeding    
DOI: 10.1109/IEEM.2012.6837725     Document Type: Conference Paper

References (12)

1. J. Nesetril, "Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history, " Discrete Math. , vol. 233, pp. 3-36, 2001.
2. C. F. Bazlamacci and K. S. Hindi, "Minimum-weight spanning tree algorithms: A survey and empirical study, " Computers Oper Res, vol. 28, no. 8, pp. 767-785, 2001.
3. F. Neumann and C. Witt, "Ant colony optimization and the minimum spanning tree problem, " Theoretical Comput Sci, vol. 411, no. 25, pp. 2406-2413, 2010.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, Cambridge, MA: MIT Press, 2009, pp. 631-642.
5. J. Bentley and J. Friedman, "Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces, " IEEE Trans. Comput. , vol. 27, pp. 97-105, 1978.
6. A. Yao, "On constructing minimum spanning trees in kdimensional spaces and related problems, " SIAM J. Comput. , vol. 11, no. 4, pp. 721-736, 1982.
7. P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf and E. Welzl, "Euclidean minimum spanning trees and bichromatic closest pairs, " Discrete Comput. Geom. , vol. 6, pp. 407-422, 1991.
8. W. B. March, P. Ram and A. G. Gray, "Fast Euclidean minimum spanning tree: algorithm, analysis, and applications, " in Proc. 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, New York, NY, pp. 603-612, 2010.
9. E. A-Gargari and C. Lucas, "Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition, " in IEEE Congress on Evolutionary Computation, CEC'07, Singapore, pp. 4661-4667, 2007.
10. J. Behnamian and M. Zandieh, "A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties, " Expert Syst. Appl. , vol. 38, no. 12, pp. 14490-14498, 2011.
11. L. K. Shahvandi, M. Teshnehlab and A. Haroonabadi, "Multi-level clustering by imperialist competitive algorithm in wireless sensor networks, " International J. Adv. Eng. Sci. Technol. , vol. 9, no. 2, pp. 327-332, 2011.
12. S. Moadi, A. S. Mohaymany and M. Babaei, "Application of imperialist competitive algorithm to the emergency medical services location problem, " International J. Artif. Intell. Appl. , vol. 2, no. 4, 2011.