Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
Dennis Weyland, Leonora Bianchi, Luca Maria Gambar...
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...