菜篮子工程数学建模期末.docVIP

题 目 菜篮子工程中的蔬菜种植问题 关 键 词 最短路径问题,线性规划，Froyd算法 队员姓名 谢涛远，贺志诚，王晶宇 摘 要： 为解决郊区到市中心蔬菜供给问题和最短路径，最优的配运方案，使运输成本降低和解决“菜篮子工程”这一问题。 本文研究了针对蔬菜市场为满足不同条件下的最优调配方案问题和最低费用，最小短缺补偿问题等，采用用了线性规划、Froyd算法建立了一系列数学规划模型，并用MATLAB软件编程实现，用EXCEL实现对数据的初步处理。 针对问题一的（1）问，用Froyd算法结合MATLAB编程求出蔬菜种植点到各销售点的最短距离，从而解决了蔬菜运送过程中的短缺损失最小，并建立了合理的数学模型。 针对问题一的（1）问，在（1）问模型的基础上增加各菜市场短缺量一律不超过需求量的30%的约束条件，用线性规划方程和MATLAB编程求得最小短缺补偿，以及最优的蔬菜配送供给方案。 对于问题2的求解，在上述模型的基础上，为使蔬菜供给达到满足市场需求，从而进一步扩大蔬菜种植面积，因此以短缺补偿最小和运送费用最小的目标函数，建立了线性规划模型进行求解。 本文解决的问题是如何通过考虑市场供需关系的平衡，运送方案最优，路径最短等问题，使“菜篮子工程”政府短缺达到最优和时间效益达到最优，对此建立合理的数学模型进行分析，使所得到的模型方案能够解决上述问题。 英文摘要（选填） To solve the problem of vegetable supply suburb to city centre and the shortest path, the optimal distribution scheme, reduce transportation costs and to solve the question of vegetable basket project. Were studied for vegetable market to meet the different conditions of the optimal allocation problem and the lowest cost, the shortage of minimum compensation, etc., by using the linear programming, Froyd algorithm established a series of mathematical programming model, and use MATLAB software programming, using EXCEL realize preliminary processing of the data. In view of the questions of one (1), using Froyd algorithm combined with MATLAB programming and vegetable growing point to the shortest distance of each point of sale so as to solve the shortage in the process of transporting vegetables loss minimum, and reasonable mathematical model is established. Aimed at the question of one (1), (1) ask model on the basis of increase the shortage amount shall not exceed 30% of the demand of market constraints, using linear programming equations and shortage of minimum compensation obtained by MATLAB programming, and the optimal supply of vegetables distribution plan. For solving the problem 2, on the basis of the above model, to make vegetable supply to meet the market demand, further expand the vegetable planting area, therefore in shortage, and shipping