Fairness-based dynamic ridesharing matching and path planning model for eVTOL systems
REN Xinhui
WANG Mengde
YU Fang
Abstract：This study investigates the dynamic request matching problem in the ridesharing operations of electric Vertical Take-Off and Landing(eVTOL)aircraft,with a focus on matching and route planning.First,a dynamic route planning model based on ridesharing fairness is first developed,aiming to maximize the benefits of both passengers and eVTOL operators.The model incorporates key constraints such as vertiport capacity,eVTOL payload,and battery energy consumption.Second,two solution approaches,the basic insertion algorithm and the linear insertion algorithm,and two request handling strategies,namely first-come-first-served and request priority,are compared for their effectiveness in matching new requests to available eVTOLs.Finally,a case study is conducted using real geographic data from five train stations and one airport in City T,designated as vertiports.The results show that the linear insertion algorithm reduces computation time by over 60%compared to the basic insertion algorithm,demonstrating its computational efficiency.Furthermore,compared to the first-come-first-served strategy,the request priority approach decreases the average passenger payment by 0.87%and increases operator ridesharing revenue by 5.86%,achieving a more optimal matching between new requests and eVTOLs while balancing the interests of passengers and opera-tors.The proposed dynamic route planning model provides valuable insights for the development of shared eVTOL operation systems.
Keywords：transportation planning and managementeVTOLridesharing fairnessrequest prioritylinear insertion algorithm
Publication Date：2025-04-30
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：10( 58-67 )