Skip to main content

Solving Multi-objective Optimisation Problems Using the Potential Pareto Regions Evolutionary Algorithm

  • Conference paper
Parallel Problem Solving from Nature - PPSN IX (PPSN 2006)

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

Included in the following conference series:

Abstract

In this paper we propose a novel multi-objective evolutionary algorithm that we call Potential Pareto Regions Evolutionary Algorithm (PPREA). Unlike state-of-the-art algorithms, which use a fitness assignment method based on Pareto ranking, the approach adopted in this work is new. The fitness of an individual is equal to the least improvement needed by that individual in order to reach non-dominance status.

This new algorithm is compared against the Nondominated Sorting Genetic Algorithm (NSGA-II) on a set of test suite problems derived from the works of researchers from MOEA community.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2001)

    Article  Google Scholar 

  2. Burke, E.K., Landa Silva, J.D.: The influence of the Fitness Evaluation Method on the Performance of Multiobjctive Optimisers. European Journal of Operational Research 169(3), 875–897 (2006)

    Article  MathSciNet  Google Scholar 

  3. Burke, E.K., Landa Silva, J.D., Soubeiga, E.: Multi-objective Hyper-heuristic Approaches for Space Allocation and Timetabling. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Meta-heuristics: Progress as Real Problem Solvers, pp. 129–158. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Burke, E.K., Bykov, Y., Petrovic, S.: A Multi-Criteria Approach to Examination Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 118–131. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Hallam, N.: State-of-the-art Multi-Objective Evolutionary Algorithms: Diversity Preservation and Archive Update Analysis, and Proposal of a New Evolutionary Algorithm, PhD thesis submitted to the University of Nottingham (2005)

    Google Scholar 

  6. Hallam, N., Blanchfield, P., Kendall, G.: Handling Diversity in Evolutionary Multiobjective Optimisation. In: Proceedings of 2005 IEEE Congress on Evolutionary Computation (CEC 2005), Edinburgh, Scotland, pp. 2233–2240 (2005)

    Google Scholar 

  7. Landa Silva, J.D., Burke, E.K., Petrovic, S.: An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling. In: Gandibleux, X., Sevaux, M., Sorensen, K., T’Kindt, V. (eds.) MetaHeuristics for Multiobjective Optimisation. Springer Lecture Notes in Economics and Mathematical Systems, vol. 535, pp. 91–129. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3(4), 257–271 (1999)

    Article  Google Scholar 

  9. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm. Technical report, Swiss Federal Institute of Technology (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hallam, N., Kendall, G., Blanchfield, P. (2006). Solving Multi-objective Optimisation Problems Using the Potential Pareto Regions Evolutionary Algorithm. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_51

Download citation

  • DOI: https://doi.org/10.1007/11844297_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38990-3

  • Online ISBN: 978-3-540-38991-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics