Modelling and Solving the Location Problem of Fire Launching Sites

Using the mathematical and optimization models has significant impact in military strategic decision making problems such as finding location of domestic fire launching site of hard and soft kill. In this paper, an integer linear programming model is developed for location problem of fire launching sites with goal of maximizing the expected value of the target accessibility and protection of strategic realms. Also, two metaheuristic algorithms based on genetic algorithm and particle swarm optimization algorithm have been designed to solve the problem. The computational results of these methods have been compared to exact answers from modeling. It is revealed that with time limit of 60 seconds, the developed genetic algorithm and particle swarm optimization have 0.16% and 0.07% average deviation from optimal solutions, indicating they perform efficiently.