Indexes-Based and Partial Restart-Based Constrained Multiobjective Optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jun Zhang | - |
dc.date.accessioned | 2025-03-06T08:00:36Z | - |
dc.date.available | 2025-03-06T08:00:36Z | - |
dc.date.issued | 2025-08 | - |
dc.identifier.issn | 1089-778X | - |
dc.identifier.issn | 1941-0026 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/122225 | - |
dc.description.abstract | Constrained multiobjective optimization problems often have complex feasible regions and constrained Pareto fronts. These factors bring great challenges to current constrained multiobjective optimization evolutionary algorithms (CMOEAs). To solve this problem and further balance the objective optimization and constraint satisfaction, we propose an indexesbased and partial restart-based constrained multiobjective optimization algorithm (IRCMO). In IRCMO, a two-stage (i.e.,development and enhancement) and tri-population framework is designed. IRCMO adopts the aggregative indexes-based evaluation and adaptive collaborative partial restart strategy to assist the evolution of the first and second populations. The third population is obtained by directed sampling, which is mostlylocated at the boundary of the feasible region and enhances the exploration ability of extreme solutions. At the end of each generation, a progressive dual-archive strategy is designed to screen the solutions distributed uniformly from three populations. Experimental results demonstrate that IRCMO is superior to the other six state-of-the-art CMOEAs on several constraint benchmark suites and real-world problems. | - |
dc.format.extent | 12 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Indexes-Based and Partial Restart-Based Constrained Multiobjective Optimization | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TEVC.2024.3400610 | - |
dc.identifier.scopusid | 2-s2.0-85193221186 | - |
dc.identifier.wosid | 001545630400039 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, v.29, no.4, pp 1 - 12 | - |
dc.citation.title | IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION | - |
dc.citation.volume | 29 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 12 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
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 | Constrained multiobjective optimization | - |
dc.subject.keywordPlus | evolutionary algorithm | - |
dc.subject.keywordPlus | index | - |
dc.subject.keywordPlus | partial restart. | - |
dc.subject.keywordAuthor | Statistics | - |
dc.subject.keywordAuthor | Sociology | - |
dc.subject.keywordAuthor | Optimization | - |
dc.subject.keywordAuthor | Convergence | - |
dc.subject.keywordAuthor | Evolutionary computation | - |
dc.subject.keywordAuthor | Indexes | - |
dc.subject.keywordAuthor | Collaboration | - |
dc.subject.keywordAuthor | Constrained multiobjective optimization | - |
dc.subject.keywordAuthor | evolutionary algorithm | - |
dc.subject.keywordAuthor | index | - |
dc.subject.keywordAuthor | partial restart | - |
dc.identifier.url | https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10530223 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG 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.