| Summary: | 碩士 === 國立中央大學 === 資訊工程學系碩士在職專班 === 100 === There are many problems of fire distribution in modern high tech war, which can often be abstracted to multi-objective optim- ization problems. The mathematics properties of fire distribution mean that obtain optimal global solutions usually impossible in limited time , and the near optimal solutions are thought.The matrix maximal filter algorithm is proposed in the paper, which is used to solve the fire distribution problem with high performance . The measure of effectiveness is designed for comparison of course of actions and could be a good conception of selecting better fire plans.
It is found that no single approach is superior. Rather, the selection of a specific method depends on the type of information that is provided in the problem,the user’s preferences, the solution requirements, and the availability of application.The fire distribution problem will become more complicated with the increasing of the number of weapons and targets , there are also include more decision parameters and limited conditions .The solution of optimization can not be guaranteed for the evolutionary algorithms,but consuming many resources and waste much time for computing . Therefor, the study of weapon-target assignment with high performance especial for the multi-object optimization is a key part in the process of command decision making.
|
|---|
