New policies for the dynamic traveling salesman problem

Gianpaolo Ghiani, Antonella Quaranta, Chefi Triki*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)971-983
Number of pages13
JournalOptimization Methods and Software
Issue number6
Publication statusPublished - Dec 2007


  • Dynamic fleet management
  • Stochastic and dynamic vehicle routing

ASJC Scopus subject areas

  • Software
  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'New policies for the dynamic traveling salesman problem'. Together they form a unique fingerprint.

Cite this