节点文献

基于遗传算法和改进的Dijkstra算法的电缆敷设优化研究

Research of the Optimization of Cable Laying with Genetic Algorithm and Improved Dijkstra Algorithm

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 李治; 韩丹; 任兴龙; 马晓燕;

【Author】 LI Zhi;HAN Dan;REN Xing-long;MA Xiao-yan;College of Science,Huazhong Agricultural University;School of Software Engineering,Huazhong University of Science and Technology;

【机构】 华中农业大学理学院; 华中科技大学软件学院;

【摘要】 首先结合电缆敷设相关标准建立了基于多种条件限制的电缆敷设优化的多目标规划模型,将分层序列法的思想运用于模型的求解中.将总敷设路线最短作为第一目标,转弯数最少作为第二目标,错层数最少作为第三目标.求解时首先将遗传算法和改进的Dijkstra算法相结合,共同进行第一目标和第二目标的求解;对于第三目标错层数最少,在运用改进的Dijkstra算法得出待敷设路线后,设计了基于贪心准则的贪婪敷设算法来满足错层数最少的要求.最终通过MATLAB编程实现以上思想并分别对30条和100条电缆的敷设进行实例验证.

【Abstract】 The paper firstly established a multiple objectives programming model about cable laying based on multiple conditions,and then hierarchical sequence method is applied to the process of solving the problem.Making sure that the total routes is the shortest is the first target.The second target is to make sure that the number of turn is less.The third target is to make sure that the number of staggered floor can be less.In solution algorithm,we use a combination of genetic algorithm and improved Dijkstra algorithm to solve the problem of the first target and the second target.For the third target,we designed a greedy algorithm to design how to lay the line.At last,the program was written by MATLAB programming and thirty and one hundred cables are lied to check the model.

  • 【文献出处】 数学的实践与认识 ,Mathematics in Practice and Theory , 编辑部邮箱 ,2016年17期
  • 【分类号】TM757;TP18
  • 【被引频次】9
  • 【下载频次】274
节点文献中: 

本文链接的文献网络图示:

本文的引文网络