论文部分内容阅读
运用2014年全国研究生数学建模竞赛E题的数据,针对乘用车整车物流运输计划问题的第三问展开研究.首先建立整数规划模型,得到要运输156辆Ⅰ型、102辆Ⅱ型和39辆Ⅲ型乘用车的1-1型和1-2型轿运车的最优数量分别为25和5.其次建立逐步转化模型,假设297辆乘用车全为Ⅱ型乘用车,使Ⅲ型乘用车数量满足要求,然后仅考虑Ⅰ型和Ⅱ型乘用车,使Ⅰ型和Ⅱ型乘用车数量满足要求,得到的结果与整数规划模型结果相一致.最后给出逐步转化模型的通用算法和程序.
Based on the data from the 2014 National Graduate Mathematical Contest (E), a third-level study on the logistics planning of passenger cars is carried out.First, an integer programming model is established to get 156 Type I, 102 Type II and Type II The optimal numbers of Type 1-1 and Type 1-2 sedan for 39 Type III passenger cars are 25 and 5. Secondly, a step-by-step conversion model is established, assuming that all 297 passenger cars are Type II passenger cars, So that the number of Type Ⅲ passenger cars meet the requirements, and then only type Ⅰ and type Ⅱ passenger cars are considered, so that the number of type Ⅰ and type Ⅱ passenger cars meet the requirements, and the results are consistent with the results of integer programming model. Finally, Common algorithms and programs for transforming models.