A hybrid neural approach to combinatorial optimization
Computers and Operations Research - Special issue: artificial intelligence, evolutionary programming and operations research
The ant colony optimization meta-heuristic
New ideas in optimization
Tabu Search
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
A novel simple candidate set method for symmetric TSP and its application in MAX-MIN ant system
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
| Hi-index | 0.00 |
Ant Colony Optimisation based solvers systematically scan the set of possible solution elements before choosing a particular one. Hence, the computational time required for each step of the algorithm can be large. One way to overcome this is to limit the number of element choices to a sensible subset, or candidate set. This paper describes some novel generic candidate set strategies and tests these on the travelling salesman and car sequencing problems. The results show that the use of candidate sets helps to find competitive solutions to the test problems in a relatively short amount of time.