DocumentCode :
2693928
Title :
Cross-searching strategy for multi-objective particle swarm optimization
Author :
Chiu, Shih-Yuan ; Sun, Tsung-Ying ; Hsieh, Sheng-Ta ; Lin, Cheng-Wei
Author_Institution :
Nat. Dong Hwa Univ., Hualien
fYear :
2007
fDate :
25-28 Sept. 2007
Firstpage :
3135
Lastpage :
3141
Abstract :
The main difference between an original PSO (single-objective) with a multi-objective PSO (MOPSO) is the local guide (global best solution) distribution must be redefined in order to obtain a set of non-dominated solutions (Pareto front). In MOPSO, the selection of local guide for particles will direct affect the performance of finding Pareto optimum. This paper presents a local guide assignment strategy for MOPSO called cross-searching strategy (CSS) which will distribute suitable local guides for particles to lead them toward to Pareto front and also keeping diversity of solutions. Experiments were conducted on several test functions and metrics from the standard literature on evolutionary multi-objective optimization. The results demonstrate good performance of the CSS for MOPSO in solving multi-objective problems when compare with recent approaches of multi-objective optimizer.
Keywords :
Pareto optimisation; particle swarm optimisation; search problems; Pareto front; cross-searching strategy; evolutionary multiobjective optimization; local guide assignment strategy; multiobjective optimizer; multiobjective particle swarm optimization; Cascading style sheets; Genetic algorithms; Genetic mutations; Pareto optimization; Particle swarm optimization; Sorting; Student members; Sun; Testing; Topology; Local guide; cross-searching strategy; multi-objective particle swarm optimization (MOPSO);
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-1339-3
Electronic_ISBN :
978-1-4244-1340-9
Type :
conf
DOI :
10.1109/CEC.2007.4424872
Filename :
4424872
Link To Document :
بازگشت