Please use this identifier to cite or link to this item:
Title: Analysis of the co-routing problem in agent-based carpooling simulation
Authors: KNAPEN, Luk 
YASAR, Ansar 
CHO, Sungjin 
Keren, D.
WETS, Geert 
Issue Date: 2012
Source: The 1st International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications, Niagara Falls, Canada, 27-29 August 2012
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 modelling 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 modelling, 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.
Document URI:
Category: C2
Type: Conference Material
Appears in Collections:Research publications

Show full item record

Page view(s)

checked on May 25, 2022

Google ScholarTM


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