摘要
巡检线路的排班设计是2017年全国大学生数学建模竞赛的D题。在分析题目要求的基础上,综合运用了Matlab、LINGO、EXCEL、SPSS等多种工具,利用Floyd算法求出了各点之间最短路径。并根据哈密顿图原理和几何直观启发式算法筛选出符合各题限制条件的最优路径和人员安排。
The design of Inspection line scheduling is the problem D of the National Mathematical Modeling Contest in 2017. On the basis of analyzing the requirements of the subject, many kinds of tool such as Matlab, LINGO, EXCEL and SPSS were comprehensively applied to calculate the shortest path between each other of these points with Floyd algorithm. According to the closed loop principle of Hamilton and geometric intuitive heuristic algorithm , the best path and staff arrangements to meet the constraints of each item were selected.
作者
黄家云
夏伟
蒋娜
张磊
HUANG Jia-yun;XIA Wei;JIANG Na;ZHANG Lei
出处
《芜湖职业技术学院学报》
2018年第3期49-54,共6页
Journal of Wuhu Institute of Technology
关键词
FLOYD算法
几何直观启发式算法
排除筛选法
Floyd algorithm
geometric intuitive heuristic algorithm
exclusion screening method