Solving an assignment–selection problem with verbal information and using genetic algorithms

摘要: Abstract The assignment–selection problems deal with finding the best one-to-one match for each of given number “candidates” to “positions”. Different benefits or costs are involved in and goal is minimise total expense. In this paper we propose use verbal information representing vague knowledge available. Doing it, natural linguistic labels allow problem be recognised as it real life. This an attempt supply a satisfactory solution using genetic algorithms, showing application model staff selection problem.