Analysis of the co-routing problem in agent-based carpooling simulation

Luk Knapen; Daniel Keren; Ansar Ul Haque Yasar; Sungjin Cho; Tom Bellemans; Davy Janssens; Geert Wets

doi:10.1016/j.procs.2012.06.106

Analysis of the co-routing problem in agent-based carpooling simulation

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

Department of Computer Science

Research output: Contribution to journal › Conference article › peer-review

Abstract

Carpooling can cut costs and help to solve congestion problems but does not seem to be popular. Behavioral models allow to study the incentives and inhibitors for carpooling and the aggregated effect on the transportation system. In activity based modeling used for travel forecasting, cooperation between actors is important both for schedule planning and revision. Carpooling requires cooperation while commuting which in turn involves co-scheduling and co-routing. The latter requires combinatorial optimization. Agent-based systems used for activity based modeling, contain large amounts of agents. The agent model requires helper algorithms that deliver high quality solutions to embedded optimisation problems using a small amount of resources. Those algorithms are invoked thousands of times during agent society evolution and schedule execution simulation. Solution quality shall be sufficient in order to guarantee realistic agent behavior. This paper focuses on the co-routing problem.

Original language	English
Pages (from-to)	821-826
Number of pages	6
Journal	Procedia Computer Science
Volume	10
DOIs	https://doi.org/10.1016/j.procs.2012.06.106
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 tot these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement nr 270833 ∗Corresponding author: Tel.:+32-11-269-126; Fax: +32-11-269-199 E-mail: luk.knapen@uhasselt.be

Keywords

Activity based modeling
Agent based modeling
Optimisation
Routing

ASJC Scopus subject areas

Computer Science (all)

Access to Document

10.1016/j.procs.2012.06.106

Cite this

@article{a014b0a93c894a72bbdd561654633654,

title = "Analysis of the co-routing problem in agent-based carpooling simulation",

abstract = "Carpooling can cut costs and help to solve congestion problems but does not seem to be popular. Behavioral models allow to study the incentives and inhibitors for carpooling and the aggregated effect on the transportation system. In activity based modeling used for travel forecasting, cooperation between actors is important both for schedule planning and revision. Carpooling requires cooperation while commuting which in turn involves co-scheduling and co-routing. The latter requires combinatorial optimization. Agent-based systems used for activity based modeling, contain large amounts of agents. The agent model requires helper algorithms that deliver high quality solutions to embedded optimisation problems using a small amount of resources. Those algorithms are invoked thousands of times during agent society evolution and schedule execution simulation. Solution quality shall be sufficient in order to guarantee realistic agent behavior. This paper focuses on the co-routing problem.",

keywords = "Activity based modeling, Agent based modeling, Optimisation, Routing",

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

note = "Funding Information: The research leading tot these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement nr 270833 ∗Corresponding author: Tel.:+32-11-269-126; Fax: +32-11-269-199 E-mail: luk.knapen@uhasselt.be; 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.106",

language = "English",

volume = "10",

pages = "821--826",

journal = "Procedia Computer Science",

issn = "1877-0509",

publisher = "Elsevier",

}

TY - JOUR

T1 - Analysis of the co-routing problem in agent-based carpooling simulation

AU - Knapen, Luk

AU - Keren, Daniel

AU - Yasar, Ansar Ul Haque

AU - Cho, Sungjin

AU - Bellemans, Tom

AU - Janssens, Davy

AU - Wets, Geert

N1 - Funding Information: The research leading tot these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement nr 270833 ∗Corresponding author: Tel.:+32-11-269-126; Fax: +32-11-269-199 E-mail: luk.knapen@uhasselt.be

PY - 2012

Y1 - 2012

N2 - Carpooling can cut costs and help to solve congestion problems but does not seem to be popular. Behavioral models allow to study the incentives and inhibitors for carpooling and the aggregated effect on the transportation system. In activity based modeling used for travel forecasting, cooperation between actors is important both for schedule planning and revision. Carpooling requires cooperation while commuting which in turn involves co-scheduling and co-routing. The latter requires combinatorial optimization. Agent-based systems used for activity based modeling, contain large amounts of agents. The agent model requires helper algorithms that deliver high quality solutions to embedded optimisation problems using a small amount of resources. Those algorithms are invoked thousands of times during agent society evolution and schedule execution simulation. Solution quality shall be sufficient in order to guarantee realistic agent behavior. This paper focuses on the co-routing problem.

AB - Carpooling can cut costs and help to solve congestion problems but does not seem to be popular. Behavioral models allow to study the incentives and inhibitors for carpooling and the aggregated effect on the transportation system. In activity based modeling used for travel forecasting, cooperation between actors is important both for schedule planning and revision. Carpooling requires cooperation while commuting which in turn involves co-scheduling and co-routing. The latter requires combinatorial optimization. Agent-based systems used for activity based modeling, contain large amounts of agents. The agent model requires helper algorithms that deliver high quality solutions to embedded optimisation problems using a small amount of resources. Those algorithms are invoked thousands of times during agent society evolution and schedule execution simulation. Solution quality shall be sufficient in order to guarantee realistic agent behavior. This paper focuses on the co-routing problem.

KW - Activity based modeling

KW - Agent based modeling

KW - Optimisation

KW - Routing

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

U2 - 10.1016/j.procs.2012.06.106

DO - 10.1016/j.procs.2012.06.106

M3 - Conference article

AN - SCOPUS:84896937817

SN - 1877-0509

VL - 10

SP - 821

EP - 826

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 -

Analysis of the co-routing problem in agent-based carpooling simulation

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this