Model reformulation for conflict-free routing problems using Petri Net and Deterministic Finite Automaton
Model reformulation for conflict-free routing problems using Petri Net and Deterministic Finite Automaton
复制标题
使用 Petri 网和确定性有限自动机重新构建无冲突路由问题的模型
DOI：
10.1007/s10015-015-0215-z
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Kenji Kumagai and Hisato Yoneda
中科院分区：
文献类型：
--
作者：
Ryosuke Nakamura;Kenji Sawada;Seiichi Shin;Kenji Kumagai and Hisato Yoneda
众所周知，在高架提升机运输车辆系统中，路径问题被重塑为二进制整数线性规划问题。本文提出了两种离散时间状态空间模型，简化了约束条件和二元变量。首先，使用了一种Petri网(PN)方法来简化约束。其次，利用确定性有限自动机方法对OHT系统状态空间方程的二进制输入进行约简。最后给出了一些数值算例，验证了所提方法的有效性。
It is well known that routing problems are recast as a binary integer linear programming in overhead hoist transport (OHT) vehicle systems. Two kinds of discrete-time state space models of the routing problem are proposed in this paper that simplifies the constraints and binary variables. First, a Petri Net (PN) method is used to simplify the constraints. Second, a Deterministic Finite (DF) Automaton method is used for reducing the binary inputs of the state space equation in OHT systems. Finally, some numerical examples are shown to verify the validity of the proposed methods.