ملخص
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.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 971-983 |
عدد الصفحات | 13 |
دورية | Optimization Methods and Software |
مستوى الصوت | 22 |
رقم الإصدار | 6 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - ديسمبر 2007 |
منشور خارجيًا | نعم |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700.1712???
- ???subjectarea.asjc.2600.2606???
- ???subjectarea.asjc.2600.2604???