Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/17626

Title: Canonic Route Splitting
Authors: Knapen, Luk
Bellemans, Tom
Janssens, Davy
Wets, Geert
Issue Date: 2014
Citation: Procedia Computer Science 32, p. 309-316
Abstract: There are multiple ways to split a path in a directed graph into largest sub-paths of minimal cost. All possible splits constitute path partitions of the same size. By calculating two specific path splittings, it is possible to identify subsets of the vertices (splitVer- texSets) that can be used to generate every possible path splitting by taking one vertex from each such subset and connecting the resulting vertices by a least cost path. This is interesting in transportation science when investigating the hypothesis that people build up their route from least cost components. The splitVertexSets can be easily and efficiently derived from big data (GPS recordings). This allows for statistical analysis of structural route characteristics which in turn can support constrained enumera- tion methods for route choice set building. Furthermore, the boundary vertices separating consecutive route parts, are way points having a particular meaning to their user which constitutes relevant information to the transportation analyst.
Notes: Knapen, L (reprint author), Hasselt Univ, Wetenschapspk 5, B-3950 Diepenbeek, Belgium. luk.knapen@uhasselt.be
URI: http://hdl.handle.net/1942/17626
DOI: 10.1016/j.procs.2014.05.429
ISI #: 000361562600037
ISSN: 1877-0509
Category: A1
Type: Proceedings Paper
Validation: ecoom, 2016
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
published version5.54 MBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.