Show simple item record

2016-04-20Konferenzveröffentlichung DOI: 10.18452/1440
On Computation and Application of k Most Locally-Optimal Paths in Road Networks
dc.contributor.authorDöbler, Holger
dc.contributor.authorScheuermann, Björn
dc.contributor.editorScheuermann, Björn
dc.contributor.editorDietzel, Stefan
dc.date.accessioned2017-06-15T13:04:42Z
dc.date.available2017-06-15T13:04:42Z
dc.date.created2016-05-03
dc.date.issued2016-04-20
dc.identifier.urihttp://edoc.hu-berlin.de/18452/2092
dc.description.abstractFor 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.isoeng
dc.publisherHumboldt-Universität zu Berlin
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc004 Informatik
dc.titleOn Computation and Application of k Most Locally-Optimal Paths in Road Networks
dc.typeconferenceObject
dc.identifier.urnurn:nbn:de:kobv:11-100238047
dc.identifier.doihttp://dx.doi.org/10.18452/1440
local.edoc.container-titleFachgespräch Inter-Vehicle Communication 2016
local.edoc.pages4
local.edoc.type-nameKonferenzveröffentlichung
local.edoc.container-typeconference
local.edoc.container-type-nameKonferenz
local.edoc.container-eventFachgespräch Inter-Vehicle Communication 2016, inter-veh-comm-2016, 31.03.2016 - 01.04.2016, Humboldt-Universität zu Berlin, pp 32-35
local.edoc.container-firstpage32
local.edoc.container-lastpage35

Show simple item record