TY - GEN
T1 - On-line dial-a-ride problems under a restricted information model
AU - Lipmann, Maarten
AU - Lu, X.
AU - de Paepe, Willem E.
AU - Sitters, Rene A.
AU - Stougie, Leen
PY - 2002
Y1 - 2002
N2 - 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 end point of the ride. Usually it is assumed that at the release of such a request complete information about the ride is known. We diverge from this by assuming that at the release of such 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. timizer.
AB - 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 end point of the ride. Usually it is assumed that at the release of such a request complete information about the ride is known. We diverge from this by assuming that at the release of such 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. timizer.
UR - http://www.scopus.com/inward/record.url?scp=23044532262&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=23044532262&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:23044532262
VL - 2461
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 674
EP - 685
BT - Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings
PB - Springer/Verlag
T2 - 10th Annual European Symposium on Algorithms, ESA 2002
Y2 - 17 September 2002 through 21 September 2002
ER -