An ANTS Heuristic for the Long — Term Car Pooling Problem

Abstract

The rising auto usage deriving from growth in jobs and residential population is making traffic congestion less tolerable in urban and suburban areas. This results in air pollution, energy waste and unproductive and unpleasant consumption of people’s time. Public transport cannot be the only answer to this increasing transport demand. Car pooling 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, most important, the capability of effectively solving the underlying combinatorial optimization problem. This paper presents an application of the ANTS approach, one of the approaches which follow the Ant Colony Optimization (ACO) paradigm, to the car pooling optimization problem. Computational results are presented both on datasets derived from the literature about problems similar to car pooling and on real-world car pooling instances.