activity
20202024
most citedEvolving Diverse Sets of Tours for the Travelling Salesperson Problem

27 citations · 69 across the 11 of their papers we have counts for

collaborators
Showing cs.NEShow all

7 papers · 1 filter

cs.NE2024★ 1 cited

Evolutionary Multi-Objective Diversity Optimization

Anh Viet Do, Mingyu Guo, Aneta Neumann +1

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…

cs.NE2022

Analysis of Quality Diversity Algorithms for the Knapsack Problem

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. They aim to maxi…

cs.NE2022★ 6 cited

Niching-based Evolutionary Diversity Optimization for the Traveling Salesperson Problem

Anh Viet Do, Mingyu Guo, Aneta Neumann +1

In this work, we consider the problem of finding a set of tours to a traveling salesperson problem (TSP) instance maximizing diversity, while satisfying a given cost constraint. Th…

cs.NE2021★ 19 cited

Analysis of Evolutionary Diversity Optimisation for Permutation Problems

Anh Viet Do, Mingyu Guo, Aneta Neumann +1

Generating diverse populations of high quality solutions has gained interest as a promising extension to the traditional optimization tasks. This work contributes to this line of r…

cs.NE2020

Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints

Anh Viet Do, Frank Neumann

In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynam…

cs.NE2020★ 8 cited

Maximizing Submodular or Monotone Functions under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms

Anh Viet Do, Frank Neumann

Many important problems can be regarded as maximizing submodular functions under some constraints. A simple multi-objective evolutionary algorithm called GSEMO has been shown to ac…

cs.NE2020★ 27 cited

Evolving Diverse Sets of Tours for the Travelling Salesperson Problem

Anh Viet Do, Jakob Bossek, Aneta Neumann +1

Evolving diverse sets of high quality solutions has gained increasing interest in the evolutionary computation literature in recent years. With this paper, we contribute to this ar…