首页 | 本学科首页   官方微博 | 高级检索  
     

基于图论的列检工作安排模型
引用本文:易昆南,李丹,何健. 基于图论的列检工作安排模型[J]. 数学理论与应用, 2008, 28(4)
作者姓名:易昆南  李丹  何健
作者单位:[1]中南大学数学与计算技术学院,长沙410075 [2]中南大学土木建筑学院,长沙410075
摘    要:针对目前列检工作安排中存在的一些问题:危险性高,强度大,工作量分配不均衡,工作时间安排不合理等,采用图论中的Hamilton圈方法将列检工作的安排转化为在一个赋权有向图中寻找最优路径的问题,并建立相应的0—1规划模型进行求解。结果保证所有列检工作队跨股道总数最少,各工作队繁忙程度相近,同时为每个工作队安排合理的休息及午饭时间,从而使列检工作的安排更加科学和人性化,提高列检的质量和效率,并实现突发情况下人员的实时调度。

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

The Model of Train Inspection Work Arrangement Based on Graph Theory
Yi Kunnan Li Dan He Jian. The Model of Train Inspection Work Arrangement Based on Graph Theory[J]. Mathematical Theory and Applications, 2008, 28(4)
Authors:Yi Kunnan Li Dan He Jian
Affiliation:Yi Kunnan1 Li Dan2 He Jian2(1.School of Mathematical Science , Computing Technology,Central South University,Changsha,410075)(2.Civil Engineering College,410075)
Abstract: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 working 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 ...
Keywords:Work arrangement of train inspection Graph theory Optimum path 0-1 programming model  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号