As the last process of traditional "four processes" management method, traffic assignment plays an important role both in theory and practice. UE traffic assignment is a basic problem in the field of urban traffic equilibrium assignment and many studies focus on it. Ant colony algorithm is a new simulating evolution algorithm which has solved many typical combinatorial optimization problems. This paper tries to solve UE traffic assignment problem with ant colony algorithm and improve the goal function value and the formula of transition probability according to the character of UE traffic assignment. The algorithm may get brush-fire optimum result and stop earlier in large scale problems. To solve this problem, this paper optimizes the formula of trail pheromone increment and use max-min ant system to limit the concentration of path pheromone into a scope. Finally, a numerical example is given to prove the feasibility and validity of this algorithm; the result is also compared with the one gotten by traditional algorithm.
An Improved Ant Colony Algorithm for UE Traffic Assignment Problem
Seventh International Conference of Chinese Transportation Professionals Congress (ICCTP) ; 2007 ; Shanghai, China
2008-03-21
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Origin-Based Algorithm for the Traffic Assignment Problem
Online Contents | 2002
|Origin-Based Algorithm for the Traffic Assignment Problem
British Library Online Contents | 2002
|Reduced gradient algorithm for user equilibrium traffic assignment problem
Taylor & Francis Verlag | 2020
|An Efficient Algorithm for a Bicriterion Traffic Assignment Problem
British Library Conference Proceedings | 1996
|