Method for group role distribution problem with conflict distribution object

Abstract

The method for the group role assignment problem with conflicting assignment objects disclosed in the present invention is specifically implemented according to the following steps: Step 1, establish a corresponding mathematical model for the group role assignment problem with conflicting assignment objects; Step 2, through the steps After 1, establish the variable matrix used to represent the allocation scheme, and set the optimization goal according to actual needs; step 3, after step 2, establish the constraint condition equation group about the allocation scheme variable matrix; step 4, according to the establishment in step 3 The set of constraint equations can be obtained to obtain the optimization goal set in step 2. The method for the group role assignment problem with conflict assignment objects in the present invention realizes the avoidance of conflicts within the roles while ensuring the optimality of the assignment plan, has the characteristics of fast speed and low complexity, and improves the problem that can be handled It provides a new idea for solving the problem of role assignment of various groups.

Description

technical field [0001] The invention belongs to the technical field of computer optimization algorithms, and in particular relates to a method for solving a group role assignment problem with conflicting assignment objects. Background technique [0002] With the continuous development of science, technology and society, human beings are paying more and more attention to more and more fields, and the scale of various projects carried out is also increasing. At present, mankind has entered the era of globalization, and various global industries\projects (such as: aviation industry, Internet, and the Belt and Road Initiative, etc.) have brought convenience and benefits to people, and have also profoundly affected the lives of more people. . [0003] When carrying out large-scale projects, due to the increasingly refined division of labor, it is often necessary to collaborate among multiple types of work and personnel to allocate various resources, but there may be various natu...

AI Technical Summary

Problems solved by technology

For example: the backtracking algorithm to solve the "eight queens problem" and the kuhn-Munhres algorithm to solve the configuration cost minimization, etc. These algorithms can effectively solve a certain type of simple configuration problems, but when considering the conflicts between allocation objects and requiring avoidance When these conflicts appear, nothing can be done. Usually, we can only use the enumeration method to arrange all the allocation schemes and sort the effectiveness of each scheme, and then check one by one until we find a conflict that does not exist within the role (that is, two objects assigned to the same role). There is no conflict between the two), and this not only has high algorithm complexity, but also slow speed, and the problem scale that can be applied in practice is also small

[0005] Among the existing algorithms and variants, there is no effective method to solve the problem of group role assignment with conflicting assignment objects. The main reason is that there is no effective algorithm that can satisfy the following two goals at the same time: (1) ensure In terms of roles, there is no conflict between the allocated objects; (2) Ensure that the allocation scheme is the best among all the allocation schemes that meet the goals (1)

Images