多目标线性不可微指派问题的优化简算法

发布时间：2018-05-27 01:20

本文选题：指派问题 + 最短时限　；参考：《内蒙古师范大学学报(自然科学汉文版)》2017年03期

【摘要】：建立了最短时限指派问题的多目标线性不可微数学模型,根据该模型的特征,找出其中一个目标函数的最优解F1,进而转化为与其等价的单目标规划模型.定义了基元素的概念,在耗时矩阵中标记不大于F1的元素,并将大于F1的元素置换成无穷大数M,划去全部基元素所在的行与列得到降阶矩阵,对降阶矩阵实施匈牙利算法得到最优指派.经分析,该算法为多项式算法,因而是有效的.
[Abstract]:A multiobjective linear nondifferentiable mathematical model for the shortest time limit assignment problem is established. According to the characteristics of the model, the optimal solution of one of the objective functions is found out, which is then transformed into an equivalent single-objective programming model. The concept of base element is defined. Elements not larger than F1 are marked in the time-consuming matrix, and the elements larger than F1 are replaced by infinite number M, and the reduced order matrix is obtained by removing the rows and columns in which all the base elements are located. The Hungarian algorithm is applied to the reduced order matrix to obtain the optimal assignment. Through analysis, the algorithm is polynomial algorithm, so it is effective.
【作者单位】：商丘学院计算机工程学院;
【基金】：国家自然科学基金青年科学基金资助项目(11301468)
【分类号】：O221.6

【相似文献】