Search

Effective utilization of charging station capacity plays an important role in enhancing the profitability of ride-hailing systems using electric vehicles. Existing studies assume constant energy prices and uncapacitated charging stations or do not explicitly consider vehicle queueing at charging stations, resulting in over-optimistic charging infrastructure utilization. In this study, we develop a dynamic charging scheduling method (named CongestionAware) that anticipates vehicles' energy needs and coordinates their charging operations with real-time energy prices to avoid long waiting time at charging stations and increase the total profit of the system. A sequential mixed integer linear programming model is proposed to devise vehicles' day-ahead charging plans based on their experienced charging waiting times and energy consumption. The obtained charging plans are adapted within the day in response to vehicles' energy needs and charging station congestion. The developed charging policy is tested using NYC yellow taxi data in a Manhattan-like study area with a fleet size of 100 vehicles given the scenarios of 3000 and 4000 customers per day. The computational results show that our CongestionAware policy outperforms different benchmark policies with up to +15.06% profit and +19.16% service rate for 4000 customers per day. Sensitivity analysis is conducted with different system parameters and managerial insights are discussed.

Meeting-point-based feeder services using EVs have good potential to achieve an efficient and clean on-demand mobility service. However, customer-to-meeting-point, vehicle routing, and charging scheduling need to be jointly optimized to achieve the best system performance. To this aim, we assess the effect of different system parameters and configure them based on our previously developed hybrid metaheuristic algorithm. A set of test instances based on morning peak hour commuting scenarios between the cities of Arlon and Luxembourg are used to evaluate the impact of the set parameters on the optimal solutions. The experimental results suggest that higher meeting point availability can achieve better system performance. By jointly configuring different system parameters, the overall system performance can be significantly improved (-10.8% total kilometers traveled by vehicles compared to the benchmark) to serve all requests. Our experimental results show that the meeting-point-based system can reduce up to 70.2% the fleet size, 6.4% the in-vehicle travel time and 49.4% the kilometers traveled when compared to a traditional door-to-door dial-a-ride system.

This paper addresses the on-demand meeting-point-based feeder electric bus routing and charging scheduling problem under charging synchronization constraints. The problem considered exhibits the structure of the location routing problem, which is more difficult to solve than many electric vehicle routing problems with capacitated charging stations. We propose to model the problem using a mixed-integer linear programming approach based on a layered graph structure. An efficient hybrid metaheuristic solution algorithm is proposed. A mixture of random and greedy partial charging scheduling strategies is used to find feasible charging schedules under the synchronization constraints. The algorithm is tested on instances with up to 100 customers and 49 bus stops/meeting points. The results show that the proposed algorithm provides near-optimal solutions within less one minute on average compared with the best solutions found by a mixed-integer linear programming solver set with a 4-hour computation time limit. A case study on a larger sized case with 1000 customers and 111 meeting points shows the proposed method is applicable to real-world situations.

A Mathematical Program with Equilibrium Constraints (MPEC) is formulated to capture the relationships between multiple Mobility Service Providers (MSPs) and the users of a multi-modal transport network. The network supply structure is defined through a novel supernetwork approach where users' daily trip chains are represented to model the mobility services used to reach each destination. At the upper level, a profit maximization formulation is introduced to describe each MSPs' behaviour. At the lower level, users within a class choose minimum cost routes, according to Wardrop's first equilibrium principle. To consider the interactions between modes, non-separable costs between supernetwork links are defined, and users' equilibrium conditions are formulated as a Variational Inequality (VI). To solve the MPEC, an iterative solution algorithm based on a Modified Projection Method is proposed. Numerical examples are presented to illustrate properties of the model, and to examine scenarios showcasing cooperation or competition strategies between MSPs.

Studies of the effect of network structure on performance have, thus far, been restricted to examining ensembles of synthetic networks generated by canonical models from the Network Science literature, which do not plausibly represent real road networks. Furthermore disparate ranges of parameter settings for demand and supply structure are often used, making it difficult to compare one study with another. To address these deficiencies, this paper proposes an experimental framework for the design of numerical investigations to study how network performance varies with respect to the structural properties of urban road networks. The key step within this experimental framework is the generation of a spectrum of ensembles of synthetic networks, which vary with respect to a single aspect of network structure and which adhere to plausibility constraints that ensure relevance to real urban road networks. This paper then demonstrates the application of this experimental framework to an investigation of how two performance indicators; the average link Volume-to-Capacity ratio and the Price of Anarchy, vary with respect to the density of travel demand, and the size, density and connectivity of network infrastructure. In so doing, several key challenges of such investigations are identified, with respect to the computational burden of the experiments and the need for empirical data on some important aspects of network structure such as the distribution of capacity.