www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/16973

Title: Analysis of the Co-routing Problem in Agent-based Carpooling Simulation
Authors: Knapen, Luk
Keren, Daniel
Yasar, Ansar-Ul-Haque
Cho, Sungjin
Bellemans, Tom
Janssens, Davy
Wets, Geert
Issue Date: 2012
Publisher: ELSEVIER SCIENCE BV
Citation: Shakshuki, E Younas, M (Ed.). ANT 2012 AND MOBIWIS 2012, p. 821-826
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. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of [name organizer]
Notes: [Knapen, Luk; Yasar, Ansar-Ul-Haque; Cho, Sungjin; Bellemans, Tom; Janssens, Davy; Wets, Geert] Hasselt Univ, B-3950 Diepenbeek, Belgium.
URI: http://hdl.handle.net/1942/16973
DOI: 10.1016/j.procs.2012.06.106
ISI #: 000314400700100
ISSN: 1877-0509
Category: C1
Type: Proceedings Paper
Validation: ecoom, 2014
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published Version172.26 kBAdobe PDF

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