On the on-line k-taxi problem with limited look ahead

Authors:
Weimin Ma;Ting Gao;Ke Wang
Affiliations:
School of Economics and Management, Beijng University of Aeronautics and Astronautics, Beijing, P.R. China and School of Economics and Management, Zhongyuan University of Technology, Zhengzhou, He ...;School of Economics and Management, Beijng University of Aeronautics and Astronautics, Beijing, P.R. China;School of Economics and Management, Beijng University of Aeronautics and Astronautics, Beijing, P.R. China
Venue:
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Year:
2007

Citing 14
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Competitive algorithms for server problems

Journal of Algorithms
On the power of randomization in online algorithms

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for metrical task system

Journal of the ACM (JACM)
New Algorithms for Bin Packing

Journal of the ACM (JACM)
Dynamic TCP acknowledgement and other stories about e/(e-1)

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the Bahncard problem

Theoretical Computer Science
On the On-line Number of Snacks Problem

Journal of Global Optimization
On-line k-Truck Problem and Its Competitive Algorithms

Journal of Global Optimization
Developments from a June 1996 seminar on Online algorithms: the state of the art

Developments from a June 1996 seminar on Online algorithms: the state of the art
On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?

Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Average-Case Competitive Analyses for Ski-Rental Problems

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Competitive Analysis for the On-line Truck Transportation Problem

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on some new results concerning k-taxi problem, a new variant of the problem, namely the on-line k-taxi problem with limited look ahead (OTLLA) is proposed by our team. Compared with the traditional k-taxi problem, in which only the start and end points of the current service request are known at each step, the OTLLA has a basic realistic consideration: the start point of the first service request is given before the whole service sequence plays, and at each step the end of the current service request and the start point of the next service request are known. In this paper, after the formulation of the model of the OTLLA, some results concerning the competitive analysis for some special cases of OTLLA are given: the competitive algorithm so called Partial Greedy Algorithm (PGA) is designed and the competitive ratios are obtained. Furthermore, some comparisons between some on-line algorithms are developed. Finally, some conclusions are given and some future research directions are discussed.