Reference
D. Alves, J. van Ast, Z. Cong, B. De Schutter, and R. Babuška, "Ant
colony optimization for traffic dispersion routing,"
Proceedings of the 13th International IEEE Conference on Intelligent
Transportation Systems (ITSC 2010), Madeira Island, Portugal, pp.
683-688, Sept. 2010.
Abstract
Ant Colony Optimization (ACO) has proven to be a very powerful optimization
heuristic for combinatorial optimization problems. This paper introduces a new
type of ACO algorithm that will be used for routing along multiple routes in a
network as opposed to optimizing a single route. Contrary to traditional
routing algorithms, the Ant Dispersion Routing (ADR) algorithm has the
objective of determining recommended routes for every driver in the network, in
order to increase network efficiency. We present the framework for the new ADR
algorithm, as well as the design of a new cost function that translates the
motivations and objectives of the algorithm. The proposed approach is
illustrated with a small simulation-based case study for the Singapore
Expressway Network.
Publisher page
Downloads
BibTeX
@inproceedings{Alvvan:10-043,
author = {Alves, Diogo and van Ast, Jelmer and Cong, Zhe and De Schutter,
Bart and Babu{\v{s}}ka, Robert},
title = {Ant Colony Optimization for Traffic Dispersion Routing},
booktitle = {Proceedings of the 13th International IEEE Conference on
Intelligent Transportation Systems (ITSC 2010)},
address = {Madeira Island, Portugal},
pages = {683--688},
month = sep,
year = {2010}
}