This paper develops path-based algorithms to solve the C-logit stochastic user equilibrium (SUE) problem on the basis of an adaptation of the gradient projection method. The algorithms' strategies for step size determination differ. Three strategies are investigated: (a) predetermined step size, (b) Armijo line search, and (c) self-adaptive line search. The algorithms are tested on the well-known Winnipeg (Manitoba, Canada) network. Two sets of experiments are conducted: (a) a computational comparison of different line search strategies and (b) the impact of different modeling specifications for route overlapping (a flow-independent or a flow-dependent commonality factor). The results indicate that the path-based algorithm with the self-adaptive step size strategy performs better than the other step size strategies. The paper shows that, depending on the model parameters, particularly the commonality factor parameter, the C-logit SUE flows may be quite different from the multinomial logit SUE flows.
Get full access to this article
View all access options for this article.
References
1.
DialR. B.A Probabilistic Multipath Traffic Assignment Algorithm Which Obviates Path Enumeration.Transportation Research, Vol. 5, No. 2, 1971, pp. 83–113.
2.
DaganzoC.F., and SheffiY.. On Stochastic Models of Traffic Assignment.Transportation Science, Vol. 11, No. 3, 1977, pp. 253–274.
3.
FiskC.Some Developments in Equilibrium Traffic Assignment.Transportation Research Part B, Vol. 14, No. 3, 1980, pp. 243–255.
SheffiY., and PowellW.. A Comparison of Stochastic and Deterministic Traffic Assignment over Congested Networks.Transportation Research Part B, Vol. 15, No. 1, 1981, pp. 53–64.
6.
MaherM.SAM—A Stochastic Assignment Model. In Mathematics in Transport Planning and Control (GriffithsJ. D., ed.), Oxford University Press, Oxford, United Kingdom, 1992, pp. 121–132.
7.
RosaA., and MaherM. J.Algorithms for Solving the Probit Path-Based Stochastic User Equilibrium Traffic Assignment Problem with One or More User Classes.Proc., 15th International Symposium on Transportation and Traffic Theory, Adelaide, Australia, 2002, pp. 371–392.
8.
BekhorS., and PrashkerJ. N.Formulations of Extended Logit Stochastic User Equilibrium Assignments.Proc., 14th International Symposium on Transportation and Traffic Theory, Jerusalem, Israel, 1999, pp. 351–372.
9.
BekhorS., and PrashkerJ. N.Stochastic User Equilibrium Formulation for Generalized Nested Logit Model. In Transportation Research Record: Journal of the Transportation Research Board, No. 1752, TRB, National Research Council, Washington, D.C., 2001, pp. 84–90.
10.
PrashkerJ.N., and BekhorS.. Route Choice Models Used in the Stochastic User Equilibrium Problem: A Review.Transport Reviews, Vol. 24, No. 4, 2004, pp. 437–463.
11.
PratoC. G.Route Choice Modeling: Past, Present and Future Research Directions.Journal of Choice Modelling, Vol. 2, No. 1, 2009, pp. 65–100.
12.
CascettaE., NuzzoloA., RussoF., and VitettaA.. A Modified Logit Route Choice Model Overcoming Path Overlapping Problems: Specification and Some Calibration Results for Interurban Networks.Proc., International Symposium on Transportation and Traffic Theory, Lyon, France, 1996, pp. 697–711.
13.
CascettaE., RussoF., ViolaF.A., and VitettaA.. A Model of Route Perception in Urban Road Networks.Transportation Research Part B, Vol. 36, No. 7, 2002, pp. 577–592.
14.
Ben-AkivaM., and BierlaireM.. Discrete Choice Methods and Their Applications to Short Term Travel Decisions. In Handbook of Transportation Science (HallR., ed.), Kluwer, Dordrecht, Netherlands, 1999, pp. 7–38.
15.
YinY., MadanatS.M., and LuX. Y.Robust Improvement Schemes for Road Networks Under Demand Uncertainty.European Journal of Operational Research, Vol. 198, No. 2, 2009, pp. 470–479.
16.
ZhouZ., ChenA., and BekhorS.. C-Logit Stochastic User Equilibrium Model: Formulations and Solution Algorithm.Transportmetrica, Vol. 8, No. 1, 2012, pp. 17–41.
17.
MaherM.Algorithms for Logit-Based Stochastic User Equilibrium Assignment.Transportation Research Part B, Vol. 32, No. 8, 1998, pp. 539–549.
18.
Bell, M. G. H. Alternatives to Dial's Logit Assignment Algorithm.Transportation Research Part B, Vol. 29, No. 4, 1995, pp. 287–295.
19.
DambergO., LundgrenJ.T., and PatrikssonM.. An Algorithm for the Stochastic User Equilibrium Problem.Transportation Research Part B, Vol. 30, No. 2, 1996, pp. 115–131.
20.
BekhorS., and ToledoT.. Investigating Path-Based Solution Algorithms to the Stochastic User Equilibrium Problem.Transportation Research Part B, Vol. 39, No. 3, 2005, pp. 279–295.
21.
JayakrishnanR., TsaiW.K., PrashkerJ.N., and RajadhyakshaS.. Faster Path-Based Algorithm for Traffic Assignment. In Transportation Research Record 1443, TRB, National Research Council, Washington, D.C., 1994, pp. 75–83.
22.
ChenA., LeeD. -H., and JayakrishnanR.. Computational Study of State-of-the-Art Path-Based Traffic Assignment Algorithms.Mathematics and Computers in Simulation, Vol. 59, 2002, pp. 509–518.
23.
BekhorS., Ben-AkivaM. E., and RammingS.. Evaluation of Choice Set Generation Algorithms for Route Choice Models.Annals of Operations Research, Vol. 144, 2006, pp. 235–247.
24.
CascettaE., RussoF., and VitettaA.. Stochastic User Equilibrium Assignment with Explicit Path Enumeration: Comparison of Models and Algorithms. Proc., International Federation of Automatic Control: Transportation Systems, Chania, Greece, 1997, pp. 1078–1084.
25.
BekhorS., ToledoT., and PrashkerJ. N.Effects of Choice Set Size and Route Choice Models on Path-Based Traffic Assignment.Transportmetrica, Vol. 4, No. 2, 2008, pp. 117–133.
26.
NagurneyA., and ZhangD.. Projected Dynamical Systems and Variational Inequality with Applications.Kluwer, Dordrecht, Netherlands, 1996.
27.
BertsekasD. R.On the Goldstein–Levitin–Polyak Gradient Projection Method.IEEE Transactions on Automatic Control, Vol. 21, No. 2, 1976, pp. 174–184.
28.
ArmijoL.Minimization of Functions Having Continuous Partial Derivatives.Pacific Journal of Mathematics, Vol. 16, No. 1, 1966, pp. 1–3.
29.
HeB.S., YangH., MengQ., and HanD. R.Modified Goldstein–Levitin–Polyak Projection Method for Asymmetric Strongly Monotone Variational Inequalities.Journal of Optimization, Theory and Applications, Vol. 112, 2002, pp. 129–143.
30.
ChenA., ZhouZ., and XuX.. A Self-Adaptive Gradient Projection Algorithm for the Nonadditive Traffic Equilibrium Problem.Computers and Operations Research, Vol. 39, No. 2, 2012, pp. 127–138.
BekhorS., ReznikovaL., and ToledoT.. Application of Cross-Nested Logit Route Choice Model in Stochastic User Equilibrium Traffic Assignment. In Transportation Research Record: Journal of the Transportation Research Board, No. 2003, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 41–49.
