Citation analysis and bibliometric approach for ant colony optimization from 1996 to 2010

被引：25

作者：

Deng, Guang-Feng ^{[1
]}

Lin, Woo-Tsong ^{[1
]}

机构：

[1] Natl Chengchi Univ, Dept Management Informat Syst, Taipei 116, Taiwan

来源：

EXPERT SYSTEMS WITH APPLICATIONS | 2012年 / 39卷 / 06期

关键词：

Citation analysis; Bibliometric analysis; Ant colony optimization (ACO); Bradford Law; Lotka's Law; QUADRATIC ASSIGNMENT PROBLEM; SYSTEM; ALGORITHMS;

D O I：

10.1016/j.eswa.2011.12.001

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

To build awareness of the development of ant colony optimization (ACO), this study clarifies the citation and bibliometric analysis of research publications of ACO during 1996-2010. This study analysed 12,960 citations from a total of 1372 articles dealing with ACO published in 517 journals based on the databases of SCIE, SSCI and AH&CI, retrieved via the Web of Science. Bradford Law and Lotka's Law, respectively, examined the distribution of journal articles and author productivity. Furthermore, this study determines the citation impact of ACO using parameters such as extent of citation received in terms of number of citations per study, distribution of citations over time, distribution of citations among domains, citation of authors, citation of institutions, highly cited papers and citing journals and impact factor of 12,960 citations. This study can help researchers to better understand the history, current status and trends of ACO in the advanced study of it. (C) 2011 Elsevier I.td. All rights reserved.

引用

页码：6229 / 6237

页数：9

共 20 条

[1] Using Ant Colony Optimization algorithm for solving project management problems [J].

Abdallah, Hazem ;

Emara, Hassan M. ;

Dorrah, Hassan T. ;

Bahgat, Ahmed .

EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (06) :10004-10015

[2] Metaheuristics in combinatorial optimization: Overview and conceptual comparison [J].

Blum, C ;

Roli, A .

ACM COMPUTING SURVEYS, 2003, 35 (03) :268-308

[3] An improved ant system algorithm for the vehicle routing problem [J].

Bullnheimer, B ;

Hartl, RF ;

Strauss, C .

ANNALS OF OPERATIONS RESEARCH, 1999, 89 (0) :319-328

[4] Ants can colour graphs [J].

Costa, D ;

Hertz, A .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1997, 48 (03) :295-305

[5] Ant colony optimization-based algorithm for airline crew scheduling problem [J].

Deng, Guang-Feng ;

Lin, Woo-Tsong .

EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (05) :5787-5793

[6] Ant colony optimization theory: A survey [J].

Dorigo, M ;

Blum, C .

THEORETICAL COMPUTER SCIENCE, 2005, 344 (2-3) :243-278

[7] Ant colonies for the travelling salesman problem [J].

Dorigo, M ;

Gambardella, LM .

BIOSYSTEMS, 1997, 43 (02) :73-81

[8] Ant algorithms for discrete optimization [J].

Dorigo, M ;

Di Caro, G ;

Gambardella, LM .

ARTIFICIAL LIFE, 1999, 5 (02) :137-172

[9] Ant system: Optimization by a colony of cooperating agents [J].

Dorigo, M ;

Maniezzo, V ;

Colorni, A .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41

[10] Ant colony optimization -: Artificial ants as a computational intelligence technique [J].

Dorigo, Marco ;

Birattari, Mauro ;

Stuetzle, Thomas .

IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2006, 1 (04) :28-39

← 1 2 →