4,166 research outputs found
Online traveling salesman problems with rejection options
In this article, we consider online versions of the traveling salesman problem on metric spaces for which requests to visit points are not mandatory. Associated with each request is a penalty (if rejected). Requests are revealed over time (at their release dates) to a server who must decide which requests to accept and serve in order to minimize a linear combination of the time to serve all accepted requests and the total penalties of all rejected requests. In the basic online version of the problem, a request can be accepted any time after its release date. In the real-time online version, a request must be accepted or rejected at the time of its release date. For the basic version, we provide a best possible 2-competitive online algorithm for the problem on a general metric space. For the real-time version, we first consider special metric spaces: on the nonnegative real line, we provide a best possible 2.5-competitive polynomial time online algorithm; on the real line, we prove a Ω(√ln n) lower bound of 2.64 on any competitive ratios and give a 3-competitive online algorithm. We then consider the case of a general metric space and prove a inline image lower bound on the competitive ratio of any online algorithms. Finally, among the restricted class of online algorithms with prior knowledge about the total number of requests n, we propose an asymptotically best possible O(√ln n)-competitive algorithm.United States. Office of Naval Research (Grant N00014-09-1-0326)United States. Office of Naval Research (Grant N00014-12-1-0033)United States. Air Force Office of Scientific Research (Grant FA9550-10-1-0437
Maximizing Revenues for Online-Dial-a-Ride
In the classic Dial-a-Ride Problem, a server travels in some metric space to
serve requests for rides. Each request has a source, destination, and release
time. We study a variation of this problem where each request also has a
revenue that is earned if the request is satisfied. The goal is to serve
requests within a time limit such that the total revenue is maximized. We first
prove that the version of this problem where edges in the input graph have
varying weights is NP-complete. We also prove that no algorithm can be
competitive for this problem. We therefore consider the version where edges in
the graph have unit weight and develop a 2-competitive algorithm for this
problem
- …