9 May 2023 in IEEE Transactions on Intelligent Transportation Systems
The emerging customized bus system based on modular autonomous electric vehicles (MAEVs) shows tremendous potential to improve the mobility, accessibility and environmental friendliness of a public transport system. However, the existing studies in this area almost focus on human-driven vehicles which face some striking limitations (e.g., restricted crew scheduling and fixed vehicle capacity) and can weaken the overall benefits. This paper proposes a two-phase optimization procedure to fully unleash the potential of MAEVs by leveraging the strengths of MAEVs, including automatic allocation and charging of modules. In the first phase, a mixed integer programming model is established in the space-time-state framework to jointly optimize the MAEV routing and charging, passenger-to-vehicle assignment and vehicle capacity management for reserved passengers. A Lagrangian relaxation algorithm is developed to solve the model efficiently. In the second phase, three dispatching strategies are designed and optimized by a dynamic dispatching procedure to properly adapt the operation of MAEVs to emerging travel demands. A case study conducted on a major urban area of Beijing, China, demonstrates the high efficiency of the MAEV adoption in terms of resource utilization and environmental friendliness across a range of travel demand distributions, vehicle supply and module capacity scenarios.
1 November 2018 in Journal of Transportation Engineering, Part A: Systems
In recent years, the customized bus (CB) has been introduced and popularized in China to improve the attraction and service level of public transportation. A key point of the CB system, the route design problem, is always formulated as a vehicle routing problem with pickup and delivery (VRPPD). However, VRPPD cannot sufficiently describe the in-vehicle passengers of multiple vehicles involved. In this paper, a mixed integer programming model is developed to formulate a multivehicle routing problem, with suggestions for bus stop locations and routes. Meanwhile, the model can determine passenger-to-vehicle assignment based on a series of constraints, like operation standard and number of stations. In solving the problem, a numerical example is used to compare a genetic algorithm (GA) and branch-and-cut algorithm. The comparison results illustrate that GA is more efficient with lower complexity. Finally, in order to apply and evaluate the proposed model, a real-world case study using smartcard data is conducted to compare the approach with the current CB route design method in Beijing.
17 January 2017 in Nonlinear Dynamics
29 January 2015 in Networks and Spatial Economics