|
Title: Choice Set Generation for Modeling Scenic Route Choice Behavior with Geographic Information Systems
Accession Number: 01558143
Record Type: Component
Record URL: Availability: Transportation Research Board Business Office 500 Fifth Street, NW Find a library where document is available Abstract: Finding a scenic route between two locations is a common trip-planning task, in particular for tourists and recreational travelers. For the automated computation of a scenic route in a trip-planning system to function, it is necessary to understand which attributes of a route and its surroundings are associated with attractive scenery. One way to find this information is with a route choice model framework, which requires a choice set of realistic paths for traveling a scenic route. This paper proposes a constrained enumeration type algorithm for computing scenic alternatives with a branch-and-bound approach and a labeling algorithm in combination with link elimination to generate a scenic route choice set. These algorithms use volunteered geographic information—shared, geotagged photos (photos to which geographical identification metadata have been added) from Panoramio—to generate path alternatives. The results show that the proposed branch-and-bound algorithm replicated observe travel behavior better than the traditional deterministic minimum cost–based algorithms in terms of overlap and consistency. In addition, for the proposed branch-and-bound method, the average number of scenic clusters was almost identical to that found along observed scenic routes; this method outperformed all other evaluated algorithms for this aspect.
Monograph Title: Monograph Accession #: 01594381
Report/Paper Numbers: 15-5376
Language: English
Authors: Alivand, MajidHochmair, Hartwig HPagination: pp 101–111
Publication Date: 2015
ISBN: 9780309369565
Media Type: Print
Features: Figures
(4)
; References
(35)
; Tables
(2)
TRT Terms: Subject Areas: Highways; Planning and Forecasting
Files: TRIS, TRB, ATRI
Created Date: Dec 30 2014 1:48PM
More Articles from this Serial Issue:
|