Time-space network model and MILP formulation of the conflict-free routing problem of a capacitated AGV system
Time-space network model and MILP formulation of the conflict-free routing problem of a capacitated AGV system
复制标题
DOI：
10.1016/j.cie.2020.106270
复制
发表时间：
2020-03-01
影响因子：
7.9
通讯作者：
Murakami, Keisuke
中科院分区：
文献类型：
--
作者：
Murakami, Keisuke
自动导引车（AGV）用于在柔性制造系统中运输材料。本文讨论了一个AGV路径问题，称为调度和无冲突的路径问题的一个容量限制的AGV系统（DCFRPC）。在这个问题中，我们考虑了碰撞避免，AGV容量和机器缓冲器容量的附加约束。我们使用一个时间-空间网络（TSN）的DCFRPC建模，并制定它作为一个混合整数线性规划（MILP）的问题。在TSN中，我们分别考虑AGV和物料的流动，然后考虑配方中的约束条件使这些流动同步。这种方法允许我们将DCFRPC公式化为MILP问题。实验结果表明，我们提出的方法可以找到最佳的解决方案，在以前的研究中检查的大多数情况下。
Automated guided vehicles (AGVs) are used to transport materials in flexible manufacturing systems. This paper addresses an AGV routing problem known as the dispatch and conflict-free routing problem of a capacitated AGV system (DCFRPC). In the problem, we consider the additional constraints of collision avoidance, AGV capacities, and capacities of the machine buffers. We use a time-space network (TSN) to model the DCFRPC and formulate it as a mixed-integer linear programming (MILP) problem. In the TSN, we consider the flows of the AGVs and materials separately and then synchronize these flows considering the constraints in the formulation. This approach allows us to formulate the DCFRPC as a MILP problem. The experimental results demonstrate that our proposed approach can find optimal solutions to the majority of instances examined in a previous study.