On the on-line k-truck problem with benefit maximization

Authors:
Weimin Ma;Ke Wang
Affiliations:
School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing, P.R. China;School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing, P.R. China
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 7
Cited 1

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for server problems

Journal of Algorithms
On the k-server conjecture

Journal of the ACM (JACM)
On-line k-Truck Problem and Its Competitive Algorithms

Journal of Global Optimization
Competitiveness via consensus

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Envy-free auctions for digital goods

Proceedings of the 4th ACM conference on Electronic commerce
Competitive analysis of financial games

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

On the on-line weighted k-taxi problem

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on some results of the on-line k-truck problem with cost minimization, a realistic model of the on-line k-truck problem with benefit maximization is proposed. In the model, the object of optimization is how to design on-line algorithms to maximize the benefit of all trucks' moving. In this paper, after the model's establishment, several on-line algorithms, e.g., Position Maintaining Strategy, Partial Greedy Algorithm, are employed to address the problem. The analyses concerning the competitive ratios of the algorithms are given in detail. Furthermore, the lower bound of competitive ratio is discussed.