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

Masato Chiba, Takako Sorimachi, Kazuho Yoshimoto

Research output: Contribution to conferencePaper

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 languageEnglish
Pages1285-1296
Number of pages12
Publication statusPublished - 2006 Dec 1
Event36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 - Taipei, Taiwan, Province of China
Duration: 2006 Jun 202006 Jun 23

Conference

Conference36th International Conference on Computers and Industrial Engineering, ICC and IE 2006
CountryTaiwan, Province of China
CityTaipei
Period06/6/2006/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