编组站配流计划优化模型及算法研究  

Research on the Optimization Model and Algorithm of Marshalling Station Car-flow Allocation Organization

作　　者：王彦栋[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《物流技术》2011年第10期84-86,105,共4页Logistics Technology

摘　　要：通过分析路网性双向编组站的特点,以车辆在站停留时间最小为目标,建立双向编组站配流计划优化模型,通过转换目标函数,确定列车等级和配流代价之间的关系,提出配流的相关优先原则,利用表上作业法和禁忌搜索相结合的算法对模型进行求解,最后通过实例验证了模型和算法的可行性,表明能够为配流计划的优化编制提供相应的理论依据。Based on the analysis of the characteristics of the road network of the bidirectional marshalling station,the optimization model of its car flow organization is established which is aimed at minimizing the dwell time of the trains.Through converting the target function to determine the relationship between the class of the train and the cost of car-flow allocation,it proposes the principle of car-flow allocation priority.The algorithm to solve the model combines the on-table calculating method and the tabu search and is verified feasible through an empirical example,proving it can provide the relevant theoretic basis for the study of optimizing the car flow organization.

关 键 词：配流计划 双向编组站 配流代价 

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