Optimization Model and Algorithm for JSQ Empty Car Distribution with Priorities of Supplies and Demands
To reduce cost and increase efficiency in JSQ empty car distribution,our works are fourfold:Firstly,the de-signing-executing process of empty car distribution in China Railway Special Cargo Logistics Co.,Ltd(CRSCL)was summarized.The importance of loading stations,the inventory and the storage limit of empty cars were abstracted into supplying and demanding priorities.Combined with the section and the station capacity,the key factors in the empty car distribution problem were extracted.Secondly,a mathematical model and the priority parameter conditions were proposed based on the supply-demand network and network flow model,realizing the mathematical description of the problem.Thirdly,based on the use of a Lagrangian relaxation to relax the model into a minimum cost and maximal flow problem,the relaxed problem was solved by Ford Fulkson method and Bellman Ford algorithm with the priority queue.Finally,the effectiveness of the model and algorithm was verified according to the cross-bureau distribution data in CRSCL and the stress testing was done based on the historical data of CRSCL.The results show that the proposed method can tackle the problem precisely and efficiently,compared with the commercial solver.
empty car distributionJSQ railway carspriorities of supplies and demandsnetwork flow problem
万方数据
维普
