動態繞送法設計自動輸送機系統的派工員

Abstract

輸送機系統類似於計算機網路。在輸送機系統中，物料被棧板載運，棧板又被輸送機所驅動。相對地，資料包裝於封包內，而封包則在計算機網路內繞送。基於它們的相似性，本論文提出在計算機網路應用非常成功的動態繞送演算法去解輸送機系統的棧板繞送問題。例如，著名的鏈結狀態法可視為一多端點最短路徑問題。而研究它的各種實作方式如相鄰矩陣、先行矩陣、遞移封閉性等等。這些實作在國立交通大學的輸送機系統中則透過G2即時專家系統來執行，而觀察到的實作績效如預期般吻合。

Conveyor system is analog to computer network. For the conveyor system, materials are carried by pallets, and pallets are driven by conveyors. In contrast, data are capsulated by packets, and packets are routed within the computer network. Because of their similarity, the successful dynamic routing algorithms used in the computer network are proposed for solving the pallet-routing problem in the conveyor system. For example, the famous link state method is treated as an all-pair shortest path problem. Then its variant implementations are studied such as adjacent matrix, predecessor matrix, transitive closure, etc. All the implementations for a given conveyor system at NCTU are executed by a real-time expert system named G2. Also their performances are observed as expected.