Affiliation:
1. Computer Science & Engineering, Stamford University Bangladesh, Dhaka, Bangladesh
Abstract
Iterated local search (ILS) is a very powerful optimization method for continuous-valued numerical optimization. However, ILS has seldom been used to solve combinatorial integer-valued optimization problems. In this paper, the iterated local search (ILS) with random restarts algorithm is applied to solve combinatorial optimization problems, e.g., the classical weapon-target allocation (WTA) problem which arises from the military operations research. The mathematical model of the WTA problem is explained in detail. Then the idea of ILS with random restarts is explained. A comparison of the algorithm with several existing search approaches shows that the ILS outperforms its competitors on the tested WTA problem.
Reference35 articles.
1. A. S. Manne, A target-assignment problem, Operations Research, 6(1): 346-351, 1958.
2. J. Chen, B. Xin, Z. H. Peng, et al, Evolutionary decision-makings for dynamic weapon-target assignment problem, Science in China Series F: Information Sciences, 52(11): 2006–2018, 2009.
3. B. Xin, J. Chen, and Z. H. Peng, et al. An efficient rule-based constructive heuristic to solve dynamic weapon-target assignment problem, IEEE Trans. on Systems, Man, and Cybernetics, Part A: Systems and Humans, 41(3): 598-606, 2011.
4. S. P. Lloyd and H. S. Witsenhausen, “Weapon allocation is NP-Complete”, in Proceedings of the IEEE Summer Simulation Conference, 1986: 1054-1058.
5. R. K. Ahuja, A. Kumar, K. Jha and J. B. Orlin, Exact and heuristic methods for the weapon target assignment problem: MIT Sloan Working Paper No: 4464-03, 2003.