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,展开更多
文摘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,
