论文标题
一种用于行业动态车辆路由问题的两阶段元启发式算法4.0方法
A Two-Stage Metaheuristic Algorithm for the Dynamic Vehicle Routing Problem in Industry 4.0 approach
论文作者
论文摘要
工业4.0是一个概念，可以帮助公司在面临动态过程时开发现代供应链（MSC）系统。由于行业4.0专注于移动性和实时集成，因此它是动态车辆路由问题（DVRP）的良好框架。该研究在DVRP上起作用。这项研究的目的是将运输成本降至最低，而不超过每辆车的容量限制，同时为客户需求提供了普通仓库的需求。同时，在车辆执行现有订单的交付时，新订单到达系统的特定时间。本文提出了一种用于求解DVRP的两阶段混合算法。在第一阶段，应用构造算法来开发初始路线。在第二阶段，应用了改进算法。实验结果是针对不同大小的问题设计的。分析结果表明该算法的有效性。
Industry 4.0 is a concept that assists companies in developing a modern supply chain (MSC) system when they are faced with a dynamic process. Because Industry 4.0 focuses on mobility and real-time integration, it is a good framework for a dynamic vehicle routing problem (DVRP). This research works on DVRP. The aim of this research is to minimize transportation cost without exceeding the capacity constraint of each vehicle while serving customer demands from a common depot. Meanwhile, new orders arrive at a specific time into the system while the vehicles are executing the delivery of existing orders. This paper presents a two-stage hybrid algorithm for solving the DVRP. In the first stage, construction algorithms are applied to develop the initial route. In the second stage, improvement algorithms are applied. Experimental results were designed for different sizes of problems. Analysis results show the effectiveness of the proposed algorithm.
