書誌事項
- タイトル別名
-
- A Method for Constructing Genetic Algorithm in an Operation Assignment Problem
- サギョウ ワリアテ モンダイ ニ オケル イデン アルゴリズム ノ コウセイホ
この論文をさがす
説明
This paper deals with an operation assignment problem. The problem is to process N products at one of parallel H machines in order to minimize the deviation of the processing time of each product from its desirable time interval. Then, we have to determine both the order and the machine to process each product.<BR>The genetic algorithm (GA) is applied to this problem. Several individual descriptions and the related decoding methods are proposed. By examining numerical results, comparison is made among these individual descriptions from the viewpoints of accuracy and computation time. Consequently, the best individual description is found to be the one defined in such a way that both the order and the machine are determined by GA.
収録刊行物
-
- システム制御情報学会論文誌
-
システム制御情報学会論文誌 9 (1), 24-33, 1996
一般社団法人 システム制御情報学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390282680141573120
-
- NII論文ID
- 10004335430
-
- NII書誌ID
- AN1013280X
-
- ISSN
- 2185811X
- 13425668
-
- NDL書誌ID
- 3915469
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可
