Document Server@UHasselt >
Research >
Research publications >

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

Title: Using path decomposition enumeration to enhance route choice models
Authors: Knapen, Luk
Hartman, Irith Ben-Arroyo
Bellemans, Tom
Issue Date: 2018
Citation: Future generation computer systems,
Status: In Press
Abstract: Prediction of realistic routes is essential in travel behavior research that evaluates the effects of infrastructure design alternatives. Most proposed route choice models are based on additive link attributes. This paper investigates the decomposition of a given path in a graph into least cost components. This corresponds to finding the smallest number of intermediate destinations between which the traveler moved using the most efficient path. Minimum path decompositions are not unique and hence a single given path may result in multiple sets of intermediate destinations. This paper presents a technique to enumerate all possible decompositions of revealed paths and shows how to determine which road network nodes are preferentially used as intermediate destinations. This paper explains the decomposition enumeration process and focuses on a new algorithm to enumerate efficiently all path decompositions. We implement the algorithms on 500k predicted bikers routes in Amsterdam.
URI: http://hdl.handle.net/1942/25602
DOI: 10.1016/j.future.2017.12.053
ISSN: 0167-739X
Category: A1
Type: Journal Contribution
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Version in Press4.56 MBAdobe PDF
Peer-reviewed author version12.9 MBAdobe PDF

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