Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 |
| Pages | 1285-1296 |
| Number of pages | 12 |
| Publication status | Published - 2006 |
| Event | 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 - Taipei Duration: 2006 Jun 20 → 2006 Jun 23 |
Other
| Other | 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 |
|---|---|
| City | Taipei |
| Period | 06/6/20 → 06/6/23 |
Fingerprint
Keywords
- Genetic algorithm
- Route/fleet selection
- Supply chain management
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering
Cite this
A study on route/fleet selection problem for scm -using the property of latin square and ga. / Chiba, Masato; Sorimachi, Takako; Yoshimoto, Kazuho.
36th International Conference on Computers and Industrial Engineering, ICC and IE 2006. 2006. p. 1285-1296.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A study on route/fleet selection problem for scm -using the property of latin square and ga
AU - Chiba, Masato
AU - Sorimachi, Takako
AU - Yoshimoto, Kazuho
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - Genetic algorithm
KW - Route/fleet selection
KW - Supply chain management
UR - http://www.scopus.com/inward/record.url?scp=84886893898&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84886893898&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84886893898
SP - 1285
EP - 1296
BT - 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006
ER -