Skip to main content

Towards Multi-objective Co-evolutionary Problem Solving

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

Abstract

Co-evolutionary algorithms deal with two co-evolving populations, each having its own objectives. The linking of the two populations comes from the fact that the evaluation of the objective of a member of the first population requires a companion member from the second population, and vice versa. These algorithms are of great interest in cooperative and competing games and search tasks in which multiple agents having different interests are in play. While there have been significant studies devoted to single-objective co-evolutionary optimization algorithms and applications, they have not been paid much attention when each population must be evolved for more than one conflicting objectives. In this paper, we propose a multi-objective co-evolutionary (MOCoEv) algorithm and present its working on two interesting problems. This proof-of-principle study suggests that the presence of multiple Pareto solutions for each population and the ensuing multi-criterion decision-making complexities make the MOCoEv research and application be challenging. This paper should spur immediate further attention to multi-objective co-evolutionary problem solving studies.

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 EPUB and 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

References

  1. Barbosa, H.J.C.: A genetic algorithm for min-max problems. In: Proceedings of the First International Conference on Evolutionary Computation and Its Application (EvCA 1996), pp. 99–109 (1996)

    Google Scholar 

  2. Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)

    MATH  Google Scholar 

  3. Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115–148 (1995)

    MathSciNet  MATH  Google Scholar 

  4. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  5. Eisenstadt, E., Moshaiov, A.: Decision-making in non-cooperative games with conflicting self-objectives. J. Multi-Criteria Decis. Anal. 25(5–6), 130–141 (2018)

    Article  Google Scholar 

  6. Eisenstadt, E., Moshaiov, A., Avigad, G.: Co-evolution of strategies for multi-objective games under postponed objective preferences. In: 2015 IEEE Conference on Computational Intelligence and Games (CIG), pp. 461–468. IEEE (2015)

    Google Scholar 

  7. Eisenstadt-Matalon, E., Avigad, G., Moshaiov, A., Branke, J.: Rationalizable strategies in multi-objective games under undecided objective preferences (2016)

    Google Scholar 

  8. Eisenstadt-Matalon, E., Moshaiov, A.: Mutual rationalizability in vector-payoff games. In: Deb, K., et al. (eds.) EMO 2019. LNCS, vol. 11411, pp. 593–604. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-12598-1_47

    Chapter  Google Scholar 

  9. Goodfellow, I., et al.: Generative adversarial nets. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N.D., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 27, pp. 2672–2680. Curran Associates (2014)

    Google Scholar 

  10. Li, X., Yao, X.: Cooperatively coevolving particle swarms for large scale optimization. IEEE Trans. Evol. Comput. 16(2), 210–224 (2012)

    Article  Google Scholar 

  11. Matalon-Eisenstadt, E., Moshaiov, A., Avigad, G.: The competing travelling salespersons problem under multi-criteria. In: Handl, J., Hart, E., Lewis, P.R., López-Ibáñez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 463–472. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45823-6_43

    Chapter  Google Scholar 

  12. Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer, Boston (1999)

    MATH  Google Scholar 

  13. Nguyen, A., Yosinski, J., Clune, J.: Deep neural networks are easily fooled: high confidence predictions for unrecognizable images. In: IEEE Conference on Computer Vision and Pattern Recognition (2015)

    Google Scholar 

  14. Paredis, J.: Coevolutionary constraint satisfaction. In: Parallel Problem Solving from Nature III (PPSN-III), pp. 46–55 (1994)

    Google Scholar 

  15. Żychowski, A., Gupta, A., Mańdziuk, J., Ong, Y.S.: Addressing expensive multi-objective games with postponed preference articulation via memetic co-evolution. Knowl.-Based Syst. 154, 17–31 (2018)

    Article  Google Scholar 

Download references

Acknowledgments

Authors acknowledge the Facebook Research Award for conducting this study.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anirudh Suresh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Suresh, A., Deb, K., Boddeti, V.N. (2021). Towards Multi-objective Co-evolutionary Problem Solving. In: Ishibuchi, H., et al. Evolutionary Multi-Criterion Optimization. EMO 2021. Lecture Notes in Computer Science(), vol 12654. Springer, Cham. https://doi.org/10.1007/978-3-030-72062-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-72062-9_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-72061-2

  • Online ISBN: 978-3-030-72062-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics