Humanitarian logistics : pre-positioning of relief items in Istanbul

Konu, Ayşe Sinem
In this study, we address mission planning for aerial reconnaissance and surveillance platforms. In Aerial Surveillance Problem (ASP), an air platform with surveillance sensors searches a specified number of rectangular areas once by covering inside of rectangles in strips and turns back to base where it starts. This study proposes methods to solve ASP with two conflicting objectives, minimizing distance travelled and maximizing minimum probability of target detection. Computational results show that the proposed methods produce high quality solutions. We propose an interactive procedure to help decision maker choose the most satisfying solution among all the pareto optimal solutions.