Neumann, A.Gounder, S.Yan, X.Sherman, G.Campbell, B.Guo, M.Neumann, F.Paquete, L.2023-08-302023-08-302023Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '23), 2023 / Paquete, L. (ed./s), pp.1436-14449798400701191https://hdl.handle.net/2440/139310In recent years, computing diverse sets of high quality solutions for an optimization problem has become an important topic. The goal of computing diverse sets of high quality solutions is to provide a variety of options to decision makers, allowing them to choose the best solution for their particular problem. We consider the problem of constructing a wireless communication network for a given set of entities. Our goal is to minimize the area covered by the senders' transmissions while also avoiding adversaries that may observe the communication. We provide evolutionary diversity optimization (EDO) algorithms for this problem. We provide a formulation based on minimum spanning forests that are used as a representation and show how this formulation can be turned into a wireless communication network that avoids a given set of adversaries. We evaluate our EDO approach based on a number of benchmark instances and compare the diversity of the obtained populations in respect to the quality criterion of the given solutions as well as the chosen algorithm parameters. Our results demonstrate the effectiveness of our EDO approaches for the detection and concealment of communication networks both in terms of the quality and the diversity of the obtained solutions.en© 2023 by the Association for Computing Machinery, Inc. (ACM).Evolutionary Diversity Optimization; Quality Diversity; Minimum Area Spanning Tree; Low Probability DetectionConference paper10.1145/3583131.35904052023-08-29649338Neumann, A. [0000-0002-0036-4782]Yan, X. [0000-0002-2309-8034]Guo, M. [0000-0002-3478-9201]Neumann, F. [0000-0002-2721-3618]