Research on Algorithm for Non-standard Assignment Problem Based on K-means Clustering
Linear assignment problem is a typical problem in optimization,which has a wide range of applications.Because of the different number of objects assigned,the non-standard assignment problem is not suitable for directly establishing the order through the cost matrix.In this paper,the K-means clustering algorithm in statistics is used to cluster the number of targets according to the specified number,and then the Hungarian algorithm is used to assign the standard assignment problem,and the algorithm scheme is applied to the problem of personnel assignment and transportation assignment in mathematical modeling.Finally,the experimental data results show that the scheme is effective,reasonable and stable.
linear assignment problemK-means clusteringHungary algorithm
NETL
NSTL
万方数据
