Transformaion of Supply Chain - Solving Plant Location Problem by Shortest Path Algorithm
| Autor: | Hsu, Kuen-Yi, 徐昆羿 |
|---|---|
| Rok vydání: | 2000 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 88 This study focuses on supply chain of a single finished product, and proposes a method of solving plant location problem. In other words, it helps to find out a minimum cost combination of suppliers, manufacturers, distributors and retainers to produce the finished product. This study integrates concepts of supply chain and product tree to transform the original network. First, it splits nodes in network by functions, output and different sources of materials, then combines nodes according to the product tree to make shortest path algorithm apply on the new network. After applying shortest path algorithm on the new network, it can find out a shortest path including all manufacturing and distributing process. Finally, it corresponds the path to the original network to find out minimum cost combination of plant. When there exists loops of same material in network, this study needs to transform network first and then follows the method described above to find out the result. The algorithm will be non-polynomial when loops exist, and polynomial when loops not exist. This study can be adapted to industry of complicated supply chain such as manufacturing industry and fabricating industry. It provides a simple, general and real way to solve plant location problem. In future, it will be complete and more useable by considering time, capacity, inventory and uncertainty. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|