Gravitational swarm optimizer for global optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yadav, Anupam | - |
dc.contributor.author | Deep, Kusum | - |
dc.contributor.author | Kim, Joong Hoon | - |
dc.contributor.author | Nagar, Atulya K. | - |
dc.date.accessioned | 2021-09-03T16:30:15Z | - |
dc.date.available | 2021-09-03T16:30:15Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2016-12 | - |
dc.identifier.issn | 2210-6502 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/86746 | - |
dc.description.abstract | In this paper, a new meta-heuristic method is proposed by combining Particle Swarm Optimization (PSO) and gravitational search in a coherent way. The advantage of swarm intelligence and the idea of a force of attraction between two particles are employed collectively to propose an improved meta-heuristic method for constrained optimization problems. Excellent constraint handling is always required for the success of any constrained optimizer. In view of this, an improved constraint-handling method is proposed which was designed in alignment with the constitutional mechanism of the proposed algorithm. The design of the algorithm is analyzed in many ways and the theoretical convergence of the algorithm is also established in the paper. The efficiency of the proposed technique was assessed by solving a set of 24 constrained problems and 15 unconstrained problems which have been proposed in IEEE-CEC sessions 2006 and 2015, respectively. The results are compared with 11 state-of-the-art algorithms for constrained problems and 6 state-of-the-art algorithms for unconstrained problems. A variety of ways are considered to examine the ability of the proposed algorithm in terms of its converging ability, success, and statistical behavior. The performance of the proposed constraint-handling method is judged by analyzing its ability to produce a feasible population. It was concluded that the proposed algorithm performs efficiently with good results as a constrained optimizer. (C) 2016 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.subject | PARTICLE SWARM | - |
dc.subject | DIFFERENTIAL EVOLUTION | - |
dc.subject | ALGORITHM | - |
dc.subject | CONVERGENCE | - |
dc.subject | PARAMETERS | - |
dc.subject | DESIGN | - |
dc.title | Gravitational swarm optimizer for global optimization | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Joong Hoon | - |
dc.identifier.doi | 10.1016/j.swevo.2016.07.003 | - |
dc.identifier.scopusid | 2-s2.0-84995545592 | - |
dc.identifier.wosid | 000390739200004 | - |
dc.identifier.bibliographicCitation | SWARM AND EVOLUTIONARY COMPUTATION, v.31, pp.64 - 89 | - |
dc.relation.isPartOf | SWARM AND EVOLUTIONARY COMPUTATION | - |
dc.citation.title | SWARM AND EVOLUTIONARY COMPUTATION | - |
dc.citation.volume | 31 | - |
dc.citation.startPage | 64 | - |
dc.citation.endPage | 89 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | PARTICLE SWARM | - |
dc.subject.keywordPlus | DIFFERENTIAL EVOLUTION | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | CONVERGENCE | - |
dc.subject.keywordPlus | PARAMETERS | - |
dc.subject.keywordPlus | DESIGN | - |
dc.subject.keywordAuthor | Particle Swarm Optimization | - |
dc.subject.keywordAuthor | Gravitational Search Algorithm | - |
dc.subject.keywordAuthor | Constrained optimization | - |
dc.subject.keywordAuthor | Shrinking hypersphere | - |
dc.subject.keywordAuthor | Constrained handling | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.