In this paper, we propose an ACO-based algorithm that can be used to simulate mass-transit networks; this algorithm imitates the behaviour of public transport users. In particular, we show that the proposed algorithm, which is an extension of that proposed by D’Acierno et al. , allows mass-transit systems to be simulated in less time but with the same accuracy compared with traditional assignment algorithms. Finally, we state theoretically the perfect equivalence in terms of hyperpath choice behaviour between artificial ants (simulated with the proposed algorithm) and mass-transit users (simulated with traditional assignment algorithms).
|Titolo:||Ant Colony Optimisation approaches for the transportation assignment problem|
|Data di pubblicazione:||2010|
|Appare nelle tipologie:||2.1 Contributo in volume (Capitolo o Saggio)|