节点文献

智能蚁群算法解决公交区域调度问题研究

Intelligent Ant Colony Algorithm for Transit Scheduling Problem

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

【作者】 王海星申金升

【Author】 WANG Hai-xing, SHEN Jin-sheng (School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China)

【机构】 北京交通大学交通运输学院

【摘要】 针对多条运营线路的公交区域调度问题,给出了人员调度问题的改进模型,模型的目标是在满足工作时间、跨度时间、换班要求等相关约束的条件下,使人员完成任务的间隔时间最小。同时,对已有蚁群算法解决车辆路径优化问题的算法进行了改进;对算法中相应的转移规则和轨迹更新规则进行了重新设定,改进了算法转移策略和信息素更新策略;给出了算法的实现步骤。通过仿真对模型的正确性进行了验证,证明了改进蚁群算法解决公交调度问题的高效性和较强的适用性。

【Abstract】 An improved model was presented for multiple line transit scheduling problem, an improved transit driver scheduling model was presented. Its objective was to schedule drivers in such a way that the deadhead time was minimized while the operational constraints such as work time and spread time were satisfied. An ant colony algorithm(ACA)was presented to solve transit scheduling problem based on principle of ACA used to solve vehicle routing problem(VRP). Improvement on route construction rule and pheromone updating rule was achieved on the basis of former algorithm. An example was analyzed to demonstrate the correctness of the application of this algorithm. It is proved that ACA is efficient and robust in solving transit scheduling problem.

  • 【会议录名称】 2006年首届ICT大会信息、知识、智能及其转换理论第一次高峰论坛会议论文集
  • 【会议名称】2006年首届ICT大会信息、知识、智能及其转换理论第一次高峰论坛会议
  • 【会议时间】2006-11
  • 【会议地点】中国北京
  • 【分类号】TP18
  • 【主办单位】北京邮电大学
节点文献中: 

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

本文的引文网络