Professional Documents
Culture Documents
Logı́stica empresarial
Jorge Oyola
Universidad de Córdoba
Today’s plan
1 Routing problems
Routing problems
Jorge Oyola
Universidad de Córdoba
Milk collection.
Forest harvesting.
Distribution of soft drinks.
Shipping.
Livestock collection.
Movement of observation satellites.
Solid waste collection.
Beer distribution.
Jorge Oyola
Universidad de Córdoba
Undirected
Directed
Directed
The number of arcs entering and leaving each vertex must be equal.
Jorge Oyola
Universidad de Córdoba
Complexity
For comparison:
Some estimate the number of grains of sand on earth to be close to 70 · 1021 .
Some estimate the number of atoms in the observable universe to be close to 1080 .
Jorge Oyola TSP 15 / 24
TSP Methods
Jorge Oyola
Universidad de Córdoba
X X
min cij Xijk (1)
(i,j)∈A k∈K
subject to
X
X0jk ≤ 1, ∀k ∈ K (2)
j∈N
X X
Xijk = 1, ∀i ∈ N \0 (3)
j∈N k∈K
X X
Xijk = Xjik , ∀i ∈ N , k ∈ K (4)
j∈N j∈N
X
V0k = di Xijk , ∀k ∈ K (5)
(i,j)∈A
Complexity
References I
Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., and Semet,
F. (2002).
A guide to vehicle routing heuristics.
The Journal of the Operational Research Society, 53(5):512–522.
Dantzig, G. B. and Ramser, J. H. (1959).
The truck dispatching problem.
Management Science, 6(1):80–91.
Eiselt, H. A., Gendreau, M., and Laporte, G. (1995a).
Arc routing problems, part I: The chinese postman problem.
Operations Research, 43(2):231–242.
Eiselt, H. A., Gendreau, M., and Laporte, G. (1995b).
Arc routing problems, part II: The rural postman problem.
Operations Research, 43(3):399–414.
References II