Scholarlink

The paper is concerned with the development of fast algorithms for a lexicographical bi-criteria vehicle routing problem with a single depot; a heterogeneous fleet of vehicles; simultaneous pickup and delivery; open routes; prescribed arrival time at the depot and duration of loading; and an upper limit on the duration of the driver’s shift. This last-mile logistics problem plays an important role in the retail industry. The results of computational experiments with real-world data showed that the presented algorithm can be used as an optimisation component of a human-computer vehicle routing planning system.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Last-Mile Logistics in Retail: Maximising the Number of Customers Served and Minimising the Total Travel Time

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Yakov Zinder,
  • Yefei Zhang,
  • Hanyu Gu

摘要

The paper is concerned with the development of fast algorithms for a lexicographical bi-criteria vehicle routing problem with a single depot; a heterogeneous fleet of vehicles; simultaneous pickup and delivery; open routes; prescribed arrival time at the depot and duration of loading; and an upper limit on the duration of the driver’s shift. This last-mile logistics problem plays an important role in the retail industry. The results of computational experiments with real-world data showed that the presented algorithm can be used as an optimisation component of a human-computer vehicle routing planning system.