No abstract

No abstract

In this paper, we propose Petri net decomposition approach for bi-objective optimization of conflict-free routing for AGV systems. The objective is minimizing total traveling time and equalizing delivery time simultaneously. The dispatching and conflictfree routing problem for AGVs is represented as a bi-objective optimal firing sequence problem for Petri Net. A Petri net decomposition approach is proposed to solve the bi-objective optimization problem efficiently. The convergence of the proposed algorithm is improved reducing search region by the proposed coordination method. The effectiveness of the proposed method is compared with that of a nearest neighborhood dispatching method. Computational results are provided to show the effectiveness of the proposed method.

In this paper, we propose a Petri Net decomposition approach for solving the bi-objective conflict-free routing for AGV systems. The objective is to minimize the deviation of delivery time and to minimize the total transportation time. The dispatching and conflict-free routing problem for AGVs is represented as an optimal firing sequence problem for Petri Net. A Petri Net decomposition approach is applied to solve the multiobjective optimization problem efficiently. The convergence of the algorithm is improved by reducing the search region. The effectiveness of the proposed method is compared with that of the conventional method. Computational results show the effectiveness of the proposed method.