کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478438 | 1446085 | 2012 | 11 صفحه PDF | دانلود رایگان |

In this paper we propose an Ant Colony Optimisation (ACO) algorithm for defining the signal settings on urban networks following a local approach. This consists in optimising the signal settings of each intersection of an urban network as a function only of traffic flows at the accesses to the same intersection, taking account of the effects of signal settings on costs and on user route choices. This problem, also known as Local Optimisation of Signal Settings (LOSS), has been widely studied in the literature and can be formulated as an asymmetric assignment problem. The proposed ACO algorithm is based on two kinds of behaviour of artificial ants which allow the LOSS problem to be solved: traditional behaviour based on the response to pheromones for simulating user route choice, and innovative behaviour based on the pressure of an ant stream for solving the signal setting definition problem. Our results on real-scale networks show that the proposed approach allows the solution to be obtained in less time but with the same accuracy as in traditional MSA (Method of Successive Averages) approaches.
► We propose an ACO algorithm for designing signal settings with a local approach.
► The algorithm is based on an MSA framework and improves convergence speed.
► The proposed algorithm is based on two kinds of behaviour of artificial ants.
► The algorithm is tested on real-scale networks and compared with other MSA algorithms.
► Numerical results show that the ACO algorithm significantly reduces computing times.
Journal: European Journal of Operational Research - Volume 217, Issue 2, 1 March 2012, Pages 459–469