Title: SOLUTION OF THE ASYMMETRIC TRAFFIC ASSIGNMENT PROBLEM BY SIMULATED ANNEALING
Abstract: The asymmetric traffic assignment problem can only be expressed as a non-convex optimization problem. This means that calculation of an equilibrium flow requires minimization of an objective function which may have multiple local minima. Simulated annealing is a state of the art global optimization technique which demands very little knowledge of the structure of the problem at hand. It is shown that a simulated annealing algorithm can solve the asymmetric traffic assignment problem under very general circumstances, including cases where the link cost- flow functions are neither monotonic nor smooth. (A)
Publication Year: 1993
Publication Date: 1993-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot