期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A Simulated Annealing Approach tothe Train Routing and Makeup
1
作者 Lin Boliang(Department of Transportation Engineering,Southwest Jiaotong University,)Chengdu 6 1 003 1, China 《Journal of Modern Transportation》 1994年第1期49-56,共8页
This paper presents the formulation and solution of a train routing and makeupmodel.This formulation results in a large scale 0-1 integer programmingproblem with nonlinear objective function, and linear and nonlinearc... This paper presents the formulation and solution of a train routing and makeupmodel.This formulation results in a large scale 0-1 integer programmingproblem with nonlinear objective function, and linear and nonlinearcoastraints. We know this problem is NP-complete;hence,it is diffieult to solvefor a globelly optimal solution. In this paper we propose a simulated annealingalgorithm for the train routing and makeup problem. This method avoidsentrapment in the local minima of the objective function. The effectiveness ofthis approach has been demonstrasted by results from test casee, 展开更多
关键词 simulated annealing freight train makeup plan train routing nonlinear 0-1programming
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部