A multi-objective optimal approach for UAV routing in reconnaissance mission with stochastic observation time

  • Authors:

  • Xingguang Peng;Xiaoguang Gao

  • Affiliations:

  • School of Electronics and Information, Northwestern Polytechnical University, Xi'an, P.R. China;School of Electronics and Information, Northwestern Polytechnical University, Xi'an, P.R. China

  • Venue:
  • ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The multiple Unmanned Aerial Vehicles (UAVs) reconnaissance problem with stochastic observation time (MURSOT) is modeled by modifying the typical vehicle routing problem with stochastic demand (VRPSD). The objective consists in optimizing mission duration, total time and the quantity of UAVs. This multi-objective optimization problem is solved using a steady-state multi-objective evolutionary algorithm MOEA with e - dominance conception. In this paper, we propose a heuristic evolutionary operation (HEO) using Insert-to-Nearest Method (INM). Route Simulation Method (RSM) is presented in details to estimate the expected cost of each route and this method is designed especially for our MURSOT. The developed algorithm is further validated on a series of test problems adapted from Solomon's vehicle routing problems. Experimental results show that the INM is capable of finding better solutions in contrast and its advantage is more remarkable as the size of the problem become larger.