Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/25742
Title: | Enumerating minimum path decompositions to support route choice set generation | Authors: | Hartman, Irith Ben-Arroyo KNAPEN, Luk BELLEMANS, Tom |
Issue Date: | 2017 | Publisher: | Elsevier | Source: | Procedia Computer Science, Elsevier,p. 196-203 | Series/Report: | Procedia Computer Science | Series/Report no.: | 109 | Abstract: | This paper concerns the structure of movements as were recorded by GPS traces and converted to routes by map matching. Each route in a transportation network corresponds to a collection of directed paths or cycles in a digraph. When considering only directed paths, corresponding to utilitarian trips, the path is not necessarily a shortest path between its origin and destination, and can be split up into a small number of segments, each of which is a shortest or least cost path. Two consecutive segments are separated by split vertices. Split vertices act as intermediate destinations in the mind of travellers who try to hop between them using minimum cost paths. Hence they provide useful information to build route choice models. In this paper we identify and enumerate all possible decompositions of a path into a minimum number of shortest segments. This gives us an indication of the importance of split vertices occurring in particular sets of revealed routes that belong either to a single traveller or to a specific group. The proposed technique allows for automatic extraction of frequently used intermediate destinations (way-points) from revealed preference data. (C) 2017 The Authors. Published by Elsevier B.V. | Notes: | [Hartman, Irith Ben-Arroyo] Univ Haifa, Caesarea Rothschild Inst Interdisciplinary Applic, IL-31905 Haifa, Israel. [Knapen, Luk; Bellemans, Tom] Hasselt Univ, Transportat Res Inst IMOB, Diepenbeek, Belgium. | Keywords: | clique cover; proper interval graph; indifference graph; transportation network; route choice set generation; GPS traces;clique cover; proper interval graph; indifference graph; transportation network; route choice set generation; GPS traces | Document URI: | http://hdl.handle.net/1942/25742 | DOI: | 10.1016/j.procs.2017.05.325 | ISI #: | 000414533000024 | Category: | C1 | Type: | Proceedings Paper | Validations: | ecoom 2018 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
hartman 1.pdf | Published version | 968.75 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
1
checked on Sep 5, 2020
WEB OF SCIENCETM
Citations
1
checked on Apr 22, 2024
Page view(s)
16
checked on Sep 5, 2022
Download(s)
8
checked on Sep 5, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.