cumcm0315

全国大学生数学建模竞赛优秀论文

The Arrangement of the Trucks in the

Production of Strip Mine

Abstract

We considered the two constraint conditions adequately: The first constraint condition is “Make the Truck don not wait”; the second is “The requirement of the quality and the quantity of the output in the producing area”. When we ware solving the constraint condition of making the truck not waiting, we bring forward the “Method of Matching the Bipartite Graph”, and solve the problem effectively. The quality of the mine is between 29.5% and 30.5%, and we make it a constraint condition in our linear programming.

In our first model, we set up a linear programming with the objective function making the total transport amount and the total truck numbers as less as possible. The result of our algorithms is “six output places, thirteen trucks with the total transport amount 71904 km.”And” seven output places, twelve trucks with the total transport amount 69919 km.”

In the second model, we picked out the better output places by comparing the truck numbers to them, then solve the linear programming, and get the mine amount of every output places. Finally, we avoid the “truck waiting event” by the “Method of Matching the Bipartite Graph”. The result is “total output amount 80540 ton with 19 trucks”.

Key words

Strip mine; arrangement of trucks; Bipartite Graph;

Linear programming; greedy algorithm

第1页下一页