The effect of the asymmetry of road transportation networks on the traveling salesman problem

Authors:
Alejandro Rodríguez;Rubén Ruiz
Affiliations:
Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática, Universitat Politècnica de València, Pza. Ferrándiz Carbonell 2, 03801 Alcoy, Spain;Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática, Universitat Politècnica de València, Camino de Vera s/n, 46021 Valencia, Spain
Venue:
Computers and Operations Research
Year:
2012

Citing 12
Cited 0

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
An overview of vehicle routing problems

The vehicle routing problem
Solution of a Min-Max Vehicle Routing Problem

INFORMS Journal on Computing
Solving real-world ATSP instances by branch-and-cut

Combinatorial optimization - Eureka, you shrink!
Parallel Metaheuristics: A New Class of Algorithms

Parallel Metaheuristics: A New Class of Algorithms
A review of metrics on permutations for search landscape analysis

Computers and Operations Research
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem

Computers and Operations Research
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lower tolerance-based Branch and Bound algorithms for the ATSP

Computers and Operations Research
Tolerance based contract-or-patch heuristic for the asymmetric TSP

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Transforming asymmetric into symmetric traveling salesman problems

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

The routing of vehicles on road transportation networks is an area of great importance to transportation planners within scientific literature. This field includes well known and studied problems like traveling salesman problems or TSP or the more realistic asymmetric variant or ATSP, whose applications extend to other areas of transport and operations research. This work studies the effect that the asymmetry of road transportation networks, geographical location and territory have over TSP and ATSP methods. We conduct comprehensive experiments in order to assess the effects that these factors have on some of the best known algorithms for the TSP/ATSP. We demonstrate that all these factors have a significant influence in solution time and quality. Furthermore, we show that the solutions obtained with Euclidean matrices and those obtained with real distance matrices differ significantly.