25 citations · 44 across the 8 of their papers we have counts for
3 papers · 1 filter
On the Use of Quality Diversity Algorithms for The Traveling Thief Problem
Adel Nikfarjam, Aneta Neumann, Frank Neumann
In real-world optimisation, it is common to face several sub-problems interacting and forming the main problem. There is an inter-dependency between the sub-problems, making it imp…
Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation
Adel Nikfarjam, Jakob Bossek, Aneta Neumann +1
Evolutionary algorithms based on edge assembly crossover (EAX) constitute some of the best performing incomplete solvers for the well-known traveling salesperson problem (TSP). Oft…
Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem
Adel Nikfarjam, Jakob Bossek, Aneta Neumann +1
Computing diverse sets of high-quality solutions has gained increasing attention among the evolutionary computation community in recent years. It allows practitioners to choose fro…