Iterated Local Search in Combinatorial Optimization Problem
Keyword(s):
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.
2018 ◽
Vol 27
(05)
◽
pp. 1850021
◽
2010 ◽
Vol E93-D
(5)
◽
pp. 1127-1136
◽
2011 ◽
Vol 148-149
◽
pp. 1248-1251
2016 ◽
Vol 250
(2)
◽
pp. 427-447
◽
2016 ◽
Vol 136
(7)
◽
pp. 963-976
◽
2017 ◽
Vol 68
(11)
◽
pp. 1377-1398
◽