抄録
The Supply Chain network has multiple players such as the Supplier, Distribution center, Station, Port, and Customer.Two or more alternative Fleet are existing between players, so Route/Fleet selection problem has complications and difficulties. To solve this NP-hard problem, Modern Heuristics such as GA and SA has been applied, but the performance has not had enough effectiveness. In this paper, the concept of Latin square is applied to solve these problems. The proposed Algorithm consists of two parts. In the first part feasible Route/Fleet are selected by the process of Latin square. After that Genetic Algorithm (GA) is applied to solve the combination optimization problem of feasible Routes. In the final part of this paper the developed algorithm is applied to real world SC-data.
| 本文言語 | English |
|---|---|
| ページ | 1285-1296 |
| ページ数 | 12 |
| 出版ステータス | Published - 2006 12 1 |
| イベント | 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 - Taipei, Taiwan, Province of China 継続期間: 2006 6 20 → 2006 6 23 |
Conference
| Conference | 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 |
|---|---|
| 国/地域 | Taiwan, Province of China |
| City | Taipei |
| Period | 06/6/20 → 06/6/23 |
ASJC Scopus subject areas
- 産業および生産工学