Petri net decomposition approach for bi-objective routing for agv systems minimizing total traveling time and equalizing delivery time

Shuhei Eda, Tatsushi Nishi, Toshisada Mariyama, Satomi Kataoka, Kazuya Shoda, Katsuhiko Matsumura

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)672-686
Number of pages15
JournalJournal of Advanced Mechanical Design, Systems and Manufacturing
Volume6
Issue number5
DOIs
Publication statusPublished - 2012

Keywords

  • AGV routing
  • Bi-objective optimization
  • Conflict-free routing
  • Decomposition
  • Petri net
  • Pickup and delivery

ASJC Scopus subject areas

  • Mechanical Engineering
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Petri net decomposition approach for bi-objective routing for agv systems minimizing total traveling time and equalizing delivery time'. Together they form a unique fingerprint.

Cite this