Dynamic Routing in Automated Guided Vehicle Systems

スポンサーリンク

概要

• 論文の詳細を見る

• A dynamic routing method for automated guided vehicles that run on a bi-directional guide path network is suggested. This is an extension of previous dispatching methods that are called "semi-dynamic routing." In the previous methods, although current traffic status is considered for finding the conflict-free fastest route, it is assumed that active schedules of previously planned vehicles cannot be altered when a schedule for a new vehicle is introduced. In the full-dynamic routing method of this study, it is assumed that the schedules of previously planned vehicles can be altered by introducing the schedule of a new vehicle. In order to evaluate the performance of the proposed algorithm, computational experiments are performed. The results showed that the proposed algorithm reduces the average travel time of vehicles and improves the throughput of a manufacturing system.

• 一般社団法人日本機械学会の論文
• 2002-03-15

著者

• Lim Jae

  Waseda University

• KIM Kap

  Pusan National University

• YOSHIMOTO Kazuho

  Waseda University

• TAKAHASHI Teruo

  Waseda University

• LIM Jae

  Institute of Asia-Pacific Studies, Waseda University

• KIM Kap

  Department of Industrial Engineering, Pusan National University

• KIM Ki

  International Logistics Division, School of International Relations, Dongseo University

• TAKAHASHI Teruo

  Institute of Asia-Pacific Studies, Waseda University

• YOSHIMOTO Kazuho

  Department of Industrial & Management Systems Engineering, Waseda University

• Kim K

  International Logistics Division School Of International Relations Dongseo University

関連論文

• Routing Automated Guided Vehicles Using Q-Learning
• Dynamic Routing in Automated Guided Vehicle Systems

スポンサーリンク