当前位置: X-MOL 学术Transp. Res. Part A Policy Pract. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Shared mobility oriented open vehicle routing with order radius decision
Transportation Research Part A: Policy and Practice ( IF 6.4 ) Pub Date : 2020-12-17 , DOI: 10.1016/j.tra.2020.11.010
Lu Zhen , Zheyi Tan , Shuaian Wang , Wen Yi , Junyan Lyu

In the era of sharing economy and the mobility-as-service, the last mile delivery system is undergoing revolutionary changes with emerging a lot of new operation modes and policies. The crowdsourced delivery mode has become a novel and popular practice in the last mile delivery industry. This mode brings a novel way for facilitating the efficiency of last mile delivery on the basis of the shared mobility. This paper studies an open vehicle routing problem (OVRP) for the shared mobility based last mile delivery mode, in which parcel delivery orders are disseminated within a circle to attract occasional vehicles (or couriers) to fulfill these orders. Different from the traditional OVRP, this study further considers the decision of the above mentioned circle’s radius, which should be balanced between attracting enough vehicles and reducing additional cost (reward) for covering vehicles’ empty trips to the pickup location. This paper proposes a nonlinear mixed-integer programming model for the problem. A column generation based solution method is implemented to solve the model. Some numerical experiments are also conducted to validate the efficiency of the solution method and draw out some managerial implications for the practitioners. The proposed methodology in this paper may be potentially benefit not only for reducing the last mile delivery cost but also for promoting the modern transportation paradigm revolution to ridesharing and mobility-as-service.



中文翻译:

面向共享性的开放式车辆通行路线,具有订单半径决策

在共享经济和服务即服务的时代,最后一英里的交付系统正在发生革命性的变化,出现了许多新的运营模式和政策。众包交付模式已成为最后一英里交付行业中一种新颖且流行的实践。这种模式带来了一种新颖的方式,可在共享移动性的基础上提高最后一英里的传输效率。本文研究了基于共享移动性的最后一英里交付模式的开放式车辆路径问题(OVRP),在该模式中,包裹配送订单在一个圆圈内散布,以吸引偶尔的车辆(或快递公司)完成这些订单。与传统的OVRP不同,本研究进一步考虑了上述圆的半径的决定,在吸引足够的车辆和减少额外的费用(奖励)之间进行权衡,以弥补车辆空驶至接送地点的风险。针对该问题,提出了一种非线性混合整数规划模型。实现了基于列生成的求解方法来求解模型。还进行了一些数值实验,以验证求解方法的效率,并为从业人员带来一些管理上的启示。本文中提出的方法不仅可能降低最后一英里的交付成本,而且可能促进现代交通范式向共享乘车和服务即乘的革命。实现了基于列生成的求解方法来求解模型。还进行了一些数值实验,以验证求解方法的效率,并为从业人员带来一些管理上的启示。本文中提出的方法不仅可能降低最后一英里的交付成本,而且可能促进现代交通范式向共享乘车和服务即乘的革命。实现了基于列生成的求解方法来求解模型。还进行了一些数值实验,以验证求解方法的效率,并为从业人员带来一些管理上的启示。本文中提出的方法不仅可能降低最后一英里的交付成本,而且可能促进现代交通范式向共享乘车和服务即乘的革命。

更新日期:2020-12-17
down
wechat
bug