A Trip-Chain Based Traffic Assignment Model of Electric Vehicles

Please enable javascript in your browser.

Tarighati Tabesh, Mahmood | 2018

565 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 50704 (09)
University: Sharif University of Technology
Department: Civil Engineering
Advisor(s): Zokaei Aashtiani, Hedayat
Abstract:
The goal of this research is to solve the traffic assignment of electric vehicles with considering trip chains. Limited driving range of electric vehicles is considered as one the most important obstacles for the development of these cars. The worry that the battery will run out of power before the destination is an important issue regarding the electric cars and people usually experience it more in trip chains. In this research, a complementary model and a linearization method is used for traffic assignment. In determining shortest paths in the traffic assignment, in addition to considering the travel time and the distance limit, the constraint of passing through activity nodes is considered. A new shortest path algorithm is presented in this work that is able to find the shortest path from one node to all nodes in the network. The proposed algorithm for traffic assignment is implemented for Nguyen and Wang networks. In an extra work, with considering fueling as an activity, the traffic assignment problem of gasoline vehicles is solved for Sioux-Falls and Mashhad Networks
Keywords:
Trip Chain ; Traffic Assignment ; Shortest Path ; Electric Motor Vehicles ; Direct Linearization Method ; Complementary Traffic Assignment

No TOC