基于图论的列检工作安排模型  

The Model of Train Inspection Work Arrangement Based on Graph Theory

作　　者：易昆南[1] 李丹[2] 何健[2] 

机构地区：[1]中南大学数学与计算技术学院,长沙410075 [2]中南大学土木建筑学院,长沙410075

出　　处：《数学理论与应用》2008年第4期23-27,共5页Mathematical Theory and Applications

摘　　要：针对目前列检工作安排中存在的一些问题:危险性高,强度大,工作量分配不均衡,工作时间安排不合理等,采用图论中的Hamilton圈方法将列检工作的安排转化为在一个赋权有向图中寻找最优路径的问题,并建立相应的0-1规划模型进行求解。结果保证所有列检工作队跨股道总数最少,各工作队繁忙程度相近,同时为每个工作队安排合理的休息及午饭时间,从而使列检工作的安排更加科学和人性化,提高列检的质量和效率,并实现突发情况下人员的实时调度。There are some problems existing in the work arrangement of train inspection, such as high danger and big strength of work, imbalance in workload distribution and assignment of woddng hours and so on. In the view of this, this paper introduces the Hamilton cycle method,and transforms the original problem into the optimal path problem in a weighted digraph. Then,a 0- 1 programming model is established to give the solution, which ensures the total number of cross- tracks least and the busyness degree equivalent, and plan the lunch and break time for each team. This makes the work arrangement of train inspection mere scientific and humanistic, improves the quality and efficiency of train inspection, and achieves the real - time staff scheduling under unexpected situations.

关 键 词：列检工作安排 图论 最优路径 0-1规划模型 

分 类 号：O157.5[理学—数学] TP18[理学—基础数学]