Skip to main content
SpringerLink
Log in

Performance of Multiple Objective Evolutionary Algorithms on a Distribution System Design Problem - Computational Experiment

  • Conference paper
  • First Online:
Evolutionary Multi-Criterion Optimization (EMO 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1993))

Included in the following conference series:

Abstract

The paper presents a comparative experiment with four multiple objective evolutionary algorithms on a real life combinatorial optimization problem. The test problem corresponds to the design of a distribution system. The experiment compares performance of a Pareto ranking based multiple objective genetic algorithm (Pareto GA), multiple objective multiple start local search (MOMSLS), multiple objective genetic local search (MOGLS) and an extension of Pareto GA involving local search (Pareto GLS). The results of the experiment clearly indicate that the methods hybridizing recombination and local search operators by far outperform methods that use one of the operators alone. Furthermore, MOGLS outperforms Pareto GLS.

This work has been supported by KBN grant No. 8T11F00619.

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

Access this chapter

Log in via an institution
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. Ackley D. H. A connectionist machine for genetic hillclimbing. Kluwer Academic Press, Boston, 1987.

    Google Scholar 

  2. Galinier P., Hao J.-K. Hybrid evolutionary algorithms for graph coloring. Technical Report, Parc Scientifique Georges Besse, Nimes, 1999.

    Google Scholar 

  3. Fonseca C.M., Fleming P.J. (1993), Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In S. Forrest (Ed.), Genetic Algorithms: Proceedings of 5th International Conference, San Mateo, CA, Morgan Kaufmann, 416–423.

    Google Scholar 

  4. Goldberg D.E. Genetic algorithms for search, optimization, and machine learning. Reading, MA, Addison-Wesley, 1989.

    Google Scholar 

  5. Hansen P.H, Jaszkiewicz A. Evaluating quality of approximations to the non-dominated set. Technical Report, Department of Mathematical Modelling, Technical University of Denmark, IMM-REP-1998-7, 1998.

    Google Scholar 

  6. Ishibuchi H. Murata T. Multi-Objective Genetic Local Search Algorithm and Its Application to Flowship Scheduling. IEEE Transactions on Systems, Man and Cybernetics, 28, 3, 392–403, 1998.

    Article  Google Scholar 

  7. Jaszkiewicz A. Genetic local search for multiple objective combinatorial optimization, Technical Report RA-014/98, Institute of Computing Science, Poznan University of Technology, 1998

    Google Scholar 

  8. Jaszkiewicz A. On the performance of multiple objective genetic local search on the 0/1 knapsack problem. A comparative experiment. Submitted to IEEE Transactions on Evolutionary Computation.

    Google Scholar 

  9. Knowles J.D., Corne D.W. A Comparison of Diverse Approaches to Memetic Multiobjective Combinatorial Optimization, In Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pages 103–108, Las Vegas, Nevada, July 2000.

    Google Scholar 

  10. Merz P., Freisleben B., Genetic Local Search for the TSP: New Results, In Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, IEEE Press, pp. 159–164, 1997.

    Google Scholar 

  11. Steuer R.E. Multiple Criteria Optimization-Theory, Computation and Application, Wiley, New York, 1986.

    MATH  Google Scholar 

  12. Ulungu E.L., Teghem J., Fortemps Ph., Tuyttens D.. MOSA method: a tool for solving multiobjective combinatorial optimization problems. Journal of Multi-Criteria Decision Analysis, 8, 221–236, 1999.

    Article  MATH  Google Scholar 

  13. Taillard É. D. Comparison of iterative searches for the quadratic assignment problem, Location science, 3, 87–105, 1995.

    MATH  Google Scholar 

  14. Van Veldhuizen D.A. (1999). Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations. PhD thesis, Department of Electrical and Computer Engineering. Graduate School of Engineering. Air Force Institute of Technology, Wright-Patterson AFB, Ohio, May 1999.

    Google Scholar 

  15. Zitzler E., Thiele L. Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach, IEEE Transactions on Evolutionary Computation, Vol. 3, No. 4, pp. 257–271, November, 1999.

    Article  Google Scholar 

  16. www-idss.cs.put.poznan.pl./~jaszkiewicz/MOEALib

  17. www.lania.mx/~ccoello/EMOO/EMOObib.html

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Science, Poznań University of Technology ul, Piotrowo 3a, 60-965, Poznań, poland

    Andrzej Jaszkiewicz, Maciej Hapke & Paweł Kominek

Authors
  1. Andrzej Jaszkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maciej Hapke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paweł Kominek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering Computer Engineering and Networks Laboratory, Swiss Federal Institute of Technology, ETH Zentrum, Gloriastrasse 35, 8092, Zurich, Switzerland

    Eckart Zitzler  & Lothar Thiele  & 

  2. Department of Mechanical Engineering Kanpur Genetic Algorithms Laboratory, Indian Institute of Technology, UP 208 016, Kanpur, India

    Kalyanmoy Deb

  3. Electrical Engineering Department,Computer Science Section Av.Instituto Politecnico Nacional No.2508, CINVESTAV-IPN, Col.San Pedro Zacatenco, 07300, Mexico City, Mexico

    Carlos Artemio Coello Coello

  4. Department of Computer Science, University of Reading, P.O.Box 225, Reading RG6 6AY, Whiteknights, UK

    David Corne

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jaszkiewicz, A., Hapke, M., Kominek, P. (2001). Performance of Multiple Objective Evolutionary Algorithms on a Distribution System Design Problem - Computational Experiment. In: Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A., Corne, D. (eds) Evolutionary Multi-Criterion Optimization. EMO 2001. Lecture Notes in Computer Science, vol 1993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44719-9_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-44719-9_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44719-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation