Analysis of the traveling salesman problem with a subset of intermediate cities and dynamic edge weights used with intelligent transportation systems

Authors:
Jeffrey Miller
Affiliations:
Department of Computer Systems Engineering, University of Alaska, Anchorage
Venue:
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Year:
2009

Citing 9
Cited 0

A priori solution of a travelling salesman problem in which a random subset of the customers are visited

Operations Research
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
A new approach to dynamic all pairs shortest paths

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
New Algorithms for Maintaining All-Pairs Shortest Paths

ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
The A Priori Dynamic Traveling Salesman Problem with Time Windows

Transportation Science
MONET special issue on next generation hardware architectures for secure mobile computing

Mobile Networks and Applications
New policies for the dynamic traveling salesman problem

Optimization Methods & Software
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
A Reliable Link-Layer Protocol for Robust and Scalable Intervehicle Communications

IEEE Transactions on Intelligent Transportation Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a specialized routing problem for vehicles in a transportation network that need to visit multiple destinations before returning to the starting location in the minimum time is presented. Although this problem is similar to the Traveling Salesman Problem (TSP), it differs because the edge weights can change constantly and the vehicle only needs to visit a subset of the nodes in the graph. The Dynamic Fastest Paths with Multiple Unique Destinations (DynFast-MUD) algorithm [23] provides a solution to this problem which is tested in a live environment in this study. There are currently 50 vehicles in Anchorage, Alaska that contain devices that report the speed, location, and direction to a central server through a vehicle-to-infrastructure (V2I) architecture. Using this data, the shortest route to a predefined set of destinations was compared to the path identified by the DynFast-MUD algorithm once a day for a two week period. The results show that with this relatively limited number of vehicles contributing to the dynamic changing edge weights, the DynFast-MUD algorithm always provides a route that is at least as fast as the shortest route. It is hypothesized that with more vehicles reporting speed and location data, the DynFast-MUD algorithm will produce even better results.