Abstract
The aim of adding explicit intensification/diversification measures to ant colony optimisation is so that it better samples the search space. A new and novel method of achieving this is based on the idea of search space reduction in which solution components are fixed during an intensification stage and certain values for some components are excluded during diversification. These phases are triggered as required throughout the search process. In comparison to an existing intensification/diversification scheme and a control ant colony solver, the results using the travelling salesman problem reveal that the new scheme offers a substantial improvement. It often achieves optimal results for benchmark problem instances. Additionally, this scheme requires few extra computational resources and is applicable to a range of combinatorial problems.
| Original language | English |
|---|---|
| Title of host publication | Advances in Applied Artificial Intelligence |
| Subtitle of host publication | IEA/AIE 2006 |
| Editors | M Ali, R Dapoigny |
| Publisher | Springer |
| Pages | 254-261 |
| Number of pages | 8 |
| ISBN (Print) | 3-540-35453-0 |
| DOIs | |
| Publication status | Published - 2006 |
| Event | 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems - Annecy, France Duration: 27 Jun 2006 → 30 Jun 2006 Conference number: 19th http://www.polytech.univ-smb.fr/pub/ieaaie06/indexe371.html?id=18 |
Publication series
| Name | LECTURE NOTES IN COMPUTER SCIENCE |
|---|---|
| Publisher | SPRINGER-VERLAG BERLIN |
| Volume | 4031 |
| ISSN (Print) | 0302-9743 |
Conference
| Conference | 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems |
|---|---|
| Abbreviated title | IEA/AIE |
| Country/Territory | France |
| City | Annecy |
| Period | 27/06/06 → 30/06/06 |
| Internet address |