A study on route/fleet selection problem for scm -using the property of latin square and ga

Masato Chiba; Takako Sorimachi; Kazuho Yoshimoto

A study on route/fleet selection problem for scm -using the property of latin square and ga

Masato Chiba, Takako Sorimachi, Kazuho Yoshimoto

School of Creative Science and Engineering

Research output: Contribution to conference › Paper › peer-review

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
Pages	1285-1296
Number of pages	12
Publication status	Published - 2006 Dec 1
Event	36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 - Taipei, Taiwan, Province of China Duration: 2006 Jun 20 → 2006 Jun 23

Conference

Conference	36th International Conference on Computers and Industrial Engineering, ICC and IE 2006
Country	Taiwan, Province of China
City	Taipei
Period	06/6/20 → 06/6/23

Keywords

Genetic algorithm
Route/fleet selection
Supply chain management

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'A study on route/fleet selection problem for scm -using the property of latin square and ga'. Together they form a unique fingerprint.

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.

2006. 1285-1296 Paper presented at 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006, Taipei, Taiwan, Province of China.

Research output: Contribution to conference › Paper › peer-review

@conference{04d57c2ea61744f3ad1589b3b242438a,

title = "A study on route/fleet selection problem for scm -using the property of latin square and ga",

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.",

keywords = "Genetic algorithm, Route/fleet selection, Supply chain management",

author = "Masato Chiba and Takako Sorimachi and Kazuho Yoshimoto",

year = "2006",

month = dec,

day = "1",

language = "English",

pages = "1285--1296",

note = "36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 ; Conference date: 20-06-2006 Through 23-06-2006",

}

TY - CONF

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/12/1

Y1 - 2006/12/1

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 - Paper

AN - SCOPUS:84886893898

SP - 1285

EP - 1296

T2 - 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006

Y2 - 20 June 2006 through 23 June 2006

ER -

A study on route/fleet selection problem for scm -using the property of latin square and ga

Abstract

Conference

Keywords

ASJC Scopus subject areas

Other files and links

Cite this