GENERALIZATION OF A UAV LOCATION AND ROUTING PROBLEM BY TIME WINDOWS

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Journal of Naval Sciences and Engineering
Volume:12 Issue:2
GENERALIZATION OF A UAV LOCATION AND ROUTING PROBLEM BY TIME WINDOWS

GENERALIZATION OF A UAV LOCATION AND ROUTING PROBLEM BY TIME WINDOWS

Authors : Ertan Yakıcı

Pages : 67-78

View : 13 | Download : 7

Publication Date : 2016-11-14

Article Type : Research Paper

Abstract :In this study we extend and generalize a locating and routing problem for UAVs, with an objective of maximization of the total score collected from interest points visited. By solving the problem we determine simultaneously take-off and landing stations and visit order of interest points for each UAV. The problem is defined by an integer linear programming insert ignore into journalissuearticles values(ILP); formulation. An ant colony optimization approach is altered for the introduced problem. Computational experiments are performed to compare CPLEX solver and the heuristic. We observe that the heuristic performed well on the experienced instances.
Keywords : Location and Routing Problem, Ant Colony Optimization, UAV

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.