Abstract
In online dial-a-ride problem with time-windows, requests for rides consist of two points in a metric space, a source and a destination. One server with some finite capacity is required to transports a specified amount of goods for requests from the sources to the destinations. Calls for rides come in while the server is travelling. Each request also specifies a deadline. If a request is not be served by its deadline, it will be called off. The server travels at unit speed in the metric space and the goal is to plan the motion of the server in an online way so that the maximum number of requests (or the maximum quantity of goods) is met by the deadlines of the requests. Usually it is assumed that the server knows the complete information on the ride when the requests are presented. We study this problem under a restricted information model. At the release time of one request, only the information on the source is presented. The server does not have the information on the destination until it reaches the source of the request. This models, e.g. the taxi problem, or elevator problem. We study the problem in the uniform metric space and K-constrained metric space. We perform competitive analysis of two deterministic strategies in the two types of metric spaces. The competitive ratios of the strategies are obtained. We also prove a lower bound on the competitive ratio of any deterministic algorithm of Z for the uniform metric space and of KZ for the K-constrained metric space, where Z denotes the capacity of the server and K denotes the diameter of the metric space.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Krumke, S.O., Laura, L., Lipmann, M., Marchetti-Spaccamela, et al.: Non-abusiveness helps: An o(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem. LNCS, pp. 200–214 (2002)
Feuerstein, E., Stougie, L.: On-line single server dial-a-ride problems. Theoretical Computer Science 268(1), 91–105 (2001)
Ascheuer, N., Krumke, S.O., Rambau, J.: Online dial-a-ride problems: Minimizing the completion time. LNCS, pp. 639–650 (2000)
Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the on-line traveling salesman. Algorithmica 29(4), 560–581 (2001)
Krumke, S.O., de Paepe, W.E., Poensgen, D., Stougie, L.: News from the online traveling repairman. Theoretical Computer Science 295, 279–294 (2003)
Hauptmeier, D., Krumke, S.O., Rambau, J.: The online dial-a-ride problem under reasonable load. LNCS, pp. 125–136 (2000)
Xu, Y.F., Wang, K.L.: Scheduling for on-line taxi problem and competitive algorithms. Journal of Xi’an Jiao Tong University 31(1), 56–61 (1997)
Xu, Y.F., Wang, K.L., Zhu, B.: On the k-taxi problem. Journal of Information 2, 429–434 (1999)
Xu, Y.F., Wang, K.L., Ding, J.H.: On-line k-taxi scheduling on a constrained graph and its competitive algorithm. Journal of System Engineering (P.R. China) 4 (1999)
Ma, W.M., Xu, Y.F., Wang, K.L.: On-line k-truck problem and its competitive algorithm. Journal of Global Optimization 21(1), 15–25 (2001)
Lipmann, M., Lu, X., de Paepe, W.E., Sitters, R.A.: On-line dial-a-ride problems under a restricted information model. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 674–685. Springer, Heidelberg (2002)
Psaraftis, H.N.: An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science 17, 351–357 (1983)
Diana, M., Dessouky, M.M.: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Trasportation Reserch Part B 38, 539–557 (2004)
Yi, F.L., Tian, L.: On the online dial-a-ride problem with time windows. In: Megiddo, N., Xu, Y., Zhu, B. (eds.) AAIM 2005. LNCS, vol. 3521, pp. 85–94. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yi, F., Xu, Y., Xin, C. (2006). Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model. In: Cheng, SW., Poon, C.K. (eds) Algorithmic Aspects in Information and Management. AAIM 2006. Lecture Notes in Computer Science, vol 4041. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11775096_4
Download citation
DOI: https://doi.org/10.1007/11775096_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35157-3
Online ISBN: 978-3-540-35158-0
eBook Packages: Computer ScienceComputer Science (R0)