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

@article{Jaillet2008GeneralizedOR,
  title={Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses},
  author={Patrick Jaillet and Michael R. Wagner},
  journal={Oper. Res.},
  year={2008},
  volume={56},
  pages={745-757}
}
We consider online routing optimization problems where the objective is to minimize the time needed to visit a set of locations under various constraints; the problems are online because the set of locations are revealed incrementally over time. We consider two main problems: (1) the online traveling salesman problem (TSP) with precedence and capacity constraints, and (2) the online TSP with m salesmen. For both problems we propose online algorithms, each with a competitive ratio of 2; for the… 

Figures from this paper

Online traveling salesman problems with service flexibility

This article introduces a sound theoretical model to incorporate “yes‐no” decisions on which requests to serve, together with an online strategy to visit the accepted requests, and proposes and proves the optimality of a 2‐competitive polynomial time online algorithm based on reoptimization approaches.

Online Vehicle Routing Problems: A Survey

The notion of disclosure dates is introduced, a form of advanced notice which allows for more realisticcompetitive ratios in online Vehicle Routing Problems.

Distributed Multi-Depot Routing without Communications

A class of distributed multi-depot routing problems, where servers are to visit a set of requests, with the aim of minimizing the total distance travelled by all servers is considered, and the approximation ratio given by the Voronoi partition is m.

Online traveling salesman problems with rejection options

Among the restricted class of online algorithms with prior knowledge about the total number of requests n, an asymptotically best possible O ( ln ⁡ n ) ‐competitive algorithm is proposed.

Revenue Maximization in Online Dial-A-Ride

This work studies a variation of the Online-Dial-a-Ride Problem where each request comes with not only a source, destination and release time, but also has an associated revenue, and provides a 3-competitive algorithm for the problem in a uniform metric space and a 6-competitive algorithms for the general case of weighted graphs.

Tight Bounds for Online TSP on the Line

This work considers the online traveling salesperson problem (TSP), where requests appear online over time on the real line and need to be visited by a server initially located at the origin, and gives an algorithm with running time O(n2) for closed offline TSP on the line with release dates and shows that both variants of offline DIAL-A-RIDE on the lines are NP-hard for any capacity c≥ 2 of the server.

Almost sure asymptotic optimality for online routing and machine scheduling problems

This article analyzes well‐known online algorithms for online routing and machine scheduling problems and proves that these online algorithms are almost surely asymptotically optimal.

From theory to practice: maximizing revenues for on-line dial-a-ride

It is proved that no deterministic online algorithm can be competitive unless the input graph is complete and edge weights are unit, and a 2-competitive algorithm is presented for this problem.

From theory to practice: maximizing revenues for on-line dial-a-ride

It is proved that no deterministic online algorithm can be competitive unless the input graph is complete and edge weights are unit, and a 2-competitive algorithm is presented for this problem.
...

References

SHOWING 1-10 OF 41 REFERENCES

Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios

The notion of a requests disclosure date, the time when a citys location and release date are revealed to the server, is introduced and new online algorithms are given in a variety of disclosure date scenarios and metric spaces.

Online k-Server Routing Problems

A 1+O((log k)/k)-competitive algorithm is given for the k-Traveling Salesman Problem and the k -Traveling Repairman Problem when the underlying metric space is the real line and it is proved that a similar result cannot hold for the Euclidean plane.

The Online-TSP against Fair Adversaries

The main contribution of the paper is the presentation of a "fair adversary", as an alternative to the omnipotent adversary used in competitive analysis for online routing problems, and shows that on IR0+ algorithms can achieve a strictly better competitive ratio against a fair adversary than against a conventional adversary.

The Online Transportation Problem

The online transportation problem under the weakened adversary model is studied and an algorithm Balance is presented, which is a simple modification of the greedy algorithm that has a halfopt-competitive ratio of O(1).

Online Dial-a-Ride Problems: Minimizing the Completion Time

This work analyzes several competitive algorithms for OLDARP and presents a somewhat less natural strategy SMARTSTART, which in contrast to the other two strategies may leave the server idle from time to time although unserved requests are known.

Approximation algorithms for some routing problems

Several polynomial time approximation algorithms for some NP-complete routing problems are presented, and the worst-case ratios of the cost of the obtained route to that of an optimal are determined.

Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands

The asymptotic optimal solution value of the capacitated vehicle routing problem with unsplit demands is found for any distribution of the demands when customers are independently and identically distributed in a given region.

Technical Note - Heuristics for Delivery Problems with Constant Error Guarantees

In this paper Q Iterated Optimal Tour Partitioning, and Best Optimal Tour Partitioning algorithms are studied and analyzed for their worst case error. Both algorithms are based on partitioning an

On the asymptotic optimality of algorithms for the flow shop problem with release dates

A probabilistic analysis is performed and it is proved that two online heuristics and one offline heuristic are asymptotically optimal.

Algorithms for the On-Line Quota Traveling Salesman Problem