摘要
研究了在线路能力、编组站能力（改编能力、通过能力及可利用的调车线数量）与装卸车能力受限条件下的车流组织方案优化问题．其目标是最小化集结费用、改编费用、换算车公里费用，以及组织始发直达而产生的换算车小时消耗，并满足车站和线路的有关能力限制．为此，建立了该问题的两类数学优化模型：大规模的非线性混合整数规划形式和非线性０—１规划形式．基于此类问题的难度，采用了模拟退火算法处理所建模型。
This paper presents the formulation and solution of the China railroad opera ting plans with capacity constraints on yard and line. The objective is to determine optimal train connections,frequencies,and blocking and routing plans for freight cars,and capacity consuming of links and yards in railway network.These decisions are developed two combinatorial optimization model:the mixed integer programming and nonlinear 0 1 programming problem.We know the problems is NP complete, hence it is difficult to solve for a globally optimal solution.In this paper we propose a simulated annealing algorithm for the railroad operating plans.We demonstrate the ability of this algorithm to determine a globally optimal solution for two different networks.
出处
《北方交通大学学报》
CSCD
北大核心
1997年第3期264-272,共9页
Journal of Northern Jiaotong University
基金
国家自然科学基金
关键词
铁路车流组织
模拟退火
线路能力
编组站能力
railroad operating plan\ simulated annealing \ yard capacity line capacity
