A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time

<table>Continuously distributed VOTs for users between each OD pair <svg height="7.9499998" id="M37" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 12.225 7.9499998" width="12.225" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M689 332q0 -81 -40 -161.5t-103.5 -131.5t-127.5 -51q-32 0 -58.5 16t-40.5 46q-70 -62 -139 -62q-45 0 -77.5 30t-32.5 86q0 8 7 52q11 77 45 187q6 19 6 34q0 6 -7 6q-24 0 -78 -64l-20 23q32 48 73 77t78 29q32 0 32 -43q0 -30 -12 -73q-27 -95 -38 -152
q-8 -44 -8 -58q0 -77 68 -77q31 0 60 33.5t39 77.5l62 260l75 16l5 -6l-63 -246q-8 -29 -8 -58q0 -77 68 -77q66 0 116 75.5t50 194.5q0 43 -12 57q-11 12 -11 24q0 19 15 35.5t34 16.5q18 0 30.5 -34.5t12.5 -81.5z" id="x1D464"></path></g>
</svg>.</table>

Journal of Applied Mathematics

fig1

Figure 1

Figure 1: A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time 

Figure 1 | A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time 