启发式
分布式计算
Dijkstra算法
同步(交流)
计算机科学
资源(消歧)
共享资源
图形
最短路径问题
计算机网络
人工智能
理论计算机科学
频道(广播)
作者
K. L. Keung,C.K.M. Lee,Ping Ji
标识
DOI:10.1016/j.aei.2022.101540
摘要
In this paper, we intend to address the value creation of utilizing the Industrial Internet of Things (IIoT)-driven resource synchronization and sharing-based robotic mobile fulfillment system (RMFS) to enhance the overall operational effectiveness and efficiencies during information transfer and synchronization of resources. With the advent of IIoT, a graph theory-based heuristic under the multi-deep RMFS is used for computing the shortest path. A-star, Dijkstra, and genetic heuristic algorithms are applied for comparison. A simulation with a consideration of the different types of collisions is conducted for different algorithms. By providing a new three-tier IIoT architecture which includes the suppliers, RMFS, and the disposal center, a model is developed with different storage location assignment rules and strategies under the particular parties to minimize the operation costs. IIoT enables resource synchronization and information sharing, and the path will be generated under different order scenarios with different algorithms. The results show that different storage assignment rules and strategies may lead to 30% cost differences compared to the company’s current practice with random storage.
科研通智能强力驱动
Strongly Powered by AbleSci AI