New policies for the dynamic traveling salesman problem

Authors:
Gianpaolo Ghiani;Antonella Quaranta;Chefi Triki
Affiliations:
Dipartimento di Ingegneria dell'Innovazione, Universit di Lecce, Lecce, Italy;Dipartimento di Ingegneria dell'Innovazione, Universit di Lecce, Lecce, Italy,Dipartimento di Matematica, Universit di Lecce, Lecce, Italy;Dipartimento di Matematica, Universit di Lecce, Lecce, Italy
Venue:
Optimization Methods & Software
Year:
2007

Citing 8
Cited 1

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

Operations Research
A vehicle routing problem with stochastic demand

Operations Research
Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles

Operations Research
Online computation and competitive analysis

Online computation and competitive analysis
Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On-Line Algorithms for the Dynamic Traveling Repair Problem

Journal of Scheduling
Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers

Operations Research
Anticipatory Route Selection

Transportation Science

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

ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The dynamic traveling salesman problem is a variant of the classical traveling salesman problem in which service requests arrive in a random fashion. In this paper we propose three new routing policies minimizing the expected total waiting time of all the demands in the system. In particular, we show that two policies are asymptotically optimal in heavy traffic, whereas the third one has a constant factor guarantee of two. We also perform extensive simulations in order to compare the three policies under various arrival rates.