不可行集蚁群算法在铁路放射性物质载运中的应用

研究铁路货物运输中放射性物质的载运问题,目的是把安全运输与车辆的合理利用有机结合.以货物的客户要求期限与铁路运到期限之差的数学期望、铁路车辆的载重量利用率、装载货物的轻重搭配合理程度作为研究问题的3个目标;将装载货物运输指数限制、车辆标记载重限制、车辆载货容积限制、装载加固限制作为研究问题的约束条件,建立多目标规划模型.依据目标的重要性确定权向量,根据运输实际情况确定理想点,利用理想点法将多目标规划问题转化为单目标规划问题.运用基于不可行集的蚁群算法求得多目标规划问题的有效解.本文给出铁路放射性物质载运问题的计算实例,编程计算的结果证明蚁群算法具有较高的效率和可靠性.

Application of Ant-colony Algorithm Based on Infeasible Solution Set in Railway Radioactive Goods Loading and Transportation

This paper studies the problem of radioactive goods loading and transportation. The purpose is to combine transportation safety and railcar capacity utilization. Mathematical expectation of the difference between the railway transit period and customer desired period, the carrying capacity utilization rate and the match loading of light and heavy cargoes are set as the three objectives. The transport index limit, nominal loading limit,loading capacity limit and load securing limit are taken as the restriction conditions. The multiobjective planning model is formulated. According to weight vectors the multiobjective planning is transformed into the homologous singleobjective planning by using the ideal-point algorithm. The ant-colony algorithm based on the infeasible solution set is proposed to work out the solution of the multiobjective planning. One numerical example of railway radioactive goods loading and transport is given. The results indicate that the ant-colony algorithm is effective and practicable.