密集小区域碰撞算法下的物流铁路货运调度

Railway Freight Dispatching Based on Intensive Small Regional Collision Algorithm

铁路物流货运物品到达目的地后需要配送车辆装载配送,为了满足配送车辆总数少且特殊物品和时限物品优先配送的目标,对铁路物流货运调度的性能提出了更高的要求。为此,提出了密集小区域碰撞算法下的物流铁路货运调度方法,通过将优先配送的准则转嫁到配送车辆总数最少的目标函数中去,构建铁路物流货运调度控制模型,利用密集小区域碰撞算法求解最优调度解。仿真实验表明,这种密集小区域碰撞算法能够合理建立铁路物流货运调度控制模型,并准确求解出最优调度解,有效提高了货运调度的性能,满足铁路物流的性能要求。

Railway logistics distribution vehicle load distribution freight after the goods arrived at destination need, in order to meet the total number of delivery vehicles and special goods and less time limit item prior distribution of the target, for railway freight transportation scheduling performance put forward very high requirements. Therefore, intensive small region collision algorithm is proposed under the logistics of railway freight dispatching method, by putting a priority distribution rule passed on to the distribution vehicle minimum objective function, the total construction of railway freight transportation scheduling control model, the use of dense small region collision algorithm to solve the optimal scheduling solution. Simula-tion results show that the dense small region collision algorithm can reasonable railway freight transportation scheduling control model is established, and accurately solve the solution of the optimal scheduling, effectively improve the perfor-mance of the shipping schedule, meet the performance requirements of the railway logistics.