摘要
从组合优化的角度研究车流径路选择、装车地直达列车编组计划及技术站直达列车编组计划三者的统一优化问题（简称ＴＲＭＰ）．建立了ＴＲＭＰ的数学规划模型，并引进模拟退火算法作为寻优工具，使真实路网规模的ＴＲＭＰ优化决策成为可能．
his paper addresses the Train Routing and Makeup Plan Problem(TRMP)for all loading stations and marshalling stations in a railroad system from the viewpoint of network flows and combinatorial optimization. The combined TRMP model are presented. Since TRMP is a large scale nonlinear discrete optimization problem,it is solved by using simulated annealing method which makes it possible to obtain close-to -optimal solutions for problems of realistic size. Numerical results have been obtained and the effectiveness of this approach has been demonstrated.
出处
《铁道学报》
EI
CSCD
北大核心
1996年第1期1-7,共7页
Journal of the China Railway Society
