论文部分内容阅读
针对铁路车流径路优化的计算量随着路网中节点数和车流数的增加呈指数型增长的问题,引入分布式计算方法进行求解。对于任意一个固定顺序的车流排列,基于线路能力约束条件,构造车流径路优化模型。定义对该车流排列评价的函数,将车流径路优化问题分解成车流排列的评价计算问题和车流排列优化问题。设计分布式计算网络结构及网络程序流程。采用改进的禁忌搜索法,在服务器端完成车流排列空间的优化搜索,在不同的客户机端进行车流排列的评价计算,利用计算机网络将二者有机地结合起来,形成分布式算法。将车流排列优化问题归纳为旅行商问题,分析模型算法的复杂性。对算例进行计算表明:对构造的车流径路优化模型采用分布式算法进行求解可以节省大量时间,但存在对计算机网络配置要求高的问题。
Aiming at the problem that the amount of calculation of railway traffic route optimization increases exponentially with the increase of nodes and traffic numbers in the road network, a distributed computing method is introduced to solve the problem. For any fixed-order traffic flow, traffic path optimization models are constructed based on line capacity constraints. Define the function of the traffic flow evaluation, and decompose the traffic flow route optimization problem into the traffic flow evaluation and calculation and traffic flow optimization. Design distributed computing network structure and network program flow. An improved tabu search method was used to optimize the search space on the server side. Traffic flow was evaluated and evaluated at different clients. The two algorithms were combined organically to form a distributed algorithm. The traffic flow optimization problem is summarized as the traveling salesman problem, and the complexity of the model algorithm is analyzed. Computation of the example shows that the distributed algorithm can be used to solve the optimization model of the traffic flow routing structure, which can save a lot of time, but there is a problem that the computer network configuration requirements are high.