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

Table 1

Generated paths, path costs, and VOTs.

Paths	Link set	Path flow	Path cost	VOT
Path 1	1-2-6-5-4-11-14-23-22-21-20	2.9481	166.7692	[1.0000, 1.1179]
Path 2	1-2-6-8-7-18-20	12.8851	163.4423	[1.1179, 1.9039]
Path 3	1-2-6-8-16-17-19-20	6.7645	151.2485	[1.6333, 1.9039]
Path 4	1-3-4-11-14-23-22-21-20	0.9821	124.8157	[1.9039, 1.9432]
Path 5	1-3-4-5-9-8-16-17-19-20	1.6310	122.9879	[1.9432, 2.0084]
Path 6	1-3-4-11-10-17-19-20	2.6448	122.7562	[2.0084, 2.1142]
Path 7	1-3-12-11-14-23-22-21-20	1.3288	121.6256	[2.1142, 2.1674]
Path 8	1-3-4-5-9-10-15-22-20	5.0010	121.1957	[2.1674, 2.3674]
Path 9	1-3-12-11-14-15-19-20	1.6379	120.9318	[2.3674, 2.4329]
Path 10	1-3-12-11-10-16-17-19-20	2.1797	120.5415	[2.4329, 2.5201]
Path 11	1-3-12-11-10-17-19-20	0.4598	119.5662	[2.5201, 2.5385]
Path 12	1-3-12-11-10-15-22-21-20	0.5293	119.2367	[2.5385, 2.5597]
Path 13	1-3-12-13-24-21-20	11.0078	117.8441	[2.5597, 3.0000]