Title | On solving complex optimization problems with objective decomposition |
Creator | |
Date Issued | 2013 |
Source Publication | Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013
![]() |
Pages | 2264-2269 |
Abstract | This paper addresses the complex optimization problem, of which the objective function consists of two parts: One part is differentiable and the other part is non-differentiable. Accordingly, we decompose the original objective function into several relatively simple sub-objective ones, which subsequently formulate as a multiobjective optimization problem (MOP). To solve this MOP, we propose a simulated water-stream algorithm (SWA) inspired by the natural phenomenon of water streams. The water streams with a hybrid process of downstream and penetration towards the basin is analogous to the process of finding the minimum solution in an optimization problem. The SWA featuring a combination of deterministic search and heuristic search generally converges much faster than the existing counterparts with a considerable accuracy enhancement. Experimental results show the efficacy of the proposed algorithm. © 2013 IEEE. |
Keyword | Multi modal Non-differentiable function Objective decomposition Simulated waterstream algorithm |
DOI | 10.1109/SMC.2013.387 |
URL | View source |
Language | 英语English |
Scopus ID | 2-s2.0-84893595171 |
Citation statistics | |
Document Type | Conference paper |
Identifier | http://repository.uic.edu.cn/handle/39GCC9TT/6526 |
Collection | Beijing Normal-Hong Kong Baptist University |
Affiliation | 1.Department of Computer Science,Hong Kong Baptist University,Hong Kong 2.United International College,BNU-HKBU,China |
First Author Affilication | Beijing Normal-Hong Kong Baptist University |
Recommended Citation GB/T 7714 | Cheung,Yiu Ming,Gu,Fangqing. On solving complex optimization problems with objective decomposition[C], 2013: 2264-2269. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment