New policies for the dynamic traveling salesman problem

New policies for the dynamic traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor20084744
Country: United Kingdom
Volume: 22
Issue: 6
Start Page Number: 971
End Page Number: 983
Publication Date: Dec 2007
Journal: Optimization Methods & Software
Authors: , ,
Keywords: vehicle routing & scheduling, transportation: road
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.

Reviews

Required fields are marked *. Your email address will not be published.