| Article ID: | iaor20033319 |
| Country: | China |
| Volume: | 22 |
| Issue: | 1 |
| Start Page Number: | 36 |
| End Page Number: | 39 |
| Publication Date: | Mar 2002 |
| Journal: | Mathematical Theory and Applications |
| Authors: | Quan Huiyun, Wen Gaojin |
| Keywords: | genetic algorithms |
In this paper, based on classic genetic algorithms, a kind of subspace genetic algorithm is presented to avoid searching multidimensional space and thus to reduce the use of computer resources and time when solving problem with a genetic algorithm. We construct an algorithm with a smaller search space through analyzing feasible solutions for some special instances of the problem and finding out the region that is characteristic of the solution.