Item type |
紀要論文 / Departmental Bulletin Paper(1) |
公開日 |
2011-08-18 |
タイトル |
|
|
タイトル |
遺伝的アルゴリズムの改良とその応用 |
タイトル |
|
|
タイトル |
Improvement of the Genetic Algorithm and its Application |
言語 |
|
|
言語 |
jpn |
資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
departmental bulletin paper |
著者 |
渡辺, 勝正
池田, 宜明
松尾, 聡
都司, 達夫
WATANABE, Katsumasa
IKEDA, Yoshiaki
MATSUO, Satoshi
TSUJI, Tatsuo
|
抄録 |
|
|
内容記述タイプ |
Abstract |
|
内容記述 |
The Genetic Algorithm (GA) is known as a method to find near optimum solutions of optimization problems in short time. In this paper, we describe how to apply the GA to some problems and how to modify the GA to be conformable to the problems. Firstly, we introduce the GA, and compare the time of computation and the solution for traveling salesman problem (TSP) in the uses of one by one method with the GA. Secondly on the knapsack problem, we discuss the ways of generating new genes by cross-over and mutation. Thirdly, we apply the GA to find the minimum value of continuous functions, and propose a method of narrowing the range of new genes for increasing the precision of the solutions. Lastly、weimplement the GA on a parallel computer system and evaluate the proccssing time in some parallel processing modes for the knapsack problem. As a result of this research, we could conclude that the GA is a basic universal algorithm applicable to many types of problems, and that it is valuable to cxtend the application of the GA. |
書誌情報 |
福井大学工学部研究報告
巻 40,
号 1,
p. 133-149,
発行日 1992-03
|
ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
4298373 |
書誌レコードID |
|
|
|
識別子タイプ |
NCID |
|
|
関連識別子 |
TD00004351 |