Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.699
JCR 5-Year IF: 0.674
Issues per year: 4
Current issue: Feb 2019
Next issue: May 2019
Avg review time: 83 days


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


TRAFFIC STATS

2,235,413 unique visits
582,408 downloads
Since November 1, 2009



No robots online now


SJR SCImago RANK

SCImago Journal & Country Rank


SEARCH ENGINES

aece.ro - Google Pagerank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 19 (2019)
 
     »   Issue 1 / 2019
 
 
 Volume 18 (2018)
 
     »   Issue 4 / 2018
 
     »   Issue 3 / 2018
 
     »   Issue 2 / 2018
 
     »   Issue 1 / 2018
 
 
 Volume 17 (2017)
 
     »   Issue 4 / 2017
 
     »   Issue 3 / 2017
 
     »   Issue 2 / 2017
 
     »   Issue 1 / 2017
 
 
 Volume 16 (2016)
 
     »   Issue 4 / 2016
 
     »   Issue 3 / 2016
 
     »   Issue 2 / 2016
 
     »   Issue 1 / 2016
 
 
 Volume 15 (2015)
 
     »   Issue 4 / 2015
 
     »   Issue 3 / 2015
 
     »   Issue 2 / 2015
 
     »   Issue 1 / 2015
 
 
  View all issues  








LATEST NEWS

2018-Jun-27
Clarivate Analytics published the InCites Journal Citations Report for 2017. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.699, and the JCR 5-Year Impact Factor is 0.674.

2017-Jun-14
Thomson Reuters published the Journal Citations Report for 2016. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.595, and the JCR 5-Year Impact Factor is 0.661.

2017-Feb-16
With new technologies, such as mobile communications, internet of things, and wide applications of social media, organizations generate a huge volume of data, much faster than several years ago. Big data, characterized by high volume, diversity and velocity, increasingly drives decision making and is changing the landscape of business intelligence, from governments to private organizations, from communities to individuals. Big data analytics that discover insights from evidences has a high demand for computing efficiency, knowledge discovery, problem solving, and event prediction. We dedicate a special section of Issue 4/2017 to Big Data. Prospective authors are asked to make the submissions for this section no later than the 31st of May 2017, placing "BigData - " before the paper title in OpenConf.

Read More »


    
 

  3/2017 - 11

Repeating Successful Movement Strategy for ABC Algorithm

KOCER, B. See more information about KOCER, B. on SCOPUS See more information about KOCER, B. on IEEExplore See more information about KOCER, B. on Web of Science
 
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (1,377 KB) | Citation | Downloads: 217 | Views: 780

Author keywords
artificial intelligence, machine learning, evolutionary computation, particle swarm optimization, machine intelligence

References keywords
optimization(18), algorithm(18), artificial(13), colony(12), comput(8), jasoc(6), swarm(5), soft(5), search(5), jins(5)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2017-08-31
Volume 17, Issue 3, Year 2017, On page(s): 85 - 94
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2017.03011
Web of Science Accession Number: 000410369500011
SCOPUS ID: 85028548845

Abstract
Quick view
Full text preview
ABC is a well-known nature inspired algorithm. In short ABC algorithm mimics the foraging behavior of the bee colonies. ABC is very intensively worked algorithm. It has many variants. The base algorithm and most of the variants uses an update equation to improve the solutions. The update equation finds a feasible movement based on neighbor solutions and adds that movement to current to create a mutant solution. If the mutant solution is better than the original one then original solution is updated. None of the ABC variant use a successful movement again. In this work when a successful move found then it is used again. Proposed approach is applied to ABCVSS algorithm which is a recently proposed ABC variant and that modified ABCVSS algorithm (ABCVSSRSM) is tested on numerical benchmark functions and results compared the well-known ABC variants. Results show that proposed method is superior under multiple criteria.


References | Cited By  «-- Click to see who has cited this paper

[1] D. Karaboga, "An idea based on honey bee swarm for numerical optimization," Erciyes University, Kayseri, Turkey, Tech. Rep., TR06, 2005.

[2] J. Kennedy, R. Eberhart, "Particle swarm optimization," in 1995 IEEE international conference on neural networks proceedings, Vols. 1–6 pp. 1942–1948, 1995

[3] M. Dorigo, V. Maniezzo, A. Colorni, "Ant system: Optimization by a colony of cooperating agents," IEEE Transactions on Systems Man and Cybernetics Part B, Cybernetics, 26(1), 1996, pp. 29–41.
[CrossRef] [Web of Science Times Cited 5185] [SCOPUS Times Cited 7295]


[4] X. S. Yang, S. Deb, "Engineering optimization by cuckoo search," Int. J. Math. Model. Numer. Opt. 1, pp. 330–343, 2010

[5] X. S. Yang, "Firefly algorithm, stochastic test functions and design optimisation," International Journal of Bio-Inspired Computation, 2(2), pp. 78–84, 2010
[CrossRef] [Web of Science Times Cited 729] [SCOPUS Times Cited 979]


[6] Z. W. Geem, J. H. Kim, G. V. Loganathan, "A new heuristic optimization algorithm: Harmony search. Simulation," 76(2), pp. 60–68, 2001
[CrossRef] [SCOPUS Times Cited 3041]


[7] Uymaz S. A. , Tezel G., Yel E., Artificial algae algorithm (AAA) for nonlinear global optimization, Applied Soft Computing, Volume 31, June 2015, pp. 153-171, ISSN 1568-4946,
[CrossRef] [Web of Science Times Cited 31] [SCOPUS Times Cited 39]


[8] H. M. Harmanani, F. Drouby, S. B. Ghosn, A parallel genetic algorithm for the open-shop scheduling problem using deterministic and random moves, International Journal of Artificial Intelligence, vol. 14, no. 1, pp. 130-144, 2016.

[9] Z. C. Johanyák, O. Papp, "A hybrid algorithm for parameter tuning in fuzzy model identification," Acta Polytechnica Hungarica, vol. 9, no. 6, pp. 153-165, 2012.

[10] R.-E. Precup, R.-C. David, E. M. Petriu, S. Preitl, M.-B. Radac, "Novel adaptive charged system search algorithm for optimal tuning of fuzzy controllers," Expert Systems with Applications, vol. 41, no. 4, pp. 1168-1175, 2014
[CrossRef] [Web of Science Times Cited 49] [SCOPUS Times Cited 62]


[11] A. Basgumus, M. Namda, R, G. Yilmaz, A. Altuncu, "Performance comparison of the differential evolution and particle swarm optimization algorithms in free-space optical communications systems," Advances in Electrical and Computer Engineering, vol. 15, no. 2, pp. 17-22, 2015.
[CrossRef] [Full Text] [Web of Science Times Cited 8] [SCOPUS Times Cited 8]


[12] B. Akay, D. Karaboga, "A modified artificial bee colony algorithm for real-parameter optimization," Inf. Sci. 192, pp. 120–142, 2012
[CrossRef] [Web of Science Times Cited 471] [SCOPUS Times Cited 685]


[13] G. Zhu, S. Kwong, "Gbest-guided artificial bee colony algorithm for numerical function optimization," Appl. Math. Comput. 217, pp. 3166–3173, 2010
[CrossRef] [Web of Science Times Cited 509] [SCOPUS Times Cited 694]


[14] A. Banharnsakun, T. Achalakul, B. Sirinaovakul, "The best-so-far selection in artificial bee colony algorithm," Appl. Math. Comput. 11, pp. 2888–2901, 2011
[CrossRef] [Web of Science Times Cited 218] [SCOPUS Times Cited 285]


[15] A. Banharnsakun, B. Sirinaovakul, T. Achalakul, "The best-so-far ABC with multiple patrilines for clustering problems," Neurocomputing 116, pp. 355–366, 2013
[CrossRef] [Web of Science Times Cited 18] [SCOPUS Times Cited 21]


[16] W. Gao, S. Liu, L. Huang, "A global best artificial bee colony algorithm for global optimization," J. Comput. Appl. Math. 236 pp. 2741–2753, 2012
[CrossRef] [Web of Science Times Cited 196] [SCOPUS Times Cited 247]


[17] M. S. Kiran, O. Findik, "A directed artificial bee colony algorithm," Appl. Soft Comput. 26, pp. 454–462, 2015
[CrossRef] [Web of Science Times Cited 79] [SCOPUS Times Cited 106]


[18] W. Gao, S. Liu, "A modified artificial bee colony algorithm," Comput. Oper. Res. 39, pp. 687–697, 2012
[CrossRef] [Web of Science Times Cited 261] [SCOPUS Times Cited 359]


[19] D. Karaboga, B. Gorkemli, "A quick artificial bee colony (qABC) algorithm and its performance on optimization problems," Appl. Soft Comput. 23, pp. 227–238, 2014
[CrossRef] [Web of Science Times Cited 115] [SCOPUS Times Cited 149]


[20] N. Imanian, M.E. Shiri, P. Moradi, "Velocity based artificial bee colony algorithm for high dimensional continuous optimization problems," Eng. Appl. Artif. Intell. 36, pp. 148–163, 2014
[CrossRef] [Web of Science Times Cited 36] [SCOPUS Times Cited 44]


[21] W. Du, B. Li "Multi-strategy ensemble particle swarm optimization for dynamic optimization," Inform. Sci., 178 (15), pp. 3096–3109, 2008
[CrossRef] [Web of Science Times Cited 140] [SCOPUS Times Cited 176]


[22] R. Mallipeddi, S. Mallipeddi, P.N. Suganthan, "Ensemble strategies with adaptive evolutionary programming," Inform. Sci., 180 (9), pp. 1571–1581, 2010
[CrossRef] [Web of Science Times Cited 75] [SCOPUS Times Cited 90]


[23] R. Mallipeddi, P.N. Suganthan, "Ensemble of constraint handling techniques," IEEE Trans. Evolut. Comput., 14(4), pp. 561–579, 2010
[CrossRef] [Web of Science Times Cited 182] [SCOPUS Times Cited 230]


[24] R. Mallipeddi, P.N. Suganthan, Q.K. Pan, M.F. Tasgetiren, "Differential evolution algorithm with ensemble of parameters and mutation strategies," Appl. Soft Comput., 11(2), , pp. 1679–1696, 2011
[CrossRef] [Web of Science Times Cited 611] [SCOPUS Times Cited 694]


[25] H. Wang, Z. Wu, S. Rahnamayan, H. Sun, Y. Liu, J. Pan, "Multi-strategy ensemble artificial bee colony algorithm," Inf. Sci. 279, pp. 587–603, 2014
[CrossRef] [Web of Science Times Cited 73] [SCOPUS Times Cited 110]


[26] M. S. Kiran, H. Hakli, M. Gunduz, H. Uguz, "Artificial bee colony algorithm with variable search strategy for continuous optimization," Information Sciences 300, pp. 140–157, 2010
[CrossRef] [Web of Science Times Cited 76] [SCOPUS Times Cited 102]


[27] W. Gao, S. Liu, L. Huang, "A novel artificial bee colony algorithm based on modified search equation and orthogonal learning," IEEE T. Syst. Man Cy. B, 2012,
[CrossRef] [Web of Science Times Cited 153] [SCOPUS Times Cited 202]


[28] P. N. Suganthan, N. Hansen, J.J. Liang, K. Deb, Y.-P. Chen, A. Auger, S. Tiwari, "Problem definitions and evaluation criteria for the CEC 2005 special session on real parameter optimization," Technical report, 2005005, ITT Kanpur, India, 2005.

[29] V. Muthiah-Nakarajan, M. M. Noel, "Galactic Swarm Optimization: A new global optimization metaheuristic inspired by galactic motion," Applied Soft Computing, Volume 38, January 2016, Pages 771-787, ISSN 1568-4946,
[CrossRef] [Web of Science Times Cited 12] [SCOPUS Times Cited 17]




References Weight

Web of Science® Citations for all references: 9,227 TCR
SCOPUS® Citations for all references: 15,635 TCR

Web of Science® Average Citations per reference: 308 ACR
SCOPUS® Average Citations per reference: 521 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2019-05-19 06:19 in 158 seconds.




Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2019
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania


All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.




Website loading speed and performance optimization powered by: