Path-constrained traffic assignment: A trip chain analysis under range anxiety

摘要: This paper proposes and analyzes a distance-constrained traffic assignment problem with trip chains embedded in equilibrium network flows. The purpose of studying this is to develop an appropriate modeling tool for characterizing flow patterns emerging transportation networks that serve massive adoption plug-in electric vehicles. need arises from the facts vehicles suffer “range anxiety” issue caused by unavailability or insufficiency public electricity-charging infrastructures far-below-expectation battery capacity. It suggested if range anxiety makes any impact on travel behaviors, it more likely occurs chain level rather than level, where here defined as series trips between two possible charging opportunities (Tamor et al., 2013). focus thus given development solution methods proposed problem. In paradigm, are basic unit individual decision making, traveler’s combined route activity location choices under distance limit results distance-constrained, node-sequenced shortest path A cascading labeling algorithm developed into linear approximation framework solutions. numerical result derived illustrative example clearly shows mechanism magnitude settings reshaping flows simple case characterized merely user equilibrium.