摘要
在建立军事运输路径优化模型的基础上,设计了求解最小广义权路径的遗传算法;针对军事运输中的必经点和节点保序问题,构造了特殊的染色体编码规则和交叉、变异的处理方法;提出通过对初始种群染色体的预处理来提高算法的性能.最后,进行了算法的比较实验和结果分析,以验证算法的可行性和有效性.
On the basis of establishing the optimal model of military transportation routes, a genetic algorithm was designed to obtain the route with a minimum generalized weight. To solve the problems of necessity-nodes, i.e., the nodes a military transportation route must pass, and order preserving of nodes, the rules of coding and the methods of crossover and mutation were constructed. Initial chromosomes were predisposed to improve the efficiency of this algorithm. In the end, comparative experiments were performed and the experimental result was analyzed so as to show the feasibility and effectiveness of the algorithm.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2005年第2期241-244,共4页
Journal of Southwest Jiaotong University
基金
空军科研项目(KJZ03452)
关键词
军事运输
最优路径
遗传算法
必经点
节点保序
military transportation
optimal route
genetic algorithm
necessity-node
node order-preserving
