| 3/2014 - 7 |
Improvement of the Gravitational Search Algorithm by means of Low-Discrepancy Sobol Quasi Random-Number Sequence Based InitializationALTINOZ, O. T.   , YILMAZ, A. E. , WEBER, G.-W. |
View the paper record and citations in  |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (764 KB) | Citation | Downloads: 721 | Views: 4,789 |
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
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 588] [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 52] [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 2165] [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] [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 4] [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 2656] [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 7] [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 5] [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 365] [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 4665] [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 516] [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] [Web of Science Times Cited 562] [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 115] [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 806] [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 250] [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. Web of Science® Citations for all references: 12,758 TCR SCOPUS® Citations for all references: 0 Web of Science® Average Citations per reference: 608 ACR SCOPUS® Average Citations per reference: 0 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 2024-04-15 20:46 in 92 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-2024
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.
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.
