Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/25602
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | KNAPEN, Luk | - |
dc.contributor.author | Hartman, Irith Ben-Arroyo | - |
dc.contributor.author | BELLEMANS, Tom | - |
dc.date.accessioned | 2018-03-01T15:05:40Z | - |
dc.date.available | 2018-03-01T15:05:40Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | Future Generation Computer Systems-The International Journal of eScience, 107, p. 1077-1088. | - |
dc.identifier.issn | 0167-739X | - |
dc.identifier.uri | http://hdl.handle.net/1942/25602 | - |
dc.description.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. | - |
dc.description.sponsorship | The authors thank Lara Montini (ETH Zürich - D-BAUG - IVT) for the support related to operating the POSDAP software. This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors. | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.rights | 2017 Elsevier B.V. All rights reserved. | - |
dc.subject.other | Graph theory | - |
dc.subject.other | Route choice | - |
dc.subject.other | Simulation | - |
dc.subject.other | GPS traces | - |
dc.title | Using path decomposition enumeration to enhance route choice models | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 1088 | - |
dc.identifier.spage | 1077 | - |
dc.identifier.volume | 107 | - |
local.bibliographicCitation.jcat | A1 | - |
local.publisher.place | RADARWEG 29, 1043 NX AMSTERDAM, NETHERLANDS | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.source.type | Article | - |
dc.identifier.doi | 10.1016/j.future.2017.12.053 | - |
dc.identifier.isi | WOS:000527331800085 | - |
dc.identifier.eissn | 1872-7115 | - |
local.provider.type | Web of Science | - |
local.uhasselt.international | yes | - |
item.validation | ecoom 2021 | - |
item.contributor | KNAPEN, Luk | - |
item.contributor | Hartman, Irith Ben-Arroyo | - |
item.contributor | BELLEMANS, Tom | - |
item.accessRights | Open Access | - |
item.fullcitation | KNAPEN, Luk; Hartman, Irith Ben-Arroyo & BELLEMANS, Tom (2020) Using path decomposition enumeration to enhance route choice models. In: Future Generation Computer Systems-The International Journal of eScience, 107, p. 1077-1088.. | - |
item.fulltext | With Fulltext | - |
crisitem.journal.issn | 0167-739X | - |
crisitem.journal.eissn | 1872-7115 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
routeDecompEnum.pdf | Peer-reviewed author version | 6.36 MB | Adobe PDF | View/Open |
1-s2.0-S0167739X17321866-main.pdf Restricted Access | Published version | 4.57 MB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
3
checked on Sep 5, 2020
WEB OF SCIENCETM
Citations
4
checked on May 2, 2024
Page view(s)
116
checked on Sep 7, 2022
Download(s)
330
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.