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

doi:10.1016/j.procs.2012.06.108

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

Department of Computer Science

Research output: Contribution to journal › Conference article › peer-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 language	English
Pages (from-to)	833-839
Number of pages	7
Journal	Procedia Computer Science
Volume	10
DOIs	https://doi.org/10.1016/j.procs.2012.06.108
State	Published - 2012
Event	3rd 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 2012 → 29 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

General Computer Science

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/j.procs.2012.06.108

Cite this

@article{54c2457cb11d4d57bd39e44c962c9ae9,

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

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.",

keywords = "Agent-based, Carpooling, Graph theory, Matching, Modeling, Partitioning, Scalability",

author = "Daniel Keren and Yasar, {Ansar Ul Haque} and Luk Knapen and Sungjin Cho and Tom Bellemans and Davy Janssens and Geert Wets and Assaf Schuster and Izchak Sharfman",

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.; 3rd International Conference on Ambient Systems, Networks and Technologies, ANT 2012 and 9th International Conference on Mobile Web Information Systems, MobiWIS 2012 ; Conference date: 27-08-2012 Through 29-08-2012",

year = "2012",

doi = "10.1016/j.procs.2012.06.108",

language = "English",

volume = "10",

pages = "833--839",

journal = "Procedia Computer Science",

issn = "1877-0509",

publisher = "Elsevier",

}

TY - JOUR

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

AU - Keren, Daniel

AU - Yasar, Ansar Ul Haque

AU - Knapen, Luk

AU - Cho, Sungjin

AU - Bellemans, Tom

AU - Janssens, Davy

AU - Wets, Geert

AU - Schuster, Assaf

AU - Sharfman, Izchak

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

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Agent-based

KW - Carpooling

KW - Graph theory

KW - Matching

KW - Modeling

KW - Partitioning

KW - Scalability

UR - http://www.scopus.com/inward/record.url?scp=84897000861&partnerID=8YFLogxK

U2 - 10.1016/j.procs.2012.06.108

DO - 10.1016/j.procs.2012.06.108

M3 - Conference article

AN - SCOPUS:84897000861

SN - 1877-0509

VL - 10

SP - 833

EP - 839

JO - Procedia Computer Science

JF - Procedia Computer Science

T2 - 3rd International Conference on Ambient Systems, Networks and Technologies, ANT 2012 and 9th International Conference on Mobile Web Information Systems, MobiWIS 2012

Y2 - 27 August 2012 through 29 August 2012

ER -

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

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this