露天矿生产的车辆安排  

Truck Arrangement for an Opencast Iron Mine

作　　者：丁余良[1] 胡海林[1] 郭丽君[1] 李新秀[1] 

机构地区：[1]南京邮电学院,南京210003

出　　处：《工程数学学报》2003年第7期63-68,114,共7页Chinese Journal of Engineering Mathematics

摘　　要：本文研究了露天矿生产的车辆安排最优化问题。利用主要目标法将多目标最优化问题转化为单目标最优化问题,根据主要目标(总运量)列出最小费用函数,将次要目标最小卡车数转化为约束条件,然后逐步简化,将非线性规划转化为线性整数规划,并通过SAS软件编程遍历120个线性规划子问题,经过比较得出最优解,最后在最优解基础上运用贪心算法求出所用的最少卡车数并给出了一个班次的运输方案。对于问题一,得到最小总运量为85628.62吨公里,此时7台电铲分别放在第1,2,3,4,8,9,lO铲点,所需卡车最少为13辆。对于问题二,利用类似于问题一的解法,在充分利用现有卡车和铲车的条件下,求得最大的产量为103334吨,20辆车完全利用,相应的铲点为:1,2,3,4,8,9,10。最小运输量为147792.26吨公里,相应的岩石产量为49280吨,矿石产量为54054吨。我们还讨论了一辆卡车在不同的路线运输所产生的转移时间差和两辆卡车发生等待的条件,为解决等待问题提供了一种很好的方法。In this paper, we study the optimization problem of the truck arrangement for an opencast iron mine. We use the primary - object method to transform the multi - object optimization problem to a single - object optimization problem. Based on the primary object (the total transportation load), we setup a minimal transportation load function, and use the secondary object as a regulation, then we simplify the cost function, and transform the non - linear programming problem to the linear programming problem. Using the SAS software, we traverse all the 120 linear programming sub- problems, and get the most optimum solution. Based on the solution we use the greedy algorithm to get the least truck number and the plan for every truck's routine. For problem one, we figure out that the minimal total transportation load is 85628. 62 ton * km,the seven forklifts are placed in the 1st,2nd,3rd, 4th,8th,9th forklifts position, 13trucks are needed. For problem two, we use the similar solution to problem one, and make a full use of the present resource, we get a maximal production quantity is 103334 ton, 20 trucks are used, and forklifts are placed in the 1st, 2nd, 3rd, 4th, 8th, 9th, 10th forklifts position. The minimal transportation load is 147792.26 ton* km, the quantity of rocks is 49280 ton, the quantity of ore is 54054 ton Furthermore, we analyze the time when two trucks would wait in the same line, and the cost of time for a truck moving from one transportation routine to another.

关 键 词：露天矿 车辆安排 最优化问题 多目标最优化问题 单目标最优化问题 最小费用函数 约束条件 转移时间差 贪心算法 

分 类 号：O224[理学—运筹学与控制论] TD571[理学—数学]