Skip to main content
eScholarship
Open Access Publications from the University of California

Stochastic Dynamic Itinerary Interception Refueling Location Problem with Queue Delay for Electric Taxi Charging Stations

Abstract

A new facility location model and a solution algorithm are proposed that feature 1) itinerary-interception instead of flow-interception; 2) stochastic demand as dynamic service requests; and 3) queueing delay. These features are essential to analyze battery-powered electric shared-ride taxis operating in a connected, centralized dispatch manner. The model and solution method are based on a bi-level, simulation-optimization framework that combines an upper level multiple-server allocation model with queueing delay and a lower level dispatch simulation based on earlier work by Jung and Jayakrishnan. The solution algorithm is tested on a fleet of 600 shared-taxis in Seoul, Korea, spanning 603 km2, a budget of 100 charging stations, and up to 22 candidate charging locations, against a benchmark “naïve” genetic algorithm that does not consider cyclic interactions between the taxi charging demand and the charger allocations with queue delay. Results show not only that the proposed model is capable of locating charging stations with stochastic dynamic itinerary-interception and queue delay, butt that the bi-level solution method improves upon the benchmark algorithm in terms of realized queue delay, total time of operation of taxi service, and service request rejections. Furthermore, we show how much additional benefit in level of service is possible in the upper-bound scenario when the number of charging stations approaches infinity.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View