Answers are grounded in this paper and cite their sources.
Solving the traffic assignment problem (TAP) is an important step towards an efficient usage of the traffic infrastructure. A fundamental assignment model is the so-called User Equilibrium (UE), which may turn into a complex optimisation problem. In this paper, we present the use of the GRASP metaheuristic to approximate the UE of the TAP. A path relinking mechanism is also employed to promote a higher coverage of the search space. Moreover, we propose a novel performance evaluation function, which measures the number of vehicles that have an incentive to deviate from the routes to which they were assigned. Through experiments, we show that our approach outperforms classical algorithms, providing solutions that are, on average, significantly closer to the UE. Furthermore, when compared to classical methods, the fairness achieved by our assignments is considerably better. These results indicate that our approach is efficient and robust, producing reasonably stable assignments.
No takes yet. Share an insight, caveat, or question.
Ramos et al. (2015) studied this question.