A novel Ant Colony Optimization (ACO) framework for a dynamic environment has been proposed in this study. This algorithm was developed to solve Dynamic Traveling Salesman Problems more efficiently than the current algorithms. Adaptive Large Neighborhood Search based immigrant schemes have been developed and compared with existing ACO-based immigrant schemes in literature to maintain diversity via transferring knowledge to the pheromone trails from previous environments. Numerical results indicate that the proposed algorithm can handle dynamicity in the environment more efficiently compared to other immigrant-based ACOs available in the literature. A real-life case study for wildlife surveillance by unmanned aerial vehicles has also been developed and solved using the proposed algorithm.
| Identifer | oai:union.ndltd.org:MSSTATE/oai:scholarsjunction.msstate.edu:td-4168 |
| Date | 06 May 2017 |
| Creators | Bullington, William |
| Publisher | Scholars Junction |
| Source Sets | Mississippi State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
Page generated in 0.0018 seconds