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

Francisco Herrera, Enrique López, Cristina Mendaña, Miguel A. Rodríguez

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)326-337
Number of pages12
JournalEuropean Journal of Operational Research
Volume119
Issue number2
DOIs
StatePublished - Dec 1 1999
Externally publishedYes

Funding

This research has been partially supported by DGICYT PB95-0058.

Fingerprint

Dive into the research topics of 'Solving an assignment-selection problem with verbal information and using genetic algorithms'. Together they form a unique fingerprint.

Cite this