Volume 47, Number 4, September-December 2013ROADEF 2012
|Page(s)||399 - 428|
|Section||Special ROADEF 2012|
|Published online||29 November 2013|
A multi-destination daily carpooling problem and an ant colony based resolution method
1 Univ Lille Nord de
2 UArtois, LGI2A, 62400, Béthune, France.
Accepted: 15 October 2013
The rising car usage deriving from growth in jobs and residential population causes air pollution, energy waste and consumption of people’s time. Public transport cannot be the only answer to this increasing transport demand. Carpooling, which is based on the idea that sets of car owners pick up colleagues while driving to or from the workplace, has emerged to be a viable possibility for reducing private car usage in congested areas. Its actual practice requires a suitable information system support and, the most important, the capability of effectively solving the underlying combinatorial optimization problem. This paper describes an ant colony algorithm based hybrid approach (HAC) for solving the multi-destination carpooling problem. Experiments have been performed to confirm the efficiency and the effectiveness of the approach.
Mathematics Subject Classification: 90B06
Key words: Transportation / vehicle routing / carpooling problem / ant colony algorithm
© EDP Sciences, ROADEF, SMAI 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.