New policies for the dynamic traveling salesman problem

Gianpaolo Ghiani, Antonella Quaranta, Chefi Triki

Research output: Contribution to journalArticle

7 Citations (Scopus)

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.

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

Fingerprint

Traveling salesman problem
Travelling salesman problems
Heavy Traffic
Asymptotically Optimal
Waiting Time
Routing
Policy
Simulation

Keywords

  • Dynamic fleet management
  • Stochastic and dynamic vehicle routing

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Applied Mathematics
  • Control and Optimization
  • Management Science and Operations Research

Cite this

New policies for the dynamic traveling salesman problem. / Ghiani, Gianpaolo; Quaranta, Antonella; Triki, Chefi.

In: Optimization Methods and Software, Vol. 22, No. 6, 12.2007, p. 971-983.

Research output: Contribution to journalArticle

Ghiani, Gianpaolo ; Quaranta, Antonella ; Triki, Chefi. / New policies for the dynamic traveling salesman problem. In: Optimization Methods and Software. 2007 ; Vol. 22, No. 6. pp. 971-983.
@article{0da7b322f9004cf1bf7fd9ef041dfc91,
title = "New policies for the dynamic traveling salesman problem",
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.",
keywords = "Dynamic fleet management, Stochastic and dynamic vehicle routing",
author = "Gianpaolo Ghiani and Antonella Quaranta and Chefi Triki",
year = "2007",
month = "12",
doi = "10.1080/10556780701550026",
language = "English",
volume = "22",
pages = "971--983",
journal = "Optimization Methods and Software",
issn = "1055-6788",
publisher = "Taylor and Francis Ltd.",
number = "6",

}

TY - JOUR

T1 - New policies for the dynamic traveling salesman problem

AU - Ghiani, Gianpaolo

AU - Quaranta, Antonella

AU - Triki, Chefi

PY - 2007/12

Y1 - 2007/12

N2 - 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.

AB - 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.

KW - Dynamic fleet management

KW - Stochastic and dynamic vehicle routing

UR - http://www.scopus.com/inward/record.url?scp=35148897811&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35148897811&partnerID=8YFLogxK

U2 - 10.1080/10556780701550026

DO - 10.1080/10556780701550026

M3 - Article

AN - SCOPUS:35148897811

VL - 22

SP - 971

EP - 983

JO - Optimization Methods and Software

JF - Optimization Methods and Software

SN - 1055-6788

IS - 6

ER -