• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation planning and technology >Optimal solution to the vehicle routing problem by adopting a meta-heuristic algorithm
【24h】

Optimal solution to the vehicle routing problem by adopting a meta-heuristic algorithm

机译：采用元启发式算法的车辆路径优化

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The delivery service provided by large-scale retailers continues to grow as online sales occupy an increasingly large share of the market. This study aims to tease out efficient vehicle scheduling times as well as optimal delivery routes by applying meta-heuristic algorithms. Monthly data on existing routes were obtained from a branch of Korea's leading large-scale online retailer. The first task was to examine the status of existing routes by comparing delivery routes created using Dijkstra's algorithm with existing delivery routes and their vehicle scheduling. The second task was to identify optimal delivery routes through a comparative analysis of the genetic algorithm and Tabu search algorithm, known for its superior applicability amongst other meta-heuristic algorithms. These findings demonstrate that the optimal vehicle routing problem not only has the potential to reduce distribution costs for operators and expedite delivery for consumers, but also the added social benefit of reduced carbon emissions.
机译：随着在线销售占据越来越大的市场份额，大型零售商提供的送货服务继续增长。这项研究旨在通过应用元启发式算法来找出有效的车辆调度时间以及最佳的交付路线。现有路线的月度数据是从韩国领先的大型在线零售商的分支机构获得的。第一项任务是通过比较使用Dijkstra算法创建的配送路线与现有配送路线及其车辆调度来检查现有路线的状态。第二项任务是通过对遗传算法和禁忌搜索算法的比较分析来确定最佳的交付途径，该算法以其在其他元启发式算法中的出色适用性而著称。这些发现表明，最佳的车辆路线选择问题不仅具有降低运营商的分销成本和加快向消费者交付的潜力，而且还具有减少碳排放量的额外社会效益。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号