The Clustered Dial-a-Ride Problem

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

FEITSCH, Fabian, Sabine STORANDT, 2019. The Clustered Dial-a-Ride Problem. Twenty-Ninth International Conference on Automated Planning and Scheduling : 2019 ICAPS conference. Berkeley, Jul 11, 2019 - Jul 15, 2019. In: BENTON, J., ed. and others. Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling. Palo Alto, CA:AAAI Press, pp. 510-518. eISSN 2334-0843

@inproceedings{Feitsch2019Clust-46269, title={The Clustered Dial-a-Ride Problem}, url={}, year={2019}, address={Palo Alto, CA}, publisher={AAAI Press}, booktitle={Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling}, pages={510--518}, editor={Benton, J.}, author={Feitsch, Fabian and Storandt, Sabine} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:contributor>Feitsch, Fabian</dc:contributor> <dcterms:title>The Clustered Dial-a-Ride Problem</dcterms:title> <dcterms:isPartOf rdf:resource=""/> <bibo:uri rdf:resource=""/> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Feitsch, Fabian</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:issued>2019</dcterms:issued> <dcterms:available rdf:datatype="">2019-07-09T14:04:34Z</dcterms:available> <dc:language>eng</dc:language> <dcterms:abstract xml:lang="eng">We study a variant of the classical dial-a-ride problem, with an application to public transport planning in rural areas. In the classical dial-a-ride problem, n users each specify a pickup and a delivery location, and the aim is to plan the least cost route to cater all requests. This can be modeled as a traveling salesmen problem in a complete graph with precedence constraints (pick-ups need to happen before deliveries). In this paper, we consider the clustered dial-a-ride problem, where we do not operate on a complete graph but on a graph composed of serially numbered cliques where each clique is connected to the next one via a single edge. This setting is inspired by door-to-door transportation for people from remote villages who want to get to another village or the next city by a bus which operates on demand. We argue that in case the optimal route exhibits certain structural properties, it can be computed significantly faster. To make use of this observation, we devise a classification algorithm which can decide whether the optimal route exhibits these structural properties before computing it. Extensive experiments on artificial and real-world instances reveal that the majority of optimal routes indeed have the desired properties and that our classifier is an efficient tool to recognize the respective instances.</dcterms:abstract> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Storandt, Sabine</dc:contributor> <dc:creator>Storandt, Sabine</dc:creator> <dc:date rdf:datatype="">2019-07-09T14:04:34Z</dc:date> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


My Account