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: [email protected]
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 - https://doi.org/10.1016/j.procs.2012.06.106
DO - https://doi.org/10.1016/j.procs.2012.06.106
M3 - Conference article
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 -
