Skip to main content
SpringerLink
Log in

Multiobjective Genetic Algorithms

  • Chapter
Network Models and Optimization

Part of the book series: Decision Engineering ((DECENGIN))

  • 3990 Accesses

Abstract

Many real-world problems from operations research (OR) / management science (MS) are very complex in nature and quite hard to solve by conventional optimization techniques. Since the 1960s there has been being an increasing interest in imitating living beings to solve such kinds of hard optimization problems. Simulating natural evolutionary processes of human beings results in stochastic optimization techniques called evolutionary algorithms (EAs) that can often outperform conventional optimization methods when applied to difficult real-world problems. EAs mostly involve metaheuristic optimization algorithms such as genetic algorithms (GA) [1, 2], evolutionary programming (EP) [3], evolution strategys (ES) [4, 5], genetic programming (GP) [6, 7], learning classifier systems (LCS) [8], swarm intelligence (comprising ant colony optimization (ACO) [9] and particle swarm optimization (PSO) [10, 11]). Among them, genetic algorithms are perhaps the most widely known type of evolutionary algorithms used today.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Holland, J. (1992). Adaptation in Natural and Artificial System, Ann Arbor: University of Michigan Press; 1975, MA: MIT Press.

    Google Scholar 

  2. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Reading, MA: Addison-Wesley.

    MATH  Google Scholar 

  3. Fogel, L., Owens, A. & Walsh, M. (1966). Artificial Intelligence through Simulated Evolution, New York: John Wiley & Sons.

    MATH  Google Scholar 

  4. Rechenberg, I. (1973). Optimieriung technischer Systeme nach Prinzipien der biologischen Evolution, Stuttgart: Frommann-Holzboog.

    Google Scholar 

  5. Schwefel, H. (1995). Evolution and Optimum Seeking, New York: Wiley & Sons.

    Google Scholar 

  6. Koza, J. R. (1992). Genetic Programming, Cambridge: MIT Press.

    MATH  Google Scholar 

  7. Koza, J. R. (1994). Genetic Programming II, Cambridge: MIT Press.

    MATH  Google Scholar 

  8. Holland, J. H. (1976). Adaptation. In R. Rosen & F. M. Snell, (eds) Progress in Theoretical Biology IV, 263–293. New York: Academic Press.

    Google Scholar 

  9. Dorigo, M. (1992) Optimization, Learning and Natural Algorithms, PhD thesis, Politecnico di Milano, Italy.

    Google Scholar 

  10. Kennedy, J. & Eberhart, R. (1995). Particle swarm optimization, Proceeding of the IEEE International Conference on Neural Networks, Piscataway, NJ, 1942–1948,

    Google Scholar 

  11. Kennedy, J. & Eberhart, R. C. (2001). Swarm Intelligence. Morgan Kaufmann.

    Google Scholar 

  12. Michalewicz, Z. (1994). Genetic Algorithm + Data Structures = Evolution Programs. New York: Springer-Verlag.

    Google Scholar 

  13. Bolc, L. & Cytowski, J. (1992). Search Methods for Artificial Intelligence, London: Academic Press.

    MATH  Google Scholar 

  14. Booker, L. (1987) Improving search in genetic algorithms, in Davis, L, ed. Genetic Algorithms and Simulated Annealing, Morgan Kaufmann Publishers, Los Altos, CA.

    Google Scholar 

  15. Gen, M. & Cheng, R. (1997). Genetic Algorithms and Engineering Design. New York: John Wiley & Sons.

    Google Scholar 

  16. Gen, M. & Cheng, R. (2000). Genetic Algorithms and Engineering Optimization. New York: John Wiley & Sons.

    Google Scholar 

  17. Grefenstette, J. J. (1991). Lamarkian learning in multi-agent environment, Proceedings of the 4th International Conference on Genetic Algorithms, San Francisco, Morgan Kaufman Publishers.

    Google Scholar 

  18. Davidor, Y. (1991). A genetic algorithm applied to robot trajectory generation, Davis, L., editor, Handbook of Genetic Algorithms, NewYork, Van Nostrand Reinhold.

    Google Scholar 

  19. Shaefer, C. (1987). The ARGOT strategy: adaptive representation genetic optimizer technique, Proceedings of the 2nd International conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, N, J.

    Google Scholar 

  20. Kennedy, S. (1993). Five ways to a smarter genetic algorithm, AI Expert, 35–38.

    Google Scholar 

  21. Whitley, D., Gordan, V. & Mathias, K. (1994). Lamarckian evolution, the Baldwin effect & function optimization, in Davidor, Y., Schwefel, H. & Männer, R., Editors, Parallel Problem Solving from Nature:PPSN III, Berlin, Springer-Verlag, 6–15.

    Google Scholar 

  22. Moscato, P. & Norman, M. (1992). A memetic approach for the traveling saleman problem: implementation of a computational ecology for combinatorial optimization on messagepassing systems, in Proceedings of the international conference on parallel computing & transputer applications, Amsterdam.

    Google Scholar 

  23. Dawkins, R. (1976). The Selfish Gene, Oxford, Oxford University Press.

    Google Scholar 

  24. Radcliffe, N. & Surry, P. (1994). Formal memetic algorithms, Fogarty, T., editor , Berlin, Evolutionary Computing, 1–16.

    Google Scholar 

  25. Raidl, G. R. & Julstrom, B. A. (2003). Edge Sets: An Effective Evolutionary Coding of Spanning Trees, IEEE Transactions on Evolutionary Computation, 7(3), 225–239.

    Article  Google Scholar 

  26. Kim, J. H. & Myung, H. (1996). A two-phase evolutionary programming for general constrained optimization problem, Proceeding of the 1st Annual Conference on Evolutionary Programming.

    Google Scholar 

  27. Michalewicz, Z. (1995). Genetic algorithms, numerical optimization, and constraints, in Eshelman, L. J. ed. Proceeding of the 6th International Conference on Genetic Algorithms, 135–155.

    Google Scholar 

  28. Myung, H. & Kim, J. H. (1996). Hybrid evolutionary programming for heavily constrained problems, Bio-Systems, 38, 29–43.

    Google Scholar 

  29. Orvosh, D. & Davis, L. (1994). Using a genetic algorithm to optimize problems with feasibility constraints, Proceeding of the 1st IEEE Conference on Evolutionary Computation, 548–552.

    Google Scholar 

  30. Michalewicz, Z. (1995). A survey of constraint handling techniques in evolutionary computation methods, in McDonnell et al. eds. Evolutionary Programming IV, MA: MIT Press.

    Google Scholar 

  31. Michalewicz, Z., Dasgupta, D., Riche, R. G. L. & Schoenauer, M. (1996). Evolutionary algorithms for constrained engineering problems, Computers and Industrial Engineering, 30(4), 851–870.

    Article  Google Scholar 

  32. Liepins, G., Hilliard, M., Richardson, J. & Pallmer, M. (1990). Genetic algorithm application to set covering and traveling salesman problems, in Brown ed. OR/AI: The Integration of Problem Solving Strategies.

    Google Scholar 

  33. Liepins, G. & Potter, W. (1991). A genetic algorithm approach to multiple faultdiagnosis, Davis ed. Handbook of Genetic Algorithms, New York: Van Nostrand Reinhold, 237–250.

    Google Scholar 

  34. Nakano, R. & Yamada, T. (1991). Conventional genetic algorithms for jo-shop problems, Proceeding of the 4th International Conference on Genetic Algorithms, 477–479.

    Google Scholar 

  35. Glover, F. & Greenberg, H. (1989). New approaches for heuristic search: a bilateral linkage with artificial intelligence, European Journal of Operational Research, 39, 19–130.

    Article  MathSciNet  Google Scholar 

  36. Herrera, F. & Lozano, M. (1996). Adaptation of Genetic Algorithm Parameters Based On Fuzzy Logic Controllers, in F. Herrera and J. Verdegay, editors, Genetic Algorithms and Soft Computing, Physica-Verlag, 95–125.

    Google Scholar 

  37. Hinterding, R., Michalewicz, Z. & Eiben, A. (1997). Adaptation in Evolutionary Computation: A Survey, Proceeding of IEEE International Conference on Evolutionary Computation, Piscataway, NJ, 65–69.

    Google Scholar 

  38. Rechenberg, I. (1973). Optimieriung technischer Systeme nach Prinzipien der biologischen Evolution, Stuttgart: Frommann-Holzboog.

    Google Scholar 

  39. Davis, L. editor, (1991). Handbook of Genetic Algorithms, New York: Van Nostrand Reinhold.

    Google Scholar 

  40. Julstrom, B. (1995). What Have You Done For Me Lately Adapting Operator Probabilities in A Steady-state Genetic Algorithm, Proceeding 6th International Conference on GAs, San Francisco, 81–87.

    Google Scholar 

  41. Subbu, R., Sanderson, A. C. & Bonissone, P. P. (1999). Fuzzy Logic Controlled Genetic Algorithms versus Tuned Genetic Algorithms: an Agile Manufacturing Application, Proceeding of IEEE International Symposium on Intelligent Control (ISIC), 434–440.

    Google Scholar 

  42. Song, Y. H., Wang, G. S., Wang, P. T. & Johns, A. T. (1997). Environmental/Economic dispatch using fuzzy logic controlled genetic algorithms, IEEE Proceeding on Generation, Transmission and Distribution, 144(4), 377–382.

    Article  Google Scholar 

  43. Cheong, F. & Lai, R. (2000). Constraining the optimization of a fuzzy logic controller using an enhanced genetic algorithm, IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics, 30(1), 31–46.

    Article  Google Scholar 

  44. Yun, Y. S. & Gen, M. (2003). Performance analysis of adaptive genetic algorithms with fuzzy logic and heuristics, Fuzzy Optimization and Decision Making, 2(2), 161–175.

    Article  MathSciNet  Google Scholar 

  45. Koumousis, V. K. & Katsaras, C. P. (2006). A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance, IEEE Transactions on Evolutionary Computation, 10(1), 19–28.

    Article  Google Scholar 

  46. Lin, L. & Gen, M. Auto-tuning strategy for evolutionary algorithms: balancing between exploration and exploitation, Soft Computing, In press.

    Google Scholar 

  47. Moed, M. C., Stewart, C. V. & Kelly, R. B. (1991). Peducing the search time of a steady state genetic algorithm using the immigration operator, Proceeding IEEE International Conference Tools for AI, 500–501.

    Google Scholar 

  48. Dev, K. (1995). Optimization for Engineering Design: Algorithms and Examples, New Delhi: Prentice-Hall.

    Google Scholar 

  49. Steuer, R. E. (1986). Multiple Criteria Optimization: Theory, Computation, and Application,New York: John Wiley & Sons.

    MATH  Google Scholar 

  50. Hwang, C. & Yoon, K. (1981). Multiple Attribute Decision Making: Methods and Applications, Berlin: Springer-Verlage.

    MATH  Google Scholar 

  51. Pareto, V. (1971). Manuale di Econ`omica Pol`ıttica, Società Editrice Libràia, Milan, Italy, 1906; translated into English by A. S. Schwier, as Manual of Political Economy, New York: Macmillan.

    Google Scholar 

  52. Schaffer, J. D. (1985). Multiple objective optimization with vector evaluated genetic algorithms, Proceeding 1st International Conference on GAs, 93–100.

    Google Scholar 

  53. Fonseca, C. & Fleming, P. (1993). Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization, Proceeding 5th International Conference on GAs, 416–423.

    Google Scholar 

  54. Srinivas, N. & Deb, K. (1995). Multiobjective Function Optimization Using Nondominated Sorting Genetic Algorithms, Evolutionary Computation, 3, 221–248.

    Google Scholar 

  55. Ishibuchi, H. & Murata, T. (1998). A multiobjective genetic local search algorithm and its application to flowshop scheduling, IEEE Transactions on Systems, Man, and Cybernetics, 28(3), 392–403.

    Article  Google Scholar 

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

    Article  Google Scholar 

  57. Zitzler, E., Laumanns, M. & Thiele, L. (2002) SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. Proceedings of the EUROGEN Conference, 95–100.

    Google Scholar 

  58. Deb, K. (2001). Multiobjective Optimization Using Evolutionary Algorithms, Chichester: Wiley.

    Google Scholar 

  59. Deb, K., Pratap, A., Agarwal, S . & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, 6(2), 182– 197.

    Article  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer London

About this chapter

Cite this chapter

(2008). Multiobjective Genetic Algorithms. In: Network Models and Optimization. Decision Engineering. Springer, London. https://doi.org/10.1007/978-1-84800-181-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-84800-181-7_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84800-180-0

  • Online ISBN: 978-1-84800-181-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation