Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities-Reference-Cited by-同舟云学术

Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities

Published:2004-12 Issue:3 Volume:159 Page:529-544
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Han Deren,Lo Hong K.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference33 articles.

1. The traffic equilibrium problem with non-additive path costs;Gabriel;Transportation Science,1997

2. A dynamic traffic assignment formulation that encapsulates the cell transmission model;Lo,1999

3. A path-based traffic assignment algorithm using the TRANSYT traffic model;Wong;Transportation Research Part B,2001

4. Solving the non-additive traffic equilibrium problem;Bernstein,1997

5. Reformulating the traffic equilibrium problem via a smooth gap function;Lo;Mathematical and Computational Models,2000

Cited by 75 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-additive network pricing with non-cooperative mobility service providers;European Journal of Operational Research;2024-11

2. Convergence Analysis of Split-Douglas-Rachford Algorithm and a Novel Preconditioned ADMM with an Improved Condition;Numerical Mathematics: Theory, Methods and Applications;2024-06

3. A non-additive path-based reward credit scheme for traffic congestion management;Transportation Research Part E: Logistics and Transportation Review;2023-11

4. Traffic assignment problem for footpath networks with bidirectional links;Transportation Research Part C: Emerging Technologies;2022-11

5. Dynamic user optimal route choice problem on a signalized transportation network;Transportation Engineering;2022-11