This paper presents an enhanced version of the ant colony optimization (ACO) for solving an improved model of vehicles routing problem (VRP), which is utilized for Unmanned Aerial Vehicle (UAV) task loitering and route planning. The improved VRP incorporates collision avoidance penalties, not only for the intersections between the vehicle's routes, but also for their departure and landing times. The ant colony algorithm uses a single objective function, consisting of penalties, ensuring in that way that the solutions with intersections will be evaluated. The ACO is a variation of the already known multi-colony algorithm where several ant colonies are assigned to different loitering steps for the same route between two tasks. Numerical experiments and comparison to previous work are illustrated to demonstrate the efficiency of the proposed algorithm.
|Publication status||Published - 9 Jul 2014|
|Event||2014 UKACC International Conference on Control - Loughborough, United Kingdom|
Duration: 9 Jul 2014 → 11 Jul 2014
|Conference||2014 UKACC International Conference on Control|
|Period||9/07/14 → 11/07/14|