Finding the Most Preferred Path

Lade...
Vorschaubild
Dateien
Sacharidis_2-he7zsdgra5yb5.pdf
Sacharidis_2-he7zsdgra5yb5.pdfGröße: 202.55 KBDownloads: 641
Datum
2017
Autor:innen
Sacharidis, Dimitris
Bouros, Panagiotis
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
HOEL, Erik, ed. and others. Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. New York, NY: ACM Press, 2017, 5. ISBN 978-1-4503-5490-5. Available under: doi: 10.1145/3139958.3140029
Zusammenfassung

Consider a road network, and let the preferred subnet consist of the roads a driver is more acquainted to and hence tends to follow. In this paper, we study the problem of finding the most preferred path between two network nodes; we consider two variants of this problem. We first target the Most Preferred Unrestricted Path (MPUP) that has the lowest traveling time in the non-preferred subnet; this problem was introduced in the literature as identifying the safest path though safe zones. As MPUP imposes no constraints on the total traveling time, we then introduce the Most Preferred Near Shortest Path (MPNSP) that has the lowest traveling time in the non-preferred subnet among all paths which are not much slower than the shortest path. We focus on the efficient evaluation of both problems by proposing solutions with simple pre-processing steps. An extensive evaluation demonstrates the efficiency of our techniques compared to the existing method for MPUP and to the state-of-the-art on computing multi-criteria shortest paths for MPNSP.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 7. Nov. 2017 - 10. Nov. 2017, Redondo Beach, CA, USA
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690SACHARIDIS, Dimitris, Panagiotis BOUROS, Theodoros CHONDROGIANNIS, 2017. Finding the Most Preferred Path. 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. Redondo Beach, CA, USA, 7. Nov. 2017 - 10. Nov. 2017. In: HOEL, Erik, ed. and others. Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. New York, NY: ACM Press, 2017, 5. ISBN 978-1-4503-5490-5. Available under: doi: 10.1145/3139958.3140029
BibTex
@inproceedings{Sacharidis2017Findi-41131,
  year={2017},
  doi={10.1145/3139958.3140029},
  title={Finding the Most Preferred Path},
  isbn={978-1-4503-5490-5},
  publisher={ACM Press},
  address={New York, NY},
  booktitle={Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems},
  editor={Hoel, Erik},
  author={Sacharidis, Dimitris and Bouros, Panagiotis and Chondrogiannis, Theodoros},
  note={Article Number: 5}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/41131">
    <dc:language>eng</dc:language>
    <dc:contributor>Chondrogiannis, Theodoros</dc:contributor>
    <dcterms:issued>2017</dcterms:issued>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract xml:lang="eng">Consider a road network, and let the preferred subnet consist of the roads a driver is more acquainted to and hence tends to follow. In this paper, we study the problem of finding the most preferred path between two network nodes; we consider two variants of this problem. We first target the Most Preferred Unrestricted Path (MPUP) that has the lowest traveling time in the non-preferred subnet; this problem was introduced in the literature as identifying the safest path though safe zones. As MPUP imposes no constraints on the total traveling time, we then introduce the Most Preferred Near Shortest Path (MPNSP) that has the lowest traveling time in the non-preferred subnet among all paths which are not much slower than the shortest path. We focus on the efficient evaluation of both problems by proposing solutions with simple pre-processing steps. An extensive evaluation demonstrates the efficiency of our techniques compared to the existing method for MPUP and to the state-of-the-art on computing multi-criteria shortest paths for MPNSP.</dcterms:abstract>
    <dc:creator>Chondrogiannis, Theodoros</dc:creator>
    <dc:creator>Sacharidis, Dimitris</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Bouros, Panagiotis</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/41131/3/Sacharidis_2-he7zsdgra5yb5.pdf"/>
    <dc:contributor>Bouros, Panagiotis</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-01-24T12:58:55Z</dcterms:available>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/41131"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-01-24T12:58:55Z</dc:date>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/41131/3/Sacharidis_2-he7zsdgra5yb5.pdf"/>
    <dcterms:title>Finding the Most Preferred Path</dcterms:title>
    <dc:contributor>Sacharidis, Dimitris</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen