Reactive Tabu Search in unmanned aerial reconnaissance simulations
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 873-879
- https://doi.org/10.1109/wsc.1998.745084
Abstract
We apply a Reactive Tabu Search (RTS) heuristic within a discrete-event simulation to solve routing problems for unmanned aerial vehicles (UAVs). Our formulation represents this problem as a multiple traveling salesman problem with time windows (mTSPTW), with the objective of maximizing expected target coverage. Incorporating weather and probability of UAV survival at each target as random inputs, the RTS heuristic in the simulation searches for the best solution in each realization of the problem scenario in order to identify those routes that are robust to variations in weather, threat, or target service times. We present an object-oriented implementation of this approach using CACI's simulation language MODSIM.Keywords
This publication has 5 references indexed in Scilit:
- Tabu SearchPublished by Springer Nature ,1997
- The Reactive Tabu SearchINFORMS Journal on Computing, 1994
- The vehicle routing problem: An overview of exact and approximate algorithmsEuropean Journal of Operational Research, 1992
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991
- Tabu Search: A TutorialInterfaces, 1990