Object-to-role many-for-one optimized matching method

Abstract

The method for many-to-one optimal matching of objects and roles disclosed in the present invention: 1) Establish a mathematical model for describing the many-to-one optimization problem of objects and roles; 2) Preprocess the established mathematical model; 3) Combine objects and roles The many-to-one optimal matching problem is transformed into an equivalent object-role one-to-one optimal matching problem; 4) Aiming at the obtained object-role one-to-one optimal matching problem, establish corresponding auxiliary label data; 5) use the established auxiliary label data, optimize the one-to-one optimal matching problem between the obtained object and role, and obtain the optimal matching scheme for the one-to-one optimal matching problem between the object and the role; The optimal matching scheme is compressed to obtain the optimal matching scheme for the many-to-one optimal matching problem between objects and roles. The method of the invention can ensure the optimality of the matching scheme, and at the same time have lower algorithm complexity and flexible optimization goals.

Description

technical field [0001] The invention belongs to the technical field of computer optimization methods, and in particular relates to a method for many-to-one optimal matching of objects and roles. Background technique [0002] With the rapid development of science, technology and society in our country, collaborative work has become increasingly important in more and more industries, such as: personnel arrangement of factory assembly lines, organization of military operations, etc. The many-to-one optimal matching problem between objects and roles is a basic problem in collaborative operations. Its manifestation is: there are a certain number of roles that need to match a certain number of objects, and any object can be matched to any role. And generate its cost or return on the role, it is required to match the number of objects equal to the required number for each role, and at the same time ensure the optimality of the matching scheme, that is, the matching scheme is the mi...

AI Technical Summary

Problems solved by technology

[0004] Nowadays, there are only enumeration method and greedy method for the many-to-one optimization matching problem of objects and roles; among them, the enumeration method can guarantee the optimality of the matching scheme, but the algorithm complexity is too high, O(n !), has no practical value, and although the greedy method has a better algorithm complexity, it is O(n 2 ), but it cannot guarantee the optimality of the matching scheme

It can be seen that there is currently no method for many-to-one optimal matching between objects and roles that can satisfy the following goals at the same time:

Images