Authors
Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
Publication date
2021/9/6
Book
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms
Pages
1-11
Description
Evolutionary algorithms based on edge assembly crossover (EAX) constitute some of the best performing incomplete solvers for the well-known traveling salesperson problem (TSP). Often, it is desirable to compute not just a single solution for a given problem, but a diverse set of high quality solutions from which a decision maker can choose one for implementation. Currently, there are only a few approaches for computing a diverse solution set for the TSP. Furthermore, almost all of them assume that the optimal solution is known. In this paper, we introduce evolutionary diversity optimisation (EDO) approaches for the TSP that find a diverse set of tours when the optimal tour is known or unknown. We show how to adopt EAX to not only find a high-quality solution but also to maximise the diversity of the population. The resulting EAX-based EDO approach, termed EAX-EDO is capable of obtaining diverse high-quality …
Total citations
202220232024737
Scholar articles
A Nikfarjam, J Bossek, A Neumann, F Neumann - Proceedings of the 16th ACM/SIGEVO Conference on …, 2021