露天矿运输问题的模拟退火优化

研究了一类露天矿非平衡运输优化问题,通过引入虚拟装载点,将非平衡运输问题转化为等价的平衡运输问题。根据平衡运输问题的特点,进一步将其转化为排序优化问题并利用模拟退火算法进行求解。模拟退火算法中使用了随机选取已有解中的两个位置,交换其内容得到新解的策略,降温采用几何方式。对一个具有9个装载点、5个卸载点的露天矿运输问题进行了优化计算,得到了与单纯形法相同的最优解,验证了模拟退火是求解露天矿运输问题一种有效算法。

Simulated annealing algorithm for the open-pit mine transportation problem

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.