ACM Home Page
Please provide us with feedback. Feedback
Using a distance metric to guide PSO algorithms for many-objective optimization
Full text PdfPdf (1.22 MB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 7: evolutionary multiobjective optimization table of contents
Pages 667-674  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Upali K. Wickramasinghe  RMIT University, Melbourne, Australia
Xiaodong Li  RMIT University, Melbourne, Australia
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): 16,   Downloads (12 Months): 42,   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/1569901.1569993
What is a DOI?

ABSTRACT

In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for many-objective problems. We use a particle swarm optimization (PSO) algorithm as a baseline to demonstrate the usefulness of this distance metric, though the metric can be used in conjunction with any evolutionary multi-objective (EMO) algorithm. Existing user-preference based EMO algorithms rely on the use of dominance comparisons to explore the search-space. Unfortunately, this is ineffective and computationally expensive for many-objective problems. In the proposed distance metric based PSO, particles update their positions and velocities according to their closeness to preferred regions in the objective-space, as specified by the decision maker. The proposed distance metric allows an EMO algorithm's search to be more effective especially for many-objective problems, and to be more focused on the preferred regions, saving substantial computational cost. We demonstrate how to use a distance metric with two user-preference based PSO algorithms, which implement the reference point and light beam search methods. These algorithms are compared to a user-preference based PSO algorithm relying on the conventional dominance comparisons. Experimental results suggest that the distance metric based algorithms are more effective and efficient especially for difficult many-objective problems.


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
M. Clerc and J. Kennedy. The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6:58--73, 2002.
 
2
K. Deb, S. Agrawal, A. Pratab, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6:182--197, 2002.
3
 
4
K. Deb and A. Kumar. Light beam search based multi-objective optimization using evolutionary algorithms. In IEEE Congress on Evolutionary Computation (CEC), 2007.
5
 
6
K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. Scalable test problems for evolutionary multi-objective optimization. In Evolutionary Multiobjective Optimization (EMO): Theoretical Advances and Applications, pages 105--145. Springer, 2005.
 
7
 
8
M. Ehrgott and X. Gandibleux. Multiple Criteria Optimization: State of the Art Annotated Bibliographic Survey, volume 52 of International Series in Operations Research and Management Science. Kluwer Academic Publishers, 2002.
 
9
S. Huband, P. Hingston, L. Barone, and R. L. While. A review of multiobjective test problems and a scalable test problem toolkit. IEEE Transactions on Evolutionary Computation, 10:477--506, 2006.
 
10
A. Jaszkiewicz and R. Slowinski. The light beam search approach - an overview of methodology and applications. European Journal of Operational Research, 113:300--314, 1999.
 
11
 
12
M. Koppen and R. Vicente-Garcia. A fuzzy scheme for the ranking of multivariate data and its application. In North American Fuzzy Information Processing Society (NAFIPS), pages 140--145, 2004.
 
13
M. Koppen, R. Vicente-Garcia, and B. Nickolay. Fuzzy-pareto-dominance and its application in evolutionary multi-objective optimization. In Evolutionary Multiobjective Optimization (EMO), volume 3410 of Lecture Notes in Computer Science, pages 399--412. Springer, 2005.
 
14
 
15
S. Kukkonen and J. Lampinen. Ranking-dominance and many-objective optimization. In IEEE Congress on Evolutionary Computation (CEC), pages 3983--3990, 2007.
 
16
X. Li. A non-dominated sorting particle swarm optimizer for multiobjective optimization. In Genetic and Evolutionary Computation Conference (GECCO), volume 2723 of Lecture Notes in Computer Science, pages 37--48. Springer, 2003.
 
17
X. Li. Better spread and convergence: Particle swarm multiobjective optimization using the maximin fitness function. In Genetic and Evolutionary Computation Conference (GECCO), volume 3102 of Lecture Notes in Computer Science, pages 117--128. Springer, 2004.
 
18
 
19
 
20
A. Sulflow, N. Drechsler, and R. Drechsler. Robust multi-objective optimization in high dimensional spaces. In Evolutionary Multiobjective Optimization (EMO), volume 4403 of Lecture Notes in Computer Science, pages 715--726. Springer, 2006.
 
21
22
 
23

Collaborative Colleagues:
Upali K. Wickramasinghe: colleagues
Xiaodong Li: colleagues