An algorithm for anti-ship missile weapon-target assignment problem with multiple constraints

In this paper, we propose an algorithm with multiple constraints that can solve anti-ship missile weapon-target assignment problem. Since there are limitations of existing WTA model in the specific circumstance, based on the basic principles of anti-ship missile route planning decision, this paper has carried out analysis on a specific WTA problem that can be used in anti-ship missile combat, with generalization of constraints and application of saturation attack tactics, a new algorithm under multi-target and multi-launch unit condition is proposed. Furthermore, we consider an engagement scenario for practical simulation, result shows that the new algorithm is excellent in computing time and easy to implement, this allocation strategy provides a real-time method solving the problem of WTA in modern war.