Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.459
JCR 5-Year IF: 0.442
Issues per year: 4
Current issue: Nov 2016
Next issue: Feb 2017
Avg review time: 95 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: 644266260
doi: 10.4316/AECE


TRAFFIC STATS

1,462,143 unique visits
469,702 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 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
 
 
 Volume 14 (2014)
 
     »   Issue 4 / 2014
 
     »   Issue 3 / 2014
 
     »   Issue 2 / 2014
 
     »   Issue 1 / 2014
 
 
 Volume 13 (2013)
 
     »   Issue 4 / 2013
 
     »   Issue 3 / 2013
 
     »   Issue 2 / 2013
 
     »   Issue 1 / 2013
 
 
  View all issues  


FEATURED ARTICLE

ABC Algorithm based Fuzzy Modeling of Optical Glucose Detection, SARACOGLU, O. G., BAGIS, A., KONAR, M., TABARU, T. E.
Issue 3/2016

AbstractPlus






LATEST NEWS

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

2015-Dec-04
Starting with Issue 2/2016, the article processing charge is 300 EUR for each article accepted for publication. The charge of 25 EUR per page for papers over 8 pages will not be changed. Details are available in the For authors section.

2015-Jun-10
Thomson Reuters published the Journal Citations Report for 2014. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.529, and the JCR 5-Year Impact Factor is 0.476.

2015-Feb-09
Starting on the 9th of February 2015, we require all authors to identify themselves, when a submission is made, by entering their SCOPUS Author IDs, instead of the organizations, when available. This information will let us better know the publishing history of the authors and better assign the reviewers on different topics.

2015-Feb-08
We have more than 500 author names on the ban-list for cheating, including plagiarism, false signatures on the copyright form, false E-mail addresses and even tentative to impersonate well-known researchers in order to become a reviewer of our Journal. We maintain a full history of such incidents.

Read More »


    
 

  3/2014 - 7

Improvement of the Gravitational Search Algorithm by means of Low-Discrepancy Sobol Quasi Random-Number Sequence Based Initialization

ALTINOZ, O. T. See more information about ALTINOZ, O. T. on SCOPUS See more information about ALTINOZ, O. T. on IEEExplore See more information about ALTINOZ, O. T. on Web of Science, YILMAZ, A. E. See more information about  YILMAZ, A. E. on SCOPUS See more information about  YILMAZ, A. E. on SCOPUS See more information about YILMAZ, A. E. on Web of Science, WEBER, G.-W. See more information about WEBER, G.-W. on SCOPUS See more information about WEBER, G.-W. on SCOPUS See more information about WEBER, G.-W. on Web of Science
 
Click to see author's profile on 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 (764 KB) | Citation | Downloads: 248 | Views: 1,729

Author keywords
evolutionary computation, random number generation, Sobol quasi random number generation, gravitational search algorithm

References keywords
algorithm(9), swarm(5), search(5), optimization(5), gravitational(4), genetic(4), evolutionary(4), computation(4)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2014-08-31
Volume 14, Issue 3, Year 2014, On page(s): 55 - 62
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2014.03007
Web of Science Accession Number: 000340869800007
SCOPUS ID: 84907331643

Abstract
Quick view
Full text preview
Nature-inspired optimization algorithms can obtain the optima by updating the position of each member in the population. At the beginning of the algorithm, the particles of the population are spread into the search space. The initial distribution of particles corresponds to the beginning points of the search process. Hence, the aim is to alter the position for each particle beginning with this initial position until the optimum solution will be found with respect to the pre-determined conditions like maximum iteration, and specific error value for the fitness function. Therefore, initial positions of the population have a direct effect on both accuracy of the optima and the computational cost. If any member in the population is close enough to the optima, this eases the achievement of the exact solution. On the contrary, individuals grouped far away from the optima might yield pointless efforts. In this study, low-discrepancy quasi-random number sequence is preferred for the localization of the population at the initialization phase. By this way, the population is distributed into the search space in a more uniform manner at the initialization phase. The technique is applied to the Gravitational Search Algorithm and compared via the performance on benchmark function solutions.


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

[1] Y. W. Leung, Y. Wang, Y. W. Leung, "An orthogonal genetic algorithm with quantization for global numerical optimization," IEEE Transactions on Evolutionary Computation, Vol. 5, No. 1, pp. 41-53, 2001.
[CrossRef] [Web of Science Times Cited 395] [SCOPUS Times Cited 576]


[2] O. T. Altinoz, A. E. Yilmaz, G. W. Weber, "Application of chaos embedded PSO for PID tuning," International Journal of Computers, Communications and Control, Vol. 7, No. 2, pp. 204-218, 2012.
[CrossRef]


[3] E. Masahian, D. Sedighizadeh, "Multiobjective particle swarm optimization and NPSO-based algorithms for robot path planning," Advances in Electrical and Computer Engineering, Vol. 10, No. 4, pp. 69-76, 2010.
[CrossRef] [Full Text] [Web of Science Times Cited 19] [SCOPUS Times Cited 23]


[4] A. Ratnaweera, S. K. Halgamuge, H.C. Watson, "Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients," IEEE Transactions on Evolutionary Computation, Vol. 8, No. 3, pp. 240-255, 2004.
[CrossRef] [Web of Science Times Cited 1091] [SCOPUS Times Cited 1565]


[5] A. Morales-Reyes, A. T. Erdogan, "A structure based coarse fine approach for diversity tuning in cellular GAs," Advances in Electrical and Computer Engineering, Vol. 12, No. 3, pp. 39-46, 2012
[CrossRef] [Full Text] [Web of Science Times Cited 2] [SCOPUS Times Cited 2]


[6] G. Mortinovic, D. Bojer, "Elitist ant system with 2-opt local search for the traveling salesman problem," Advances in Electrical and Computer Engineering, Vol. 12, No. 1, pp. 25-32, 2012.
[CrossRef] [Full Text] [Web of Science Times Cited 1] [SCOPUS Times Cited 2]


[7] J. J. Liang, A. K. Qin, P. N. Suganthan, S. Baskar, "Comprehensive learning particle swarm optimizer for global optimization of multimodal functions," IEEE Transactions on Evolutionary Computation, Vol. 10, No. 3, pp. 281-295, 2006.
[CrossRef] [Web of Science Times Cited 985] [SCOPUS Times Cited 1438]


[8] O. T. Altinoz, A. E. Yilmaz, "Particle swarm optimization with parameter dependency walls and its sample application to the microstrip-like interconnect line design," AEÜ-International Journal of Electronics and Communications, Vol. 66, No. 2, pp. 107-114, 2012.
[CrossRef] [Web of Science Times Cited 3] [SCOPUS Times Cited 5]


[9] O. Brudaru, D. Popovich, C. Copecanu, "Cellular genetic algorithm with communicating grids for assembly line balancing problems," Advances in Electrical and Computer Engineering, Vol. 10, No. 2, pp. 87-93, 2010.
[CrossRef] [Full Text] [Web of Science Times Cited 4] [SCOPUS Times Cited 6]


[10] B. Liu, L. Wang, Y.H. Jin, "An effective PSO-based memetic algorithm for flow shop scheduling," IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, Vol. 37, No. 1, pp. 18-27, 2007.
[CrossRef] [Web of Science Times Cited 159] [SCOPUS Times Cited 209]


[11] J. Kennedy, Y. Shi, R. Eberhart, Swarm Intelligence. San Diego, CA, USA: Academic Press, 2001.

[12] E. Rashedi, H. Nezamabadi, S. Saryazdi, "GSA: A gravitational search algorithm," Information Sciences, Vol. 179, No. 13, pp. 2232-2248, 2009.
[CrossRef] [Web of Science Times Cited 803] [SCOPUS Times Cited 1138]


[13] E. Rashedi, H. Nezamabadi, S. Saryazdi, "BGSA: Binary gravitational search algorithm," Natural Computing, Vol. 9, No. 3, pp. 727-745, 2010.
[CrossRef] [Web of Science Times Cited 135] [SCOPUS Times Cited 205]


[14] P. Bradley, B.L. Fox, "Algorithm 659: Implementing Sobol’s quasirandom sequence generator," ACM Transactions on Mathematical Software, Vol. 14, No. 1, pp. 88-100, 1988.
[CrossRef] [SCOPUS Times Cited 321]


[15] I. M. Sobol, "Distribution of points in a cube and approximate evaluation of integrals," Zhurnal Vychislitelnoi Matematik i Matematicheskoi Fiziki (USSR Computational Mathematics and Mathematical Physics), Vol. 7, No. 4, pp. 784-802, 1967.

[16] O. T. Altinoz, A. E. Yilmaz, G. W. Weber, "Orthogonal array based performance improvement in the gravitational search algorithm," Turkish Journal of Electrical Engineering and Computer Sciences, Vol. 21, No. 1, pp. 174-185, 2013.

[17] H. Maaranen, K. Miettinen, M. M. Makela, "Quasi-random initial population for genetic algorithms," Computers & Mathematics with Applications, Vol. 47, No. 12, pp. 1885-1895, 2004.
[CrossRef] [Web of Science Times Cited 52]


[18] S. A. Kazarlis, A.G. Bakirtzis, V. A. Petridis, "A genetic algorithm solution to the unit commitment problem," IEEE Transactions on Power Systems, Vol. 11, No. 1, pp. 83-92, 1996.
[CrossRef] [Web of Science Times Cited 477] [SCOPUS Times Cited 725]


[19] E. Rashedi, H. Nezamabadi, S. Saryazdi, "Filter modeling using gravitational search algorithm," Engineering Applications of Artificial Intelligence, Vol. 24, No. 1, pp. 117-122, 2011.
[CrossRef] [Web of Science Times Cited 112] [SCOPUS Times Cited 167]


[20] 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," 2005 IEEE Congress on Evolutionary Computation (CEC 2005), pp. 1-5, 2005.



References Weight

Web of Science® Citations for all references: 4,238 TCR
SCOPUS® Citations for all references: 6,382 TCR

Web of Science® Average Citations per reference: 202 ACR
SCOPUS® Average Citations per reference: 304 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 2016-12-04 21:46 in 88 seconds.




Note1: Web of Science® is a registered trademark of Thomson Reuters.
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-2016
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: