On-line k-Truck Problem and Its Competitive Algorithms

Authors:
Weimin Ma;Yinfeng Xu;Kanliang Wang
Affiliations:
The School of Management Xi'an Jiaotong University, Xi'an, Shaanxi. P.R. China. 710049/ The Dept. of the Computing The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong (e-mail: < ...;The School of Management Xi'an Jiaotong University, Xi'an, Shaanxi. P.R. China. 710049/;The School of Management Xi'an Jiaotong University, Xi'an, Shaanxi. P.R. China. 710049/
Venue:
Journal of Global Optimization
Year:
2001

Citing 3
Cited 8

Competitive algorithms for server problems

Journal of Algorithms
On the k-server conjecture

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A Graph-Theoretic Game and its Application to the $k$-Server Problem

SIAM Journal on Computing

On the On-line Number of Snacks Problem

Journal of Global Optimization
New Results on the k-Truck Problem

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Competitive Analysis for the On-line Truck Transportation Problem

Journal of Global Optimization
On the on-line rent-or-buy problem in probabilistic environments

Journal of Global Optimization
On the on-line k-taxi problem with limited look ahead

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Online dial-a-ride problem with time-windows under a restricted information model

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
On the online dial-a-ride problem with time-windows

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
On the on-line k-truck problem with benefit maximization

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, based on the Position Maintaining Strategy (PMS for short), on-line scheduling of k-truck problem, which is a generalization of the famous k-server problem, is originally presented by our team. We proposed several competitive algorithms applicable under different conditions for solving the on-line k-truck problem. First, a competitive algorithm with competitive ratio 2k+1/&thetas; is given for any &thetas;≥1. Following that, if &thetas;≥(c+1)/(c-1) holds, then there must exist a (2k-1)-competitive algorithm for k-truck problem, where c is the competitive ratio of the on-line algorithm about the relevant k-server problem. And then a greedy algorithm with competitive ratio 1+λ/&thetas;, where lambda is a parameter related to the structure property of a given graph, is given. Finally, competitive algorithms with ratios 1+1/&thetas; are given for two special families of graphs.