A genetic algorithm approach for flexible assembly line layouts
A genetic algorithm approach for flexible assembly line layouts
カテゴリ: 部門大会
論文No: OS4-1
グループ名: 【C】平成18年電気学会電子・情報・システム部門大会講演論文集
発行日: 2006/09/05
タイトル(英語): A genetic algorithm approach for flexible assembly line layouts
著者名: 黄来国 (早稲田大学),片山 博(早稲田大学),玄 光男(早稲田大学)
著者名(英語): ReaKook Hwang(Waseda University),Hiroshi Katayama(Waseda University),Mitsuo Gen(Waseda University)
キーワード: assembly line|genetic algorithm
要約(日本語): An Assembly line production is widely used and is one of the basic principles in production systems. An assembly line consists of a number of workstations and each workstation certain tasks are performed. The decision problem of how these tasks must be distributed between workstations, so that the total waiting time of workstation is minimal, is called a simple assembly line balancing problem (SALBP). As a consequence of introducing the just-in-time (JIT) production principle, it has been recognized that arranging the stations in a U-shaped assembly line has several advantages over the traditional configuration.
In this paper, we present a multi-objective genetic algorithm (MOGA) with an efficient coding technique for solving the U-shaped assembly line balancing problems (UALBP). For implementing our proposed algorithm, we use various objectives, including minimizing workstations (maximizing line efficiency) and minimizing the variation of workload. The results of proposed method with multi- objective functions show that proposed coding technique justifies itself and can be used in real life production systems.
PDFファイルサイズ: 3,153 Kバイト
受取状況を読み込めませんでした
