Parking permit management in a corridor with electric vehicles considering parking restraint

Le résumé fourni par la source

ABSTRACT In this paper, we investigate parking permit management in a many-to-one electric-vehicle (EV) corridor network in which each corridor is composed of a road-bottleneck path, a charging-bottleneck path and a parallel transit path. First, since the parking lot is available for multiple paths within a corridor, we show that the parking ending time for EV drivers on each path is a strictly increasing function of the number of parking spaces allocated to them under endogenous travel demand, which allows us to successfully analyze the user equilibrium in the one-to-one EV corridor. The problem is then formulated as a mixed-integer linear program (MILP). Second, the traffic pattern in the many-to-one corridor network considering parking space constraint is obtained, and a new bisection method to compute the equilibrium is proposed. We also theoretically analyze and numerically demonstrate the impact of network size on the computational efficiency of the algorithm. Third, we propose and compare the efficiencies of various schemes to eliminate both intra-corridor and inter-corridor competition for parking, such as system optimum parking permit allocation, Pareto improving parking permit allocation and tradable parking permit. Analytical and numerical examples are carried out to present that parking permits are extremely effective in traffic management of EVs.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.