检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:彭程[1,2] 薛伟宁 黄轶[1,2] PENG Cheng1,2 , XUE Weining1,2 , HUANG Yi1,2(1. Information and Control Technology Institute, North China Institute of Science and Technology, Sanhe 065201, China~ 2. Key Laboratory of Safety Monitoring and Control Technology, State Administration of Work Safety, Sanhe 065201, Chin)
机构地区:[1]华北科技学院信息与控制技术研究所,河北三河065201 [2]安全监测监控技术国家安全生产监督管理总局安全生产重点实验室,河北三河065201
出 处:《中国矿业》2018年第4期138-141,共4页China Mining Magazine
基 金:中央高校基本科研业务费项目资助(编号:3142012042;3142015013)
摘 要:研究了一类露天矿非平衡运输优化问题,通过引入虚拟装载点,将非平衡运输问题转化为等价的平衡运输问题。根据平衡运输问题的特点,进一步将其转化为排序优化问题并利用模拟退火算法进行求解。模拟退火算法中使用了随机选取已有解中的两个位置,交换其内容得到新解的策略,降温采用几何方式。对一个具有9个装载点、5个卸载点的露天矿运输问题进行了优化计算,得到了与单纯形法相同的最优解,验证了模拟退火是求解露天矿运输问题一种有效算法。The transportation problem of the open-pit mine is investigated in this paper. The unbalanced transportation problem is converted into a balanced one by introducing a virtual loading area. The balanced transportation problem is further reduced to a scheduling optimization problem according to its characteristics. A simulated annealing algorithm is implemented to solve the scheduling optimization problem. The new solution is generated by swapping the elements at two randomly chosen positions in the existed solution. The geometric cooling scheme is adopted in the temperature dropping process. A transportation problem with 9 loading areas and 5 unloading areas is used to test the optimization algorithm. The optimal solution obtained by the simulated annealing algorithm is the same as that found by the classical simplex algorithm. The computation result illustrates the effectiveness of the simulated annealing approach to the transportation problem.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28