2003高教社杯全国大学生数学建模竞赛(国外英文资料).docVIP

2003高教社杯全国大学生数学建模竞赛 2003 High Education Club Cup National Undergraduate Mathematical Modeling Contest B questions and answers Note: the following answer is given by the proposition for reference only. The review group should be based on the understanding of the subject and the students answer, independent review. Problem analysis: This subject is obviously different from the typical transportation problem: Transport ore and rock two kinds of materials; Unbalanced transportation in which output is greater than sales; Ore should be transported in accordance with grade constraints; In both origin, unit time flow restriction; The transport vehicle is loaded with 154 tons per vehicle per trip; The number of shovels is more than the number of forklifts, which means that the best choice is not more than 7 places; Finally, the number of vehicles dispatched on each route and arrangements are worked out. The transportation problem corresponds to linear programming, more than first, second, third, 4 can be realized through the variable design and adjustment of constraint conditions; fifth make it into integer linear programming; a way to realize the linear model with sixth, is optimal from EMBED Equation.3 in integer programming to obtain the best of seventh by the best logistics; logistics routes on the sending at least calculate vehicle number (integer), and then gives the specific arrangements to complete all the calculations. For this practical problem, requiring fast algorithms to compute integer programming with 50 variables is more difficult. In addition, this is a two level planning, the second layer is combinatorial optimization, and if the optimal solution is larger, the ready-made algorithms can not do anything. Thus, the problem is to find an approximate solution for the near optimal solution, for example, a heuristic method can be used to solve the problem. Call the 120 integer programming can be used three ways to avoid: (1) without considering the number of exca