Exploiting graph-theoretic tools for matching and partitioning of agent population in an agent-based model for traffic and transportation applications

Daniel Keren, Ansar Ul Haque Yasar, Luk Knapen, Sungjin Cho, Tom Bellemans, Davy Janssens, Geert Wets, Assaf Schuster, Izchak Sharfman

Research output: Contribution to journalConference articlepeer-review

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 sub-populations 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.

Original languageEnglish
Pages (from-to)833-839
Number of pages7
JournalProcedia Computer Science
Volume10
DOIs
StatePublished - 2012
Event3rd International Conference on Ambient Systems, Networks and Technologies, ANT 2012 and 9th International Conference on Mobile Web Information Systems, MobiWIS 2012 - Niagara Falls, ON, Canada
Duration: 27 Aug 201229 Aug 2012

Bibliographical note

Funding Information:
The research leading to these results has received funding from the European Framework Programme (FP7/2007-2013) under grant agreement number 270833.

Keywords

  • Agent-based
  • Carpooling
  • Graph theory
  • Matching
  • Modeling
  • Partitioning
  • Scalability

ASJC Scopus subject areas

  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Exploiting graph-theoretic tools for matching and partitioning of agent population in an agent-based model for traffic and transportation applications'. Together they form a unique fingerprint.

Cite this