Ant colony algorithm based on genetic method for continuous optimization problem
A new algorithm is presented by using the ant colony algorithm based on genetic method （ACG） to solve the continuous optimization problem. Each component has a seed set. The seed in the set has the value of component, trail information and fitness. The ant chooses a seed from the seed set with the p...
Saved in:
| Published in | Journal of Shanghai University Vol. 11; no. 6; pp. 597 - 602 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
01.12.2007
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1007-6417 1863-236X |
| DOI | 10.1007/s11741-007-0614-1 |
Cover
| Summary: | A new algorithm is presented by using the ant colony algorithm based on genetic method （ACG） to solve the continuous optimization problem. Each component has a seed set. The seed in the set has the value of component, trail information and fitness. The ant chooses a seed from the seed set with the possibility determined by trail information and fitness of the seed. The genetic method is used to form new solutions from the solutions got by the ants. Best solutions are selected to update the seeds in the sets and trail information of the seeds. In updating the trail information, a diffusion function is used to achieve the diffuseness of trail information. The new algorithm is tested with 8 different benchmark functions. |
|---|---|
| Bibliography: | ant colony algorithm, genetic method, diffusion function, continuous optimization problem. TP301.6 31-1735/N ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1007-6417 1863-236X |
| DOI: | 10.1007/s11741-007-0614-1 |