On the power of lookahead in on-line vehicle routing problems

Authors:
Luca Allulli;Giorgio Ausiello;Luigi Laura
Affiliations:
Dip. di Informatica e Sistemistica, Università di Roma “La Sapienza”, Roma, Italy;Dip. di Informatica e Sistemistica, Università di Roma “La Sapienza”, Roma, Italy;Dip. di Informatica e Sistemistica, Università di Roma “La Sapienza”, Roma, Italy
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 9
Cited 4

Amortized efficiency of list update and paging rules

Communications of the ACM
A competitive analysis of the list update problem with lookahead

Theoretical Computer Science
Online computation and competitive analysis

Online computation and competitive analysis
Online bin packing with lookahead

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On-Line Dial-a-Ride Problems under a Restricted Information Model

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Online Scheduling with Lookahead: Multipass Assembly Lines

INFORMS Journal on Computing
The Online TSP Against Fair Adversaries

INFORMS Journal on Computing
Speed is as powerful as clairvoyance [scheduling problems]

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

2005: an offline persepctive

ACM SIGACT News
On-Line algorithms, real time, the virtue of laziness, and the power of clairvoyance

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On the power of lookahead in online lot-sizing

Operations Research Letters
On time lookahead algorithms for the online data acknowledgement problem

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vehicle Routing Problems are generalizations of the well known Traveling Salesman Problem; we focus on the on-line version of these problems, where requests are not known in advance and arrive over time. We introduce a model of lookeahead for this class of problems, the time lookaheadΔ, which allows an on-line algorithm to foresee all the requests that will be released during next Δ time units. We present lower and upper bounds on the competitive ratio of known and studied variants of the OlTsp; we compare these results with the ones from the literature. Our results show that the effectiveness of lookahead varies significantly as we consider different problems.