Path-Constrained Traffic Assignment: A Trip Chain Analysis

摘要: This paper proposes and analyzes a distance-constrained traffic assignment problem with trip chains embedded in network flows. The purpose of studying this is to develop an appropriate modeling tool for characterizing flow patterns future transportation networks that serve massive adoption plug-in electric vehicles under the condition these suffer from “range anxiety” issue caused by unavailability public electricity-charging infrastructures far-below-expectation battery capacity. authors argue if range anxiety makes any impact on travel behaviors, it more likely such occurs tour or chain level rather than level. focus development solution methods proposed chains. Specifically, setting, individual traveler’s combined driving route activity site choice distance limit results distance-constrained, multi-site shortest path problem. numerical result derived illustrative example clearly shows mechanism magnitude settings reshaping pattern simple case characterized merely user equilibrium.