Presentation | 1993/11/19 Genetic algorithm to search the best partion of a given set Ryouhei Hayakawa, Kazuya Hirose, Masachika Miyata, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Genetic algorithm to solve the knapsack probrem is described.The fitness of the proposed algorithm is not monotonic with respect to the cost function.In simulation for several small sets for which the best solutions are exactly caluculated,all the solutions are equal to the best solutions. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Genetic Algorithm |
Paper # | NLP93-57 |
Date of Issue |
Conference Information | |
Committee | NLP |
---|---|
Conference Date | 1993/11/19(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Nonlinear Problems (NLP) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Genetic algorithm to search the best partion of a given set |
Sub Title (in English) | |
Keyword(1) | Genetic Algorithm |
1st Author's Name | Ryouhei Hayakawa |
1st Author's Affiliation | Department of Electronics Kanazawa Institute of Technology() |
2nd Author's Name | Kazuya Hirose |
2nd Author's Affiliation | Department of Electronics Kanazawa Institute of Technology |
3rd Author's Name | Masachika Miyata |
3rd Author's Affiliation | Department of Electronics Kanazawa Institute of Technology |
Date | 1993/11/19 |
Paper # | NLP93-57 |
Volume (vol) | vol.93 |
Number (no) | 335 |
Page | pp.pp.- |
#Pages | 4 |
Date of Issue |