天然肠衣搭配问题的另一个数学模型

天然肠衣搭配问题是一个多目标组合优化问题。本文将成品按最短长度分类从长到短排序,采用多级优化的方法,按成品优劣级由高到低逐级优化,将全局的最优化转化为每一级的最优化,建立起完整的数学模型。最后对给定的实际数据进行求解,最终求得共187捆,并给出搭配方案。

Another Mathematical Model on Natural Casing Bundling Problem

Natural casing bundling problem is a multi-objective combinatorial optimization problem.To approach the problem,the bundles are categorized depending on the length of their shortest strand,and the categories are put in sequence from high quality to low quality consistent with the length.The multilevel optimization method is adopted to figure out the maximal number of bundles in each category ranging from high to low.Thus the global optimization is achieved through optimizing each individual category.At last,a complete mathematical model is established.As an application,the bundling scheme is given out according to the actual data,and the final answer of 187 bundles is obtained.