Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/16303
Title: | Agent-based modeling for carpooling | Authors: | KNAPEN, Luk YASAR, Ansar CHO, Sungjin BELLEMANS, Tom |
Issue Date: | 2014 | Publisher: | Information Science Reference (an imprint of IGI Global) | Source: | Janssens, Davy ; Yasar, Ansar-Ul-Haque ; Knapen, Luk (Ed.). Data Science and Simulation in Transportation Research, p. 232-258 | Series/Report: | Advances in Data Mining and Database Management (ADMDM) Book Series | Abstract: | Modeling activities and travel for individuals in order to estimate traffic demand leads to large scale simulations. Most current models simulate individuals acting in a mutually independent way except for the use of the shared transportation infrastructure. As soon as cooperation between autonomous individuals is accounted for, the individuals are linked to each other in a network structure and interact with their neighbours in the network while trying to achieve their own goals. In concrete traffic-related problems, those networks can grow very large. Optimization over such networks typically leads to combinatorially explosive problems. In this chapter, the case of providing optimal advice to combine carpooling candidates is considered. First, the advisor software structure is explained; then, the characteristics for the carpooling candidates network derived for Flanders (Belgium) are calculated in order to estimate the problem size. | Document URI: | http://hdl.handle.net/1942/16303 | Link to publication/dataset: | http://www.igi-global.com/book/data-science-simulation-transportation-research/78944#table-of-contents | ISBN: | 9781466649200 | DOI: | 10.4018/978-1-4666-4920-0.ch012 | ISI #: | 000364530200014 | Category: | B2 | Type: | Book Section | Validations: | vabb 2017 |
Appears in Collections: | Research publications |
Show full item record
SCOPUSTM
Citations
1
checked on Sep 2, 2020
Page view(s)
88
checked on Sep 6, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.