|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.
|Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science|
|Download PDF (764 KB) | Citation | Downloads: 364 | Views: 3,446|
evolutionary computation, random number generation, Sobol quasi random number generation, gravitational search algorithm
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
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.
Web of Science® Times Cited: 3 [View]
View record in Web of Science® [View]
View Related Records® [View]
Updated 2 days, 1 hour
SCOPUS® Times Cited: 4
View record in SCOPUS® [Free preview]
 Energy-efficient clustering method for wireless sensor networks using modified gravitational search algorithm, Ebrahimi Mood, Sepehr, Javidi, Mohammad Masoud, Evolving Systems, ISSN 1868-6478, 2019.
Digital Object Identifier: 10.1007/s12530-019-09264-x [CrossRef]
 Neural network and fuzzy system for the tuning of Gravitational Search Algorithm parameters, Pelusi, Danilo, Mascella, Raffaele, Tallini, Luca, Nayak, Janmenjoy, Naik, Bighnaraj, Abraham, Ajith, Expert Systems with Applications, ISSN 0957-4174, Issue , 2018.
Digital Object Identifier: 10.1016/j.eswa.2018.02.026 [CrossRef]
Disclaimer: All information displayed above was retrieved by using remote connections to respective databases. For the best user experience, we update all data by using background processes, and use caches in order to reduce the load on the servers we retrieve the information from. As we have no control on the availability of the database servers and sometimes the Internet connectivity may be affected, we do not guarantee the information is correct or complete. For the most accurate data, please always consult the database sites directly. Some external links require authentication or an institutional subscription.
Web of Science® is a registered trademark of Clarivate Analytics, Scopus® is a registered trademark of Elsevier B.V., other product names, company names, brand names, trademarks and logos are the property of their respective owners.
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.