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

doi:10.1299/jamdsm.6.672

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 journal › Article › peer-review

3 Citations (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 language	English
Pages (from-to)	672-686
Number of pages	15
Journal	Journal of Advanced Mechanical Design, Systems and Manufacturing
Volume	6
Issue number	5
DOIs	https://doi.org/10.1299/jamdsm.6.672
Publication status	Published - 2012
Externally published	Yes

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

Access to Document

10.1299/jamdsm.6.672

Cite this

@article{ae6c93a800524850ad631f2e6e0a0e9b,

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

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.",

keywords = "AGV routing, Bi-objective optimization, Conflict-free routing, Decomposition, Petri net, Pickup and delivery",

author = "Shuhei Eda and Tatsushi Nishi and Toshisada Mariyama and Satomi Kataoka and Kazuya Shoda and Katsuhiko Matsumura",

year = "2012",

doi = "10.1299/jamdsm.6.672",

language = "English",

volume = "6",

pages = "672--686",

journal = "Journal of Advanced Mechanical Design, Systems and Manufacturing",

issn = "1881-3054",

publisher = "Japan Society of Mechanical Engineers",

number = "5",

}

TY - JOUR

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

AU - Eda, Shuhei

AU - Nishi, Tatsushi

AU - Mariyama, Toshisada

AU - Kataoka, Satomi

AU - Shoda, Kazuya

AU - Matsumura, Katsuhiko

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - AGV routing

KW - Bi-objective optimization

KW - Conflict-free routing

KW - Decomposition

KW - Petri net

KW - Pickup and delivery

UR - http://www.scopus.com/inward/record.url?scp=84865209965&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865209965&partnerID=8YFLogxK

U2 - 10.1299/jamdsm.6.672

DO - 10.1299/jamdsm.6.672

M3 - Article

AN - SCOPUS:84865209965

SN - 1881-3054

VL - 6

SP - 672

EP - 686

JO - Journal of Advanced Mechanical Design, Systems and Manufacturing

JF - Journal of Advanced Mechanical Design, Systems and Manufacturing

IS - 5

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this