Abstract
As the last process of traditional four processes management method, traffic assignment plays an important role both in theory and practice. User Equilibrium (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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
