Search

Electrifying transportation in the form of the large-scale development of electric vehicles (EVs) plays a pivotal role in reducing urban atmospheric pollution and alleviating fossil fuel dependence. However, the rising scale of EV deployment is exposing problems that were previously hidden in small-scale EV applications, and the lack of large-scale EV operating data deters relevant explorations. Here, we report several issues related to the battery utilization and energy consumption of urban-scale EVs by connecting three unique datasets of real-world operating states of over 3 million Chinese EVs, operational data, and vehicle feature data. Meanwhile, by incorporating climatic data and EV data outside China, we extend our models to several metropolitan areas worldwide. We find that blindly increasing the battery energy of urban EVs could be detrimental to sustainable development. The impact of changes in the energy consumption of EVs would be exacerbated in large-scale EV utilization, especially during seasonal shifts. For instance, even with a constant monthly driving demand, the average energy consumption of Beijing light-duty EVs would change by up to 21% during winter-spring shifts. Our results may also prove useful for research on battery resources, urban power supply, environmental impacts, and policymaking. [ABSTRACT FROM AUTHOR]

We introduce and study a challenging service network design problem arising within a city logistics company based in Beijing, China. To provide cost-effective same-day delivery services, the company divides the whole urban area into regions. Within each region, a fleet of small-capacity vehicles picks up and delivers packages. A fleet of line-haul vehicles (large-capacity vehicles) executes consistent multiple trips over the regions to transport consolidated packages, during which transshipment is allowed. In this study, we focus on designing the trips of line-haul vehicles, i.e., their region visiting sequences, as the performance of the logistics system depends significantly on the coordination of line-haul vehicles. We model the trip design problem as a service network design problem with consistent multiple trips. We develop a continuous-time MIP model to formulate the problem and optimally solve small-size instances. In addition, we propose an adaptive large neighborhood search heuristic to solve larger instances. Numerical experiments on randomly generated instances as well as real-world operational data demonstrate the effectiveness and efficiency of our solution approach. • The service network design problem with consistent multiple trips is introduced. • A continuous-time mixed integer programming model is formulated. • An adaptive large neighborhood search solution algorithm is developed. • The model and solution algorithm are demonstrated on real-world operational data. [ABSTRACT FROM AUTHOR]