首页 /研究 /Automated Delivery Robots: A Vehicle Routing Problem on last mile delivery cost per unit based on range and carrying capacity
OTHER

Automated Delivery Robots: A Vehicle Routing Problem on last mile delivery cost per unit based on range and carrying capacity

Perrinaud Corentin, Adriana Saraceni

发表年份
2022
引用次数
6

摘要

In recent years, LMD has risen in volume and complexity, prompting innovations in robotics technologies proposing ADRs as a viable solution. This research develops a VRP to assess how the maximum driving range and the number of compartments of ADRs, impacts LMD costs per unit in urban areas. The findings show that fewer compartments or a lower range for the ADRs decrease LMD cost per unit. The methodology and models developed can be used by logistics companies to make purchasing decisions for their delivery fleet or as a tool to simulate LMD costs when varying vehicle characteristics.

关键词

Vehicle routing problemUnit (ring theory)PurchasingRange (aeronautics)Last mile (transportation)Computer scienceUnit costCity logisticsRoboticsDelivery Performance

相关论文

查看 OTHER 分类全部论文