当前位置: X-MOL 学术Transp. Res. Part C Emerg. Technol. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Cost-optimal deployment of autonomous mobile lockers co-operating with couriers for simultaneous pickup and delivery operations
Transportation Research Part C: Emerging Technologies ( IF 8.3 ) Pub Date : 2022-12-01 , DOI: 10.1016/j.trc.2022.103958
Hamidreza Ensafian, Abdullah Zare Andaryan, Michael G.H. Bell, D. Glenn Geers, Philip Kilby, Jun Li

This work is an extension of a study by Li et al. (2021) in which a two-echelon network consisting of multiple depots and a fleet of Autonomous Mobile Lockers (AMLs) co-operating with couriers was examined to address the simultaneous pickup and delivery problem. This work considers the same problem but allows couriers and robots to traverse open routes. Most importantly, couriers can perform multiple missions, allowing them to restart a new mission from any stop. In order to formulate this problem, a mixed-integer linear programming (MILP) model was introduced with the aim of minimizing the total cost. Since the MILP model is not able to solve large-scale problems, an Adaptive Backtracking-Simulated Annealing metaheuristic (ABSM) algorithm was developed whose efficiency was analysed using numerical experimentation. The results show that the ABSM algorithm introduced is able to provide quality solutions within a reasonable amount of time. Also, the proposed algorithm was compared with three variants of the simultaneous pickup and delivery problem and the amount of savings was calculated. Finally, the significant problem parameters were identified and their impact on the value of the objective function was investigated. The results show that significant savings can be achieved when couriers are able to perform multiple open routes in a cooperative system of AMLs and couriers.



中文翻译:

与快递员合作的自主移动储物柜的成本优化部署,可同时进行取件和送货操作

这项工作是 Li 等人研究的延伸。(2021),其中检查了一个由多个仓库和一组与快递员合作的自主移动储物柜 (AML) 组成的二级网络,以解决同时取货和送货的问题。这项工作考虑了同样的问题,但允许快递员和机器人穿越开放路线。最重要的是,信使可以执行多项任务,允许他们从任何一站重新开始新的任务。为了制定这个问题,引入了混合整数线性规划 (MILP) 模型,目的是使总成本最小化。由于 MILP 模型无法解决大规模问题,因此开发了自适应回溯模拟退火元启发式 (ABSM) 算法,并通过数值实验对其效率进行了分析。结果表明,引入的 ABSM 算法能够在合理的时间内提供高质量的解决方案。此外,将所提出的算法与同时取货和配送问题的三种变体进行了比较,并计算了节省的金额。最后,确定了重要的问题参数,并研究了它们对目标函数值的影响。结果表明,当快递员能够在 AML 和快递员的合作系统中执行多条开放路线时,可以实现显着的节省。确定了重要的问题参数,并研究了它们对目标函数值的影响。结果表明,当快递员能够在 AML 和快递员的合作系统中执行多条开放路线时,可以实现显着的节省。确定了重要的问题参数,并研究了它们对目标函数值的影响。结果表明,当快递员能够在 AML 和快递员的合作系统中执行多条开放路线时,可以实现显着的节省。

更新日期:2022-12-01
down
wechat
bug