Research On The Implementation Of The Algorithm In Vendor Selection Model And Its Application

Assignment problem is a kind of classical operation research problem and has various applications in the production management in natural world, such as resource optimize, choose of projects and military operation. Due to the differentiation between actual problems, the constrain conditions in the assignment problem changes. This paper aims at a kind of assignment problem with particular constrains.This paper first describes the model for this kind of problem and points out that what the difficult points is the multitude of the scale and the possibility of getting optimal solution is relatively low. And make analysis and research on the characteristic of the optimal solution, finally get two rules for the win bid company, which is, first class significance and proportionality. Through utilize of the rules, the scale of the problem could largely decrease. Combing these rules with single parent genetic algorithms to solve the problem proposed in the paper, through large amount of computational examples, and comparing the method with those methods which only use single parent genetic algorithm, and finally conclude that the combined method can get a better solution in short time. Thereby this paper offers a new method for large-scales assignment problems with particular constrains.