Lexicographically minimizing axial motions for the Euclidean TSP

Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : A variant of the Euclidean traveling salesman problem (TSP) is defined and studied. In the three-dimensional space, the objective function is to lexicographically minimize the x-moves, then the y-moves and finally the z-moves. The 2D and 3D cases are first studied and solved as a shortest path problem. Then the approach is generalized to the d-dimensional case.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185192
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 11:59:35 AM
Last modification on : Saturday, December 15, 2018 - 1:28:46 AM

Links full text

Identifiers

Collections

Citation

Francis Sourd. Lexicographically minimizing axial motions for the Euclidean TSP. Journal of Combinatorial Optimization, Springer Verlag, 2010, 19 (1), pp.1-15. 〈10.1007/s10878-008-9154-0〉. 〈hal-01185192〉

Share

Metrics

Record views

56