Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/14392

Title: Exploiting graph-theorectic tools for matching and partitioning of agent population in an agent-based model for traffic and transportation applications
Authors: Keren, Daniel
Yasar, Ansar-Ul-Haque
Knapen, Luk
Cho, Sungjin
Bellemans, Tom
Janssens, Davy
Wets, Geert
Schuster, Assaf
Sharfman, Izchak
Issue Date: 2012
Citation: Shakshuki, Elhadi; Younas, Muhammad (Ed.). Procedia Computer Science 10 (2012), p. 833-839
Series/Report: Procedia Computer Science
Series/Report no.: 10
Abstract: In this position paper, we exploit the tools from the realm of graph theory to matching and portioning problems of agent population in an agent-based model for traffic and transportation applications. We take the agent-based carpooling application as an example scenario. The first problem is matching, which concerns finding the optimal pairing among agents. The second problem is partitioning, which is crucial for achieving scalability and for other problems that can be parallelized by separating the passenger population to subpopulations such that the interaction between different sub-populations is minimal. Since in real-life applications the agent population, as well as their preferences, very often change, we also discuss incremental solutions to these problems.
URI: http://hdl.handle.net/1942/14392
DOI: 10.1016/j.procs.2012.06.108
ISI #: 000314400700102
ISSN: 1877-0509
Category: C1
Type: Proceedings Paper
Validation: ecoom, 2014
vabb, 2014
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A349.15 kBAdobe PDF

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