Random Assignment Method Based on Dynamic Constraint and Genetic Algorithm

In this paper, by using the dynamic relationship between mathematical expectation and variance and the compound quantitative description of random variable, an instructive solution model for random assignment problem has been developed; combining the characteristic of assignment problem, give the concrete scheme based on genetic algrithm (denoted by B.DC(S)GA-RAM, for short); finally, consider its convergence using Markov chain theory, and analyze its performance through an example. All these indicate that, this solution model can effectively merge decision consciousness into the assignment process, posses interesting features of strong interpretability, easy operation and higher computation efficiency, so it can be widely used in many fields.