Online traveling salesman problem with deadline and advanced information

Authors:
Xingang Wen;Yinfeng Xu;Huili Zhang
Affiliations:
School of Management, Xi'an JiaoTong University, Xi'an 710049, China and State Key Lab for Manufacturing Systems Engineering, Xi'an 710049, China and Ministry of Education Key Lab for Process Cont ...;School of Management, Xi'an JiaoTong University, Xi'an 710049, China and State Key Lab for Manufacturing Systems Engineering, Xi'an 710049, China and Ministry of Education Key Lab for Process Cont ...;School of Management, Xi'an JiaoTong University, Xi'an 710049, China and State Key Lab for Manufacturing Systems Engineering, Xi'an 710049, China and Ministry of Education Key Lab for Process Cont ...
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 12
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Maximizing job completions online

Journal of Algorithms
Approximation algorithms for deadline-TSP and vehicle routing with time-windows

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithms for the on-line quota traveling salesman problem

Information Processing Letters
On approximating a geometric prize-collecting traveling salesman problem with time windows

Journal of Algorithms
How to whack moles

Theoretical Computer Science - Approximation and online algorithms
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios

Transportation Science
The online Prize-Collecting Traveling Salesman Problem

Information Processing Letters
On the power of lookahead in on-line server routing problems

Theoretical Computer Science
Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses

Operations Research
A Stochastic and Dynamic Vehicle Routing Problem with Time Windows and Customer Impatience

Mobile Networks and Applications
Online deadline scheduling with preemption penalties

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the online version of the traveling salesman problem, where instances are not known in advance. Requests are released over time regardless whether the server is en route or not. This problem has been described as online TSP. Current literature about online TSP assumes that each request becomes known at its release time and will always remain active. We model the customers' waiting psychology and service preparation time into the online TSP with the objective to serve as many requests as possible. More specifically, each request has a disclosure time before accepting service at its release time, and a deadline, which is no bigger than its release time plus the travel time from origin to its position. We give lower bounds for the competitive ratios, online algorithms, and quantify the influence of advanced information on competitive ratios.