Please use this identifier to cite or link to this item:
Main Title: Modeling Location Choice of Secondary Activities with a Social Network of Cooperative Agents
Author(s): Marchal, Fabrice
Nagel, Kai
Type: Article
Language Code: en
Abstract: Activity-based models in transportation science focus on the description of human trips and activities. Modeling the spatial decision for so-called secondary activities is addressed in this paper. Given both home and work locations, where do individuals perform activities such as shopping and leisure? Simulation of these decisions using random utility models requires a full enumeration of possible outcomes. For large data sets, it becomes computationally unfeasible because of the combinatorial complexity. To overcome that limitation, a model is proposed in which agents have limited, accurate information about a small subset of the overall spatial environment. Agents are interconnected by a social network through which they can exchange information. This approach has several advantages compared with the explicit simulation of a standard random utility model: (a) it computes plausible choice sets in reasonable computing times, (b) it can be extended easily to integrate further empirical evidence about travel behavior, and (c) it provides a useful framework to study the propagation of any newly available information. This paper emphasizes the computational efficiency of the approach for real-world examples.
Issue Date: 2005
Date Available: 6-Dec-2018
DDC Class: 380 Handel, Kommunikation, Verkehr
Subject(s): spatial decision
travel behavior
social network
leisure trips
Journal Title: Transportation Research Record
Publisher: SAGE Publications
Publisher Place: Washington, DC
Volume: 1935
Publisher DOI: 10.3141/1935-16
Page Start: 141
Page End: 146
EISSN: 2169-4052
ISSN: 0361-1981
Appears in Collections:FG Verkehrssystemplanung und Verkehrstelematik » Publications

Files in This Item:
File Description SizeFormat 
marchal_nagel_2005.pdf1.39 MBAdobe PDFThumbnail

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