ACM Home Page
Please provide us with feedback. Feedback
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
Full text PdfPdf (574 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
SESSION: Evolutionary multiobjective optimization papers table of contents
Pages 721-728  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Authors
A.K.M. Khaled Ahsan Talukder  The University of Melbourne, Melbourne, Australia
Michael Kirley  The University of Melbourne, Melbourne, Australia
Rajkumar Buyya  The University of Melbourne, Melbourne, Australia
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 68,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate (or surrogate) methods offer the possibility of reducing the number of evaluations, without reducing solution quality. Artificial Neural Network (ANN) based models are one approach that have been used to approximate the future front from the current available fronts with acceptable accuracy levels. However, the associated computational costs limit their effectiveness. In this work, we introduce a simple approach that has comparatively smaller computational cost and we have developed this model as a variation operator that can be used in any kind of multiobjective optimizer. When designing this model, we have considered the whole search procedure as a dynamic system that takes available objective values in current front as input and generates approximated design variables for the next front as output. Initial simulation experiments have produced encouraging results in comparison to NSGA-II. Our motivation was to increase the speed of the hosting optimizer. We have compared the performance of the algorithm with respect to the total number of function evaluation and Hypervolume metric. This variation operator has worst case complexity of O(nkN3), where N is the population size, n and k is the number of design variables and objectives respectively.


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
S. Adra, A. Hamody, I. Griffin, and P. J. Fleming. A Hybrid Multi-objective Evolutionary Algorithm Using an Inverse Neural Network for Aircraft Control System Design. In IEEE Congress on Evolutionary Computation (CEC-2005), volume 1, pages 1--8, Edinburgh, UK, September 2005. IEEE Pres.
2
3
4
 
5
J. Branke, T. Kaußler, and H. Schmeck. Guiding Multi-Objective Evolutionary Algorithms Towards Interesting Regions. In I. C. Parmee, editor, Fourth International Conference on Adaptive Computing in Design and Manufacture (ACDM 2000), Poster Proceedings, pages 1--4, Plymouth, UK, 2000. Plymouth Engineering Design Centre, University of Plymouth.
 
6
M. Brown and R. E. Smith. Effective Use of Directional Information in Multi-objective Evolutionary Computation. In The 5th Annual Conference on Genetic and Evolutionary Computation (GECCO-2003), volume 2723/2003 of LNCS, pages 778--789, Chicago, Illinois, USA, 2003. Springer.
 
7
M. Brown and R. E. Smith. Directed Multiobjective Optimization. International Journal of Computers, Systems and Signals, 6(1):3--17, 2005.
 
8
D. Buche, N. Schraudolph, and P. Koumoutsakos. Accelerating Evolutionary Algorithms with Gaussian Process Fitness Function Models. IEEE Transactions on Systems, Man, and Cybernetics, 35(2):183--194, May 2005.
 
9
D. Chafekar, L. Shi, K. Rasheed, and J. Xuan. Multiobjective GA Optimization Using Reduced Models. IEEE Transactions on Systems, Man, and Cybernetics, 35(2):261--265, May 2005.
 
10
 
11
 
12
M. Emmerich, K. Giannakoglou, and B. Naujoks. Single- and Multiobjective Evolutionary Optimization Assisted by Gaussian Random Field Metamodels. IEEE Transactions on Evolutionary Computation, 10(4):421--439, August 2006.
 
13
M. Farina. A Neural Network Based Generalized Response Surface Multiobjective Evolutionary Algorithm. In IEEE Congress on Evolutionary Computation (CEC-2002), volume 1, pages 956--961, Honolulu, HI, May 2002. IEEE Press.
 
14
A. Gaspar-Cunha and A. Vieira. A Multiobjective Evolutionary Algorithm Using Neural Networks to Approximate Fitness Evaluations. International Journal of Computers, Systems and Signals, 6(1):18--36, 2005.
15
 
16
S. Huband, P. Hingston, L. Barone, and L. While. A Review of Multiobjective Test Problems and a Scalable Test Problem Toolkit. IEEE Transaction on Evolutionary Computation, 10(5):477--506, October 2006.
 
17
 
18
Y. Jin, M. Olhofer, and B. Sendhoff. A Framework for Evolutionary Optimization with Approximate Fitness Functions. IEEE Transactions on Evolutionary Computation, 6(5):481--494, October 2002.
19
 
20
J. Knowles. ParEGO: A Hybrid Algorithm with On-line Landscape Approximation for Expensive Multiobjective Optimization Problems. IEEE Transactions on Evolutionary Computation, 10(1):50--66, February 2006.
21
 
22
W. Liu, Q. Zhang, E. P. K. Tsang, C. Liu, and B. Virginas. On the Performance of Metamodel Assisted MOEA/D. In L. Kang, Y. Liu, and S. Y. Zeng, editors, ISICA-2007, volume 4683 of LNCS, pages 547--557, Wuhan, China, August 2007. Springer.
 
23
 
24
 
25
P. K. Nain and K. Deb. Computationally Effective Search and Optimization Procedure Using Coarse to Fine Approximations. In IEEE Congress on Evolutionary Computation (CEC-2003), volume 3, pages 2081--2088, Canberra, NSW, Australia, December 2003. IEEE Press.
 
26
 
27
 
28
Y. S. Ong, P. B. Nair, and A. J. Keane. Evolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling. American Institute of Aeronautics and Astronautics Journal, 41(4):689--696, 2003.
 
29
Y.-S. Ong, P. B. Nair, and K. Lum. Max-Min Surrogate-Assisted Evolutionary Algorithm for Robust Design. IEEE Transactions on Evolutionary Computation, 10(4):392--404, August 2006.
 
30
 
31
T. Ray and W. Smith. A Surrogate Assisted Parallel Multiobjective Evolutionary Algorithm for Robust Engineering Design. Engineering Optimization, 38(8):997--1011, 2006.
 
32
H. Soh, Y. S. Ong, M. Salahuddin, T. Hung, and B. S. Lee. Playing in the Objective Space: Coupled Approximators for Multi-Objective Optimization. In IEEE Symposium on Computational Intelligence in Multicriteria Decision Making (ICDM-2007), pages 325--332. IEEE Press, April 2007.
 
33
D. E. Stewart and Z. Leyk. Meschach: Matrix Computations in C. In Centre for Mathematics and Its Applications, volume 32, Australian National University, Canberra, Australia, 1994. Available at: http://www.netlib.org/c/meschach/ and http://www.math.uiowa.edu/~dstewart/meschach/.
 
34
Z. Zhou, Y. S. Ong, P. B. Nair, A. J. Keane, and K. Y. Lum. Combining Global and Local Surrogate Models to Accelerate Evolutionary Optimization. IEEE Transactions on Systems, Man, and Cybernetics, 37(1):66--76, January 2007.
 
35


Collaborative Colleagues:
A.K.M. Khaled Ahsan Talukder: colleagues
Michael Kirley: colleagues
Rajkumar Buyya: colleagues