ACM Home Page
Please provide us with feedback. Feedback
Multi-objective particle swarm optimization algorithm based on game strategies
Full text PdfPdf (658 KB)
Source
ACM/SIGEVO Summit on Genetic and Evolutionary Computation archive
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation table of contents
Shanghai, China
SESSION: Full papers table of contents
Pages 287-294  
Year of Publication: 2009
ISBN:978-1-60558-326-6
Authors
Zhiyong Li  School of Computer and Communication, Hunan University, Changsha, China
Songbing Liu  School of Computer and Communication, Hunan University, Changsha, China
Degui Xiao  School of Computer and Communication, Hunan University, Changsha, China
Jun Chen  Student Admission Of Hunan University, Changsha, China
Kenli Li  School of Computer and Communication, Hunan University, Changsha, China
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 60,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1543834.1543873
What is a DOI?

ABSTRACT

Particle Swarm Optimization (PSO) is easier to realize and has a better performance than evolutionary algorithm in many fields. This paper proposes a novel multi-objective particle swarm optimization algorithm inspired from Game Strategies (GMOPSO), where those optimized objectives are looked as some independent agents which tend to optimize own objective function. Therefore, a multi- player game model is adopted into the multi-objective particle swarm algorithm, where appropriate game strategies could bring better multi-objective optimization performance. In the algorithm, novel bargain strategy among multiple agents and nondominated solutions archive method are designed for improving optimization performance. Moreover, the algorithm is validated by several simulation experiments and its performance is tested by different benchmark functions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Deb K, Agrawal S, Pratap A and Meyarivan T, "A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II", IEEE Transaction on Evolutionary Computations, VOL. 6, No. 2, 2002, pp. 182--197.
 
2
Zitzler E, Laumanns M, Thiele L, "SPEA2: Improving the strength Pareto evolutionary algorithm", TIK-Report 103, 2001.
 
3
R.Eberhart, J.Kennedy, "A new optimizer using particle swarm theory", The 6th Int'l Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995, pp. 39--43.
 
4
R. Eberhart, J. Kennedy, "Particle Swarm Optimization", Proc. IEEE Int. Conf. On Neural Networks, IEEE Press, USA, 1995, pp: 1942--1948.
 
5
Margarita Reyes-Sierra, Carlos A. Coello Coello, Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art", International Journal of Computational Intelligence Research, Vol.2, No.3 2006, pp. 287--308
6
 
7
 
8
 
9
Jin S. Heo, Kwang Y. Lee and Raul Garduno-Ramirez, "Multi objective Control of Power Plants Using Particle Swarm Optimization Techniques", IEEE Transaction on Energy Conversion, Vol. 21, no. 2, 2006, pp. 552--561.
10
 
11
 
12
Jun Sun, Bin Feng, Wenbo Xu, "Particle swarm optimization with particles having quantum behabior", In Congress on Evolutionary Computation, IEEE, 2004, pp. 325--331
 
13
Rudolph.G. and Agapie.A. Convergence Properties of Some Multi-Objective Evolutionary Algorithms. In the 2000 Congress on Evolutionary Computation (CEC 2000), IEEE Press, Piscataway (NJ), 2000.
14

Collaborative Colleagues:
Zhiyong Li: colleagues
Songbing Liu: colleagues
Degui Xiao: colleagues
Jun Chen: colleagues
Kenli Li: colleagues