Competitive Green-Vehicle Assignment on a Transportation Network

Abstract

Currently, there is a lack of methodological tools available to support decision makers with regard to encouraging the use of green vehicles and in the allocation of available green capacity. This chapter is devoted to the problem of green and non-green traffic flow assignment on a network consisting of green and non-green routes. The analysis of a competitive framework is performed, and an approach for defining green routes (i.e., green subnetworks) that are fully loaded and provide less travel time for green vehicles is developed using Wardrop and Nash traffic flow assignments. The conditions of a balanced green subnetwork are also defined explicitly for a network of parallel routes.