放射形专用线非直达车流取送方案研究  

Study of Taking-out and Placing-in Scheme of Non-through Vehicle Flows on Radial Private Lines

作　　者：朱海笑[1] 牛慧兰 雍安娜 

机构地区：[1]兰州交通大学交通运输学院,甘肃兰州730070

出　　处：《电子科技》2015年第1期133-135,146,共4页Electronic Science and Technology

摘　　要：放射形专用线非直达车流取送问题是一个复杂的组合优化问题,一个最佳的取送顺序会在最大程度上缩短车流在站非生产时间,加速车辆周转。文中根据非直达车流的特点,优化了初始解的产生,以简化的在站停留时间最短为适应度函数,将取送顺序作为一个整体,设计了禁忌搜索算法。结合实例计算,结果表明该算法在求解非直达车流取送问题上取得了较满意的解。The problem of taking out and placing in of non-through vemcie Ilows on raulal complex combinatorial optimization problem. An optimal order is in favor of reducing vehicles non-productivity timeat the station and accelerating vehicles turnaround to the greatest extent. According to the characteristics of non-through vehicle flows, the production of initial solution is optimized with the simplified and shortest resident time atstation seen as the fitness function. The orders of taking out and placing in are regarded as a whole scheme, and thetabu search algorithm （TS） is designed. Computation results of an example illustrate that this algorithm finds satis-factory solution to the above mentioned problem.

关 键 词：放射形专用线 非直达车流 取送顺序 禁忌搜索算法 

分 类 号：U292.2[交通运输工程—交通运输规划与管理]