SearcharxivSearch

arXiv subjects

Yumeng Fang

Publications and source records attributed to Yumeng Fang.

4 recordsLinked to original sources

A hybrid large neighborhood search algorithm for the integrated dial-a-ride problem using electric vehicles

Integrating demand-responsive mobility services with transit systems is recognized as a practical and effective strategy to mitigate their impact on traffic congestion and the environment. This study develops an efficient hybrid metaheuristic to solve the integrated dial-a-ride problem by utilizing electric vehicles to minimize operational costs and customer travel time. Customer transfer inconvenience is restricted by a maximum intermodal transfer time to synchronize demand-responsive buses' arrival and transit departures. The proposed metaheuristic addresses the challenges of integrating demand-responsive vehicle routing and charging operations with fixed-route transit systems with capacitated charging stations and partial recharge. We benchmarked our algorithm against a state-of-the-art mixed-integer programming solver on instances with 10-50 customers and two transit lines. Our approach achieves solutions that are, on average, 23.8% better in solution quality within around 2 minutes, outperforming those obtained by the solver using an 8-hour computational time limit. We evaluate the impact of various system parameters to bridge the gap between theory and practice. The results suggest that, from the operator's perspective, while the integrated dial-a-ride service reduces vehicle kilometers traveled, the used fleet size may not necessarily be reduced when ensuring high-quality service for passengers. Moreover, operating the integrated systems is more beneficial in areas with dense transit networks, compared with increases in transit frequency. The findings provide valuable insights for developing integrated dial-a-ride services in practice.

math.OC

A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections

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.

math.OC

Optimized electrified meeting-point-based feeder bus services with capacitated charging stations and partial recharges

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.

math.OC

Survey of charging scheduling, fleet management, and location planning of charging stations for electrified demand-responsive transport systems: methodologies and recent developments

The accelerated electrification of transport systems with EVs has brought new challenges for charging scheduling, fleet management, and charging infrastructure location and configuration planning. In this review, we have provided a systematic review of the recent development in strategic, tactical, and operational decisions for demand responsive transport system planning using electric vehicles (EV-DRT). We have summarized recent developments in mathematical modeling approaches and identified future research directions. A list of existing open-access datasets, numerical test instances, and software are provided for future research in EV-DRT and related problems.

cs.CE