天然肠衣优化搭配的数学模型

摘要

天然肠衣搭配问题是一个多目标组合优化问题,既要求最终成品捆数越大越好,又要求最短长度最长的成品越多越好。本文以成品捆数最大为首要目标,采用分组多级优化的方法,首先对原料进行适当地分组后分别优化,然后以剩余原料作为下一级赋值再分组优化,逐级优化,建立起完整的数学模型,最后对给出的实际数据进行求解,最终求得共188捆,并给出搭配方案。%Natural Casing Bundling Problem is a multi-objective combinatorial optimization problem that requires not only the largest number of bundles but also the largest number of the bundles in the largest minimum length.In this paper,for the primary goal of achieving the maximum number of finished bundles,we adopt the grouped-multilevel optimization.Firstly we optimize the material segments respectively after grouping them properly.And then we optimize the surplus material by the same way again and again.At last,we establish a complete mathematical model.As an application,the bundling scheme is given out according to the actual data,and the final answer of 188 bundles is obtained.