no code implementations • 19 May 2023 • Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich
In this study, we introduce evolutionary algorithms (EAs) employing a well-known SAT solver to maximise diversity among a set of SAT solutions explicitly.
no code implementations • 28 Jul 2022 • Adel Nikfarjam, Amirhossein Moosavi, Aneta Neumann, Frank Neumann
Diversification in a set of solutions has become a hot research topic in the evolutionary computation community.
no code implementations • 28 Jul 2022 • Adel Nikfarjam, Anh Viet Do, Frank Neumann
Quality diversity (QD) algorithms have been shown to be very successful when dealing with problems in areas such as robotics, games and combinatorial optimization.
no code implementations • 28 Jul 2022 • Adel Nikfarjam, Aneta Neumann, Jakob Bossek, Frank Neumann
Recently different evolutionary computation approaches have been developed that generate sets of high quality diverse solutions for a given optimisation problem.
no code implementations • 6 Apr 2022 • Adel Nikfarjam, Aneta Neumann, Frank Neumann
There has been a growing interest in the evolutionary computation community to compute a diverse set of high-quality solutions for a given optimisation problem.
no code implementations • 16 Dec 2021 • Adel Nikfarjam, Aneta Neumann, Frank Neumann
In real-world optimisation, it is common to face several sub-problems interacting and forming the main problem.
no code implementations • 11 Aug 2021 • Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
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.
no code implementations • 28 Apr 2021 • Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
Computing diverse sets of high-quality solutions has gained increasing attention among the evolutionary computation community in recent years.