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.

工业4.0是一个概念，可以帮助公司在面对动态过程时开发现代供应链（MSC）系统。由于Industry 4.0专注于移动性和实时集成，因此它是动态车辆路径问题（DVRP）的良好框架。这项研究适用于DVRP。这项研究的目的是在不超出每辆车的容量限制的情况下，最大程度地降低运输成本，同时满足来自公共仓库的客户需求。同时，当车辆执行现有订单的交付时，新订单会在特定时间到达系统。本文提出了一种求解DVRP的两阶段混合算法。在第一阶段，应用构造算法来开发初始路线。在第二阶段，应用改进算法。针对不同大小的问题设计了实验结果。分析结果表明了该算法的有效性。