A network equilibrium analysis on destination, route and parking choices with mixed gasoline and electric vehicular flows

EURO Journal on Transportation and Logistics

Volumn 3, Issue 1, 2014, Pages 55-92

  Jiang, Nan ^a   Xie, Chi ^a,b,c   Duthie, Jennifer C ^a   Waller, S Travis ^d  

^a The University of Texas at Austin   (United States)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

^c TSINGHUA UNIVERSITY   (China)

^d UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Distance constraint; Electric vehicles; Network equilibrium; Partial linearization method; Travel choices; Travel demand analysis

Indexed keywords

EID: 85064289276     PISSN: 21924376     EISSN: 21924384     Source Type: Journal    
DOI: 10.1007/s13676-013-0021-5     Document Type: Article

References (58)

1. Akamatsu T (1996) Cyclic flows, Markov processes and stochastic traffic assignment. Transp Res Part B 30(5):369–386
2. Anas A (1983) Discrete choice theory, information theory and the multinomial logit and gravity models. Transp Res Part B 17(1):13–23
3. Anderson SP, de Palma A (2004) The economics of pricing parking. J Urban Econ 55(1):1–20
4. Axhausen KW, Polak J (1991) Choice of parking: stated preference approach. Transportation 18(1):59–81
5. Bar-Gera H (2002) Origin-based algorithm for the traffic assignment problem. Transp Sci 36(4):398–417
6. Becker TA, Sidhu I, Tenderich B (2009) Electric vehicles in the United States: a new model with forecasts to 2030. Center for Entrepreneurship and Technology, University of California, Berkeley, CA
7. Beckmann MJ, McGuire CB, Winsten CB (1956) Studies in the economics of transportation. Yale University Press, New Haven
8. Ben-Akiva ME, Lerman SR (1985) Discrete choice analysis: theory and application to travel demand. The MIT Press, Cambridge
9. Bifulco GN (1993) A stochastic user equilibrium assignment model for the evaluation of parking policies. Eur J Oper Res 71(2):269–287
10. Chen A, Lee DH, Jayakrishnan R (1999) Computational study of state-of-the-art path-based traffic assignment algorithms. Math Comput Simulat 59(6):509–518
11. Clark SD, Watling DP (2002) Sensitivity analysis of the probit-based stochastic user equilibrium assignment model. Transp Res Part B 36(7):617–635
12. Correa JR, Stier-Moses NE (2011) Wardrop equilibria. In: Cochran JJ (ed) Encyclopedia of operations research and management science. Wiley, New York
13. Dafermos SC (1972) The assignment problem for multiclass-user transportation networks. Transp Sci 6(1):73–87
14. Dial RB (2006) A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transp Res Part B 40(10):917–936
15. Dijkstra E (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271
16. Dumitrescu I, Boland N (2003) Improved preprocessing, labeling and scaling algorithm for the resource-constrained shortest path problem. Networks 42(3):135–153
17. Erlander S (1990) Efficient population behavior and the simultaneous choices of origins, destinations and routes. Transp Res Part B 24(5):363–373
18. Evans SP (1976) Derivation and analysis of some models for combining trip distribution and assignment. Transp Res 10(1):37–57
19. Florian M, Los M (1980) Impact of the supply of parking spaces on parking lot choice. Transp Res Part B 14(1–2):155–163
20. Florian M, Nguyen S (1978) A combined trip distribution, modal split and trip assignment model. Transp Res 12(1):241–246
21. Florian M, Nguyen S, Ferland J (1975) On the combined distribution-assignment of traffic. Transp Sci 9(1):43–53
22. Florian M, Guélat J, Spiess H (1987) An efficient implementation of “PARTAN” variant of the linear approximation method for the network equilibrium problem. Networks 17(3):319–339
23. Florian M, Constantin I, Florian D (2009) A new look at the projected gradient method for equilibrium assignment. Transp Res Rec 2090:10–16
24. Friesz TL (1981) An equivalent optimization problem for combined multiclass distribution, assignment and modal split which obviates symmetry restrictions. Transp Res Part B 15(5):361–369
25. Gur YJ, Beimborn EA (1984) Analysis of parking in urban centers: equilibrium assignment approach. Transp Res Rec 957:55–62
26. Hearn DW (1980) Bounding flows in traffic assignment models. Research Report 80-4, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL
27. Ho HW, Wong SC, Loo BPY (2006) Combined distribution and assignment model for a continuum traffic equilibrium problem with multiple user classes. Transp Res Part B 40(8):633–650
28. Jahn O, Mohring RH, Schulz AS, Stier-Moses NE (2005) System-optimal routing of traffic flows with user constraints in networks with congestion. Oper Res 53(4):600–616
29. Jayakrishnan R, Tsai WK, Prashker JN, Pajadhyaksha S (1993) Faster path-based algorithm for traffic assignment. Transp Res Rec 1443:75–83
30. Jiang N, Xie C, Waller ST (2012) Path-constrained traffic assignment: model and algorithm. Transp Res Rec 2283:25–33
31. Kezunovic M, Waller ST (2011) Role of PHEVs and BEVs in coupled power and transportation systems. Technical Report, Center for Electric Vehicles: Transportation and Electricity Convergence (EV-TEC), University of Texas at Austin, Austin, TX
32. Lam WHK, Huang HJ (1992) A combined trip distribution and assignment model for multiple user classes. Transp Res Part B 26(4):275–287
33. Lam WHK, Li ZC, Huang HJ, Wong SC (2006) Modeling time-dependent travel choice problems in road networks with multiple user classes and multiple parking facilities. Transp Res Part B 40(5):368–395
34. Lambe TA (1996) Driver choice parking in the city. Socio-Econ Plann Sci 30(3):207–219
35. Laporte G, Pascoal MMB (2011) Minimum cost path problems with relays. Comput Oper Res 38(1):165–173
36. Larsson T, Patriksson M (1992) Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transp Sci 26(1):4–17
37. Larsson T, Patriksson M (1995) An augmented Largrangean dual algorithm for link capacity side constrained traffic assignment problems. Transp Res Part B 29(6):433, 355
38. Larsson T, Patriksson M (1999) Side constrained traffic equilibrium models—analysis, computation and applications. Transp Res Part B 33(4):233–264
39. LeBlanc LJ, Morlok EK, Pierskalla W (1975) An efficient approach to solving the road network equilibrium traffic assignment problem. Transp Res 9(5):309–318
40. LeBlanc LJ, Helgason RV, Boyce DE (1985) Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transp Sci 19(4):445–462
41. Leurent F (1998) Sensitivity and error analysis of the dual criteria traffic assignment model. Transp Res Part B 32(3):189–204
42. Lundgren JT, Patriksson M (1998) The combined distribution and stochastic assignment problem. Ann Oper Res 82(1):309–329
43. Marrow K, Karner D and Francfort J (2008) Plug-in hybrid electric vehicle charging infrastructure review. Report INL/EXT-08-15058, US Department of Energy, Washington, DC
44. Mock P, Schmid S, Friendrich H (2010) Market prospects of electric passenger vehicles, Chapter 1. In: Pistoria G (ed) Electric and hybrid vehicles: power sources, models, sustainability, infrastructure and the market. Elsevier, Amsterdam
45. Nguyen S (1974) An algorithm for the traffic assignment problem. Transp Sci 8(3):203–216
46. Nie Y (2010) A class of bush-based algorithms for the traffic assignment problem. Transp Res Part B 44(1):73–89
47. Nie Y, Zhang HM, Lee DH (2004) Models and algorithms for the traffic assignment problem with link capacity constraints. Transp Res Part B 38(4):285–312
48. Nour Eldin MS, El-Reedy TY, Ismail HK (1981) A combined parking and traffic assignment model. Traffic Eng Control 22(10):524–530
49. Oppenheim N (1993) Equilibrium trip distribution/assignment with variable destination costs. Transp Res Part B 27(3):207–217
50. San Francisco Municipal Transportation Agency (SFMTA) (2011) SFMTA announces improved SFpark pricing strategy for city-owned garages. http://www.sfmta.com/cms/apress/SFMTAAnnouncesImprovedSFparkPricingStrategyforCity-OwnedGarages.htm. Accessed 20 Nov 2011
51. Smith OJ, Boland N, Waterer H (2012) Solving shortest path problems with a weight constraint and replenishment arcs. Comput Oper Res 39(5):964–984
52. Thompson RG, Richardson AJ (1998) A parking search model. Transp Res Part A 32(3):159–170
53. Tobin RL, Friesz TL (1988) Sensitivity analysis for equilibrium network flow. Transp Sci 22(4):242–250
54. US Department of Energy (DOE) (2011) Electric charging station locations. http://www.afdc.energy.gov/afdc/fuels/electricity_locations.html. Accessed 3 Sept 2011
55. US Energy Information Administration (EIA) (2010). Annual Electric Power Industry Report. http://www.eia.doe.gov/cneaf/electricity/epa/epa_sum.html. Accessed 5 Oct 2011
56. Wong KI, Wong SC, Wu JH, Yang H, Lam WHK (2004) A combined distribution, hierarchical mode choice, and assignment network model with multiple user and mode classes. In: Lee DH (ed) Urban and regional transportation modeling: essays in honor of David Boyce. Edward Elgar Publishing, Northampton, pp 25–42
57. Yang H (1997) Sensitivity analysis for the elastic-demand network equilibrium problem with applications. Transp Res Part B 31(1):55–70
58. Ying JQ, Miyagi T (2001) Sensitivity analysis for stochastic user equilibrium network flows—a dual approach. Transp Sci 35(2):124–133