Abstract
In this paper, we discuss a nonadditive path costs traffic assignment problem considering emission effects. Based on Venigalla's research, we put forward the traffic assignment model considering emissions at different engine operating modes. We also use two path-based algorithms, gradient projection (GP) algorithm and disaggregated simplicial decomposition (DSD) algorithm to solve the mathematic model respectively. Then, we apply the model as well as the algorithms into a real network and compare some computational characteristics of them. The results show that both GP and DSD algorithms have a rapid convergence speed than FW algorithm. The results also demonstrate that path-based algorithms can be widely used in solving large scale traffic assignment problem with nonadditive path costs.
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.
