• Aucun résultat trouvé

Algorithms for the on-line quota traveling salesman problem

N/A
N/A
Protected

Academic year: 2021

Partager "Algorithms for the on-line quota traveling salesman problem"

Copied!
11
0
0

Texte intégral

Loading

Figure

Fig. 1. A graphical example of the lower bound for general metric spaces. The plain line on the left is the tour of the optimal server, while the dashed line is the tour of the on-line server

Références

Documents relatifs

We suppose that we know that the solutions of the planar isoperimetric problem are circles. We consider a very old variant of this problem called Dido’s problem [18]. It is related

A NEW HEURISTIC FOR THE TRAVELING SALESMAN PROBLEM 251 Though simulated annealing [4] gives good results, it seems that the best heuristic for the symmetrie TSP is the one of Lin

Keywords : Traveling salesman problem; heuristic algorithm; performance bound; degree of asymmetry; subgradient

We prove that the Christofides algorithm gives a | approx- imation ratio for the special case of traveling salesman problem (TSP) in which the maximum weight in the given graph is

We first prove that the minimum and maximum traveling salesman prob- lems, their metric versions as well as some versions defined on parameterized triangle inequalities

A branch-and-cut algorithm for the generalized traveling salesman problem with time windows.. Yuan Yuan, Diego Cattaruzza, Maxime Ogier,

A branch-and-cut algorithm for the generalized traveling salesman problem with time windows.. Yuan Yuan, Diego Cattaruzza, Maxime Ogier,

Genetic algorithms are a revolutionary technique which used operators like mutation, crossover and selection in resolving optimization problems.. They have been used