Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Evolutionary Multi-Objective Diversity Optimization (2401.07454v1)

Published 15 Jan 2024 in cs.NE

Abstract: Creating diverse sets of high quality solutions has become an important problem in recent years. Previous works on diverse solutions problems consider solutions' objective quality and diversity where one is regarded as the optimization goal and the other as the constraint. In this paper, we treat this problem as a bi-objective optimization problem, which is to obtain a range of quality-diversity trade-offs. To address this problem, we frame the evolutionary process as evolving a population of populations, and present a suitable general implementation scheme that is compatible with existing evolutionary multi-objective search methods. We realize the scheme in NSGA-II and SPEA2, and test the methods on various instances of maximum coverage, maximum cut and minimum vertex cover problems. The resulting non-dominated populations exhibit rich qualitative features, giving insights into the optimization instances and the quality-diversity trade-offs they induce.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (50)
  1. Evolution of artistic image variants through feature based diversity optimisation. In GECCO, pages 171–178, New York, NY, USA, 2017. ACM.
  2. Diversity in kemeny rank aggregation: A parameterized approach. In IJCAI, pages 10–16. International Joint Conferences on Artificial Intelligence Organization, Aug. 2021.
  3. Performance indicators in multiobjective optimization. European Journal of Operational Research, 292(2):397–422, July 2021.
  4. Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artificial Intelligence, 303:103644, Feb. 2022.
  5. BHOSLIB. Benchmarks with hidden optimum solutions for graph problems, 2004.
  6. Evolving diverse TSP instances by means of novel and creative mutation operators. In FOGA '19, pages 58–71, New York, NY, USA, 2019. ACM Press.
  7. Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. In GECCO, pages 556–564, New York, NY, USA, June 2021. ACM.
  8. J. Bossek and F. Neumann. Evolutionary diversity optimization and the minimum spanning tree problem. In GECCO, pages 198–206, New York, NY, USA, June 2021. ACM.
  9. J. Branke. Creating robust solutions by means of evolutionary algorithms, page 119–128. Springer Berlin Heidelberg, 1998.
  10. Generating multiple solutions for mixed integer programming problems. In IPCO, pages 280–294. Springer Berlin Heidelberg, Berlin, Heidelberg, 2007.
  11. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182–197, Apr. 2002.
  12. Analysis of evolutionary diversity optimization for permutation problems. ACM Transactions on Evolutionary Learning and Optimization, 2(3):1–27, Sept. 2022.
  13. jMetal: A java framework for multi-objective optimization. Advances in Engineering Software, 42(10):760–771, Oct. 2011.
  14. Finding similar or diverse solutions in answer set programming. In Logic Programming, pages 342–356. Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.
  15. E. Erkut. The discrete p-dispersion problem. European Journal of Operational Research, 46(1):48–60, May 1990.
  16. Diverse pairs of matchings. In ISAAC, pages 26:1–26:12, Dagstuhl, Germany, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  17. Diverse collections in matroids and graphs. In STACS, pages 31:1–31:14, Dagstuhl, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  18. Feature-based diversity optimization for problem instance classification. Evolutionary Computation, 29(1):107–128, Mar. 2021.
  19. Scatter search to generate diverse MIP solutions. In Operations Research/Computer Science Interfaces Series, pages 299–317. Springer US, Boston, MA, 2000.
  20. A framework to design approximation algorithms for finding diverse solutions in combinatorial problems. In AAAI 2022, pages 3758–3766. AAAI Press, 2022.
  21. Computing diverse shortest paths efficiently: A theoretical and experimental study. Proceedings of the AAAI Conference on Artificial Intelligence, 36(4):3758–3766, June 2022.
  22. Finding diverse trees, paths, and more. In AAAI 2021, volume 35, pages 3778–3786. AAAI Press, May 2021.
  23. Diversified top-k maximal clique detection in social internet of things. Future Generation Computer Systems, 107:408–417, June 2020.
  24. Finding diverse and similar solutions in constraint programming. In AAAI, pages 372–377. AAAI Press / The MIT Press, 2005.
  25. Modelling diversity of solutions. Proceedings of the AAAI Conference on Artificial Intelligence, 34(02):1528–1535, Apr. 2020.
  26. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993. American Mathematical Society, USA, 1996.
  27. Automated algorithm selection: Survey and perspectives. Evolutionary Computation, 27(1):3–45, Mar. 2019.
  28. A. Nadel. Generating diverse solutions in SAT. In SAT, volume 6695 of Lecture Notes in Computer Science, pages 287–301. Springer Berlin Heidelberg, Berlin, Heidelberg, 2011.
  29. Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. In GECCO, pages 261–269, New York, NY, USA, June 2021. ACM.
  30. Discrepancy-based evolutionary diversity optimization. In GECCO, pages 991–998, New York, NY, USA, July 2018. ACM.
  31. Evolutionary diversity optimization using multi-objective indicators. In GECCO, pages 837–845, New York, NY, USA, July 2019. ACM.
  32. Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. In FOGA '21, New York, NY, USA, Sept. 2021. ACM.
  33. Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. In GECCO, pages 600–608, New York, NY, USA, June 2021. ACM.
  34. Improving Cluster Oriented Genetic Algorithms for High-performance Region Identification, page 189–202. Springer London, 2002.
  35. Hybrid evolutionary algorithms on minimum vertex cover for random graphs. In GECCO, pages 547–554, New York, NY, USA, July 2007. ACM.
  36. T. Petit and A. C. Trapp. Finding diverse solutions of high quality to constraint optimization problems. In IJCAI, IJCAI’15, pages 260––266. AAAI Press, 2015.
  37. S. Ronald. Finding multiple solutions with an evolutionary algorithm. In Proceedings of 1995 IEEE International Conference on Evolutionary Computation, volume 2, pages 641–646. IEEE, 1995.
  38. Guaranteed diversity & quality for the weighted CSP. In ICTAI, pages 18–25. IEEE, Nov. 2019.
  39. P. Schittekat and K. Sörensen. Supporting 3pl decisions in the automotive industry by generating diverse solutions to a large-scale location-routing problem. Operations Research, 57(5):1058–1067, 2009.
  40. Finding diverse optima and near-optima to binary integer programs. IIE Transactions, 47(11):1300–1312, Apr. 2015.
  41. S. Tsutsui and A. Ghosh. Genetic algorithms with a robust solution searching scheme. IEEE Transactions on Evolutionary Computation, 1(3):201–208, 1997.
  42. Integrating decision space diversity into hypervolume-based multiobjective search. In GECCO, pages 455–462, New York, NY, USA, 2010. ACM Press.
  43. T. Ulrich and L. Thiele. Maximizing population diversity in single-objective optimization. In GECCO, pages 641–648, New York, NY, USA, 2011. ACM Press.
  44. D. Wang and Y.-S. Kuo. A study on two geometric location problems. Information Processing Letters, 28(6):281–286, Aug. 1988.
  45. Redundancy-aware maximal cliques. In Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD ’13, pages 122–130. ACM, Aug. 2013.
  46. Y. Ye. Gset max-cut problem set, 2003.
  47. Diversified top-k clique search. The VLDB Journal, 25(2):171–196, Oct. 2015.
  48. An evolutionary algorithm to generate alternatives (eaga) for engineering optimization problems. Engineering Optimization, 36(5):539–553, Oct. 2004.
  49. Generating alternatives using evolutionary algorithms for water resources and environmental management problems. Journal of Water Resources Planning and Management, 133(2):156–165, Mar. 2007.
  50. Spea2: Improving the strength pareto evolutionary algorithm. Technical report, 2001.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now