A Mixed Traffic Assignment Problem and Its Upper Bound of Efficiency Loss
A variational inequality (VI) formulation of a mixed traffic assignment problem associated with user equilibrium (UE) player and altruistic players (UE-AP) is developed. The users governed by the UE player use the paths with minimum actual travel cost, while the users governed by altruistic players...
Saved in:
Main Authors: | Xiao-Jun Yu, Jiancheng Long |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/290972 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Study on the Coordination of Urban Traffic Control and Traffic Assignment
by: ZhaoWei Qu, et al.
Published: (2012-01-01) -
Cost-efficient assignment panel for ducks. Setup of a cost-efficient assignment panel for duck populations.
by: Chapuis, Hervé, et al.
Published: (2024-09-01) -
Upper and Lower Bounds for Capital and Wages
by: Alberto Benítez Sánchez, et al.
Published: (2012-01-01) -
A Two-Phase Gradient Projection Algorithm for Solving the Combined Modal Split and Traffic Assignment Problem with Nested Logit Function
by: Seungkyu Ryu, et al.
Published: (2021-01-01) -
The Airport Gate Assignment Problem: A Survey
by: Abdelghani Bouras, et al.
Published: (2014-01-01)