摘要
从网络流与组合优化的观点研究直达与区段列车编组计划、车流运行径路的整体优化问题，并建立了该问题的非线性０－１整数规划模型。模型确定了路网上最优的列车接续、直达频度、车流运行径路及改编策略。
This paper presents a nonlinear 0 1 integer programming model for the combined local and through freight train routing/makeup problem from the viewpoint of network flows and combinatorial optimization.The objective of this model is to determine the optimal train connections,frequencies,reclassifying strategy and routing plans for all the O D pairs in a railroad network at one time.Finally,the possibilities for algorithmic development are discussed.
出处
《铁道学报》
EI
CSCD
北大核心
1996年第5期1-8,共8页
Journal of the China Railway Society
基金
博士后基金
关键词
货物列车
车流径路
列车编组计划
铁路
local freight train
through freight train
car routing
train make up plan
