Solving an assignment–selection problem with verbal information and using genetic algorithms
[EN] The assignment-selection problems deal with finding the best one-to-one match for each of the given number of "candidates'' to "positions''. Different benefits or costs are involved in each match and the goal is to minimise the total expense. In this paper we propo...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 1999 |
| País: | España |
| Institución: | Universidad de León |
| Repositorio: | BULERIA. Repositorio Institucional de la Universidad de León |
| OAI Identifier: | oai:buleria.unileon.es:10612/23038 |
| Acceso en línea: | https://www.sciencedirect.com/science/article/pii/S0377221799001344?v ia%3Dihub https://hdl.handle.net/10612/23038 |
| Access Level: | acceso abierto |
| Palabra clave: | Contabilidad Assignment problems Selection problems Relationships Linguistic variables Fuzzy numbers Genetic algorithms Staff selection |
| Sumario: | [EN] The assignment-selection problems deal with finding the best one-to-one match for each of the given number of "candidates'' to "positions''. Different benefits or costs are involved in each match and the goal is to minimise the total expense. In this paper we propose the use of verbal information for representing the vague knowledge available. Doing it, natural linguistic labels allow the problem to be recognised as it is in real life. This paper is an attempt to supply a satisfactory solution to real assignment-selection problems with verbal information and using genetic algorithms, showing the application of this model to the staff selection problem. |
|---|