摘要
研究在最短时间和最大生存概率等两重目标约束下的兵力机动路线优化问题。首先介绍最短路问题的数学模型及D ijkstra算法,然后将求最大生存概率路目标约束转化为求最短路问题,随之建立多目标规划模型,并描述了用STEM算法进行求解的过程。最后用实例验证了模型和算法的可用性。
The purpose of this paper is to study the optimization ot troops mobile path according to the two constraints of best time and most survival probability, which is put forward as a multi - objective linear programming problem. First, models of shortest path problem and Dijkstra algorithm are expounded, and then the objective of most survival probability is transformed into the shortest path problem. After that a multi - objective linear programming model is established. And the process pf operation in establishing the model by using STEM algorithm is described. Finally, the model and the algorithm are verified in usability through an example.
出处
《空军工程大学学报（自然科学版）》
CSCD
北大核心
2006年第1期35-38,共4页
Journal of Air Force Engineering University(Natural Science Edition)
基金
高等学校骨干教师资助计划项目(GG-1105-90039-1004)
关键词
兵力机动路线优化
图论
多目标规划
optimization of troops mobile path
graph theory
multi - objective linear programming
