Skip to main content

FastPGA: A Dynamic Population Sizing Approach for Solving Expensive Multiobjective Optimization Problems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4403))

Abstract

We present a new multiobjective evolutionary algorithm (MOEA), called fast Pareto genetic algorithm (FastPGA). FastPGA uses a new fitness assignment and ranking strategy for the simultaneous optimization of multiple objectives where each solution evaluation is computationally- and/or financially-expensive. This is often the case when there are time or resource constraints involved in finding a solution. A population regulation operator is introduced to dynamically adapt the population size as needed up to a user-specified maximum population size. Computational results for a number of well-known test problems indicate that FastPGA is a promising approach. FastPGA outperforms the improved nondominated sorting genetic algorithm (NSGA-II) within a relatively small number of solution evaluations.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Coello, C.A.C., Lamont, G.B.: Applications of Multi-Objective Evolutionary Algorithms. World Scientific, Singapore (2004)

    MATH  Google Scholar 

  2. Coello, C.A.C., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems, 1st edn. Kluwer Academic Publishers, New York (2002)

    MATH  Google Scholar 

  3. Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms, 1st edn. John Wiley & Sons, Chichester (2001)

    MATH  Google Scholar 

  4. Deb, K., Pratap, A., Agarval, S., Meyarivan, T.A.: Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computing 6, 182–197 (2002)

    Article  Google Scholar 

  5. Deb, K., Mohan, M., Mishra, S.: Evaluating the epsilon-Domination Based Multi-Objective Evolutionary Algorithm for a Quick Computation of Pareto-Optimal Solutions. Evolutionary Computation 13(4), 501–525 (2005)

    Article  Google Scholar 

  6. Goldberg, D.E.: Genetic Algorithms in Search, Optimisation and Machine Learning. Addison-Wesley, Reading (1989)

    Google Scholar 

  7. Knowles, J.: ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Transactions on Evolutionary Computation 10(1), 50–66 (2006)

    Article  Google Scholar 

  8. Knowles, J., Corne, D.: The Pareto Archived Evolution Strategy: A New Baseline Algorithm for Multiobjective Optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation (CEC’1999), Washington, D.C, July, pp. 98–105. IEEE Computer Society Press, Los Alamitos (1999)

    Chapter  Google Scholar 

  9. Tan, K.C., Lee, T.H., Khor, E.F.: Evolutionary algorithm with dynamic population size and local exploration for multi-objective optimization, IEEE Transactions on Evolutionary Computation 5(6), 565–588 (2001)

    Article  Google Scholar 

  10. Van Veldhuizen, D.A., Lamont, G.B.: Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art. Evolutionary Computation 7(3), 1–26 (2000)

    Google Scholar 

  11. Van Veldhuizen, D.A., Lamont, G.B.: On Measuring Multiobjective Evolutionary Algorithm Performance. In: IEEE Congress on Evolutionary Computation, vol. 1, pp. 204–211. IEEE, Los Alamitos (2000)

    Google Scholar 

  12. Yen, G.G., Lu, H.: Dynamic multiobjective evolutionary algorithm: adaptive cell-based rank and density estimation. IEEE Transactions on Evolutionary Computations 7(3), 253–274 (2003)

    Article  Google Scholar 

  13. Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Study and Strength Pareto Approach. IEEE Transactions on Evolutionary Computation 3(4), 257–271 (1999)

    Article  Google Scholar 

  14. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland (2001)

    Google Scholar 

  15. Zitzler, E., Deb, K., Thiele, L.: Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation 8(2), 173–195 (2000)

    Article  Google Scholar 

  16. Zydallis, J.B., Van Veldhuizen, D.A., Lamont, G.B.: A Statistical Comparison of Multiobjective Evolutionary Algorithms Including the MOMGA-II. In: First International Conference on Evolutionary Multi-Criterion Optimization, pp. 226–240 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Shigeru Obayashi Kalyanmoy Deb Carlo Poloni Tomoyuki Hiroyasu Tadahiko Murata

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Eskandari, H., Geiger, C.D., Lamont, G.B. (2007). FastPGA: A Dynamic Population Sizing Approach for Solving Expensive Multiobjective Optimization Problems. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds) Evolutionary Multi-Criterion Optimization. EMO 2007. Lecture Notes in Computer Science, vol 4403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70928-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70928-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70927-5

  • Online ISBN: 978-3-540-70928-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics