Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Computer Engineering
The Use Of Persistent Explorer Artificial Ants To Solve The Car Sequencing Problem, Kieran O'Sullivan
The Use Of Persistent Explorer Artificial Ants To Solve The Car Sequencing Problem, Kieran O'Sullivan
Dissertations
Ant Colony Optimisation is a widely researched meta-heuristic which uses the behaviour and pheromone laying activities of foraging ants to find paths through graphs. Since the early 1990’s this approach has been applied to problems such as the Travelling Salesman Problem, Quadratic Assignment Problem and Car Sequencing Problem to name a few. The ACO is not without its problems it tends to find good local optima and not good global optima. To solve this problem modifications have been made to the original ACO such as the Max Min ant system. Other solutions involve combining it with Evolutionary Algorithms to improve …