On Computation and Application of k Most Locally-Optimal Paths in Road Networks
dc.contributor.author | Döbler, Holger | |
dc.contributor.author | Scheuermann, Björn | |
dc.contributor.editor | Scheuermann, Björn | |
dc.contributor.editor | Dietzel, Stefan | |
dc.date.accessioned | 2017-06-15T13:04:42Z | |
dc.date.available | 2017-06-15T13:04:42Z | |
dc.date.created | 2016-05-03 | |
dc.date.issued | 2016-04-20 | |
dc.identifier.uri | http://edoc.hu-berlin.de/18452/2092 | |
dc.description.abstract | For some applications, e.g. route planning services, it is desirable to answer a point-to-point shortest path query on a road network with a set of alternative paths. We discuss the general requirements for such sets of paths such as shortness, diversity, etcetera. As a measure to rank reasonable alternatives we propose the local optimality ratio, because it implicitly covers all of these requirements. We present an algorithm that computes the k best alternatives in terms of this measure. | eng |
dc.language.iso | eng | |
dc.publisher | Humboldt-Universität zu Berlin | |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject.ddc | 004 Informatik | |
dc.title | On Computation and Application of k Most Locally-Optimal Paths in Road Networks | |
dc.type | conferenceObject | |
dc.identifier.urn | urn:nbn:de:kobv:11-100238047 | |
dc.identifier.doi | http://dx.doi.org/10.18452/1440 | |
local.edoc.pages | 4 | |
local.edoc.type-name | Konferenzveröffentlichung | |
local.edoc.container-type | conference | |
local.edoc.container-type-name | Konferenz | |
dc.description.event | Fachgespräch Inter-Vehicle Communication 2016, inter-veh-comm-2016, 31.03.2016 - 01.04.2016, Humboldt-Universität zu Berlin, pp 32-35 | |
dcterms.bibliographicCitation.booktitle | Fachgespräch Inter-Vehicle Communication 2016 | |
dcterms.bibliographicCitation.pagestart | 32 | |
dcterms.bibliographicCitation.pageend | 35 |