Abstract
In on-line dial-a-ride problems servers are traveling in some metric space to serve requests for rides which are presented over time. Each ride is characterized by two points in the metric space, a source, the starting point of the ride, and a destination, the endpoint of the ride. Usually it is assumed that at the release of a request, complete information about the ride is known. We diverge from this by assuming that at the release of a ride, only information about the source is given. At visiting the source, the information about the destination will be made available to the servers. For many practical problems, our model is closer to reality. However, we feel that the lack of information is often a choice, rather than inherent to the problem: additional information can be obtained, but this requires investments in information systems. In this paper we give mathematical evidence that for the problem under study it pays to invest.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Lipmann, M., Lu, X., de Paepe, W. et al. On-Line Dial-a-Ride Problems Under a Restricted Information Model. Algorithmica 40, 319–329 (2004). https://doi.org/10.1007/s00453-004-1116-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-004-1116-z