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

基于等价交路组合的乘务值乘计划优化
引用本文:王莹,刘军,苗建瑞.基于等价交路组合的乘务值乘计划优化[J].交通与计算机,2012,30(2):29-32.
作者姓名:王莹  刘军  苗建瑞
作者单位:北京交通大学交通运输学院 北京100044
基金项目:北京交通大学基本科研业务费项目(批准号:2011JBM066)资助
摘    要:根据乘务值乘计划的优化性与乘务交路的排列顺序不是一一对应的特性,提出等价交路组合的概念。通过构建接续网络刻画部分交路接续关系,在此基础上,基于等价交路组合设计了求解乘务值乘计划的启发式优化方法。以广深线数据为例,对提出的优化方法进行验证,并分析了不同乘务规则取值对需要的乘务员数量的影响。

关 键 词:铁路运输  乘务计划  乘务值乘计划  等价交路组合

A Heuristic Approach for Crew Rostering Problem Based on Equivalent Crew Duties Set
WANG Ying , LIU Jun , MIAO Jianrui.A Heuristic Approach for Crew Rostering Problem Based on Equivalent Crew Duties Set[J].Computer and Communications,2012,30(2):29-32.
Authors:WANG Ying  LIU Jun  MIAO Jianrui
Institution:(School of Traffic and Transportation,Beijing Jiaotong University,Beijing 100044,China)
Abstract:As railway crew routing with duties in different orders may require different size of the crew,this paper proposes a definition of equivalent crew routing set.The paper first describes partial crew routing relationship by constructing a connection network and then it proposes a heuristic algorithm to minimize the crew size needed.The approach is validated by using the data from Guangzhou-to-Shenzhen Railline.Moreover,the relationship between the crew routing rules and the required crew is also studied.
Keywords:locomotive crew routing  crew planning  crew duties planning  equivalent crew duty set
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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