铁路承认车均衡审批模型及算法

The Equilibrium Approving Model and Algorithm of Rail Approved Car

针对铁路承认车静态审批模型不能兼顾多数货主需求的问题,将其改进为均衡审批模型。首先以1个计划号代替1个请求车为优化单位对模型进行改进,再以1个计划号中的一部分请求车代替1个计划号为优化单位对模型进行改进,得到含分配批次的优化模型。在此基础上,采用日期均衡、分配批次均衡和货运计划均衡依次对模型进行修正。为减少审批时间,加入优先级和加权经济效益2个约束条件,得到均衡审批优化模型,采用多项式算法求解。以1个铁路局1 d的实际请求车情况为例进行计算验证,并且自2006年11月开始在铁路局实际使用。结果表明:运用该模型和算法开发的应用系统,审批完成1个铁路局次日装车计划只需约3min,装车计划能兼顾更多货主的需求。

In order to improve the situation on the static approving model could not take care the majority of rail consignors, the paper brings forward the equilibrium approving of rail approved car. It improves the model first by replacing the single applicant car with the corresponding plan number, then by replacing the plan number with its parts, thus resulting in the optimal model which contains allocation batch. On the above basis, it improves the model with date, allocation batch and freight plan precedence decrement. In order to shorten the approving time, we add 2 constraints of precedence and weighted revenue, thus we have the equilibrium optimal approving model. The model could be solved with polynomial algorithm. Taking one day＇s applicant cars of a certain railway bureau as an example to verify the model and algorithm, the application since November 2006 shows that the system could get the approved cars within 3 min for a railway bureau and the loading plan could give attention to more consignors.