This paper focuses on the electric vehicle (EV) relocation problem with dispatcher-specific times (E-VRePDST) in one-way station-based EV-sharing systems. An innovative modeling method based on the p-d pairs is developed, and the dispatcher-specific travel time is adopted to model the dispatchers’ route familiarity. Thus, preconditions and time windows for every dispatcher to traverse every pair of pickup and delivery node (p-d pair) are solved out. Then, the p-d pair based model is constructed. The proposed modeling method efficiently reduces the complexity of the associated constraints for E-VRePDST, and the numerical experiments indicate that the p-d pair based model is more efficient in terms of the solution quality and run time than the existing models based on separately treated pickup and delivery nodes. Next, a large neighborhood search (LNS) algorithm is designed and proved to be efficient compared with the results by using CPLEX. Finally, a case study of the EV-sharing system is conducted, and it shows that each dispatcher is distributed to the route with relatively more requests located in the familiar stations.

本文重点研究基于单向站的电动汽车共享系统中具有调度员特定时间 (E-VRePDST) 的电动汽车 (EV) 重定位问题。开发了一种基于 pd 对的创新建模方法，并采用调度员特定的旅行时间来建模调度员的路线熟悉度。因此，解决了每个调度员遍历每对取货和交付节点（pd 对）的前提条件和时间窗口。然后，构建基于 pd 对的模型。所提出的建模方法有效地降低了 E-VRePDST 相关约束的复杂性，数值实验表明基于 pd 对的模型在求解质量和运行时间方面比基于单独处理的拾取和交付节点。下一个，设计了一个大型邻域搜索 (LNS) 算法，并证明与使用 CPLEX 的结果相比是有效的。最后，对电动汽车共享系统进行了案例研究，表明每个调度员都分布在请求相对较多的路线上，位于熟悉的车站。