The Shortest Path of Hamiltonian on The Grid Network
碩士 === 國立虎尾科技大學 === 工業工程與管理研究所 === 101 === In order to reduce the production cost and uncertainty, automation will gradually replace human in the future, especially in high-tech industry. The planning of production path that offers least cost is a critical issue for automatic production process. To...
Main Authors: | Ming-Je Shiu, 許銘哲 |
---|---|
Other Authors: | 黃俊平 |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/2t5g36 |
Similar Items
-
Determination of the Shortest Hamiltonian Paths in an Arbitrary Graph of Distributed Databases
by: E. G. Andrianova, et al.
Published: (2019-08-01) -
The Shortest Path Problems for Linear Network
by: Jhe-chiang Jhuo, et al.
Published: (2006) -
On the Number of Shortest Weighted Paths in a Triangular Grid
by: Benedek Nagy, et al.
Published: (2020-01-01) -
Shortest Paths in Multiplex Networks
by: Saeed Ghariblou, et al.
Published: (2017-05-01) -
Reconfiguration of Hamiltonian cycles and paths in grid graphs
by: Nishat, Rahnuma Islam
Published: (2020)