A genetic algorithm for the project assignment problem

Harper, Paul Robert ORCID: https://orcid.org/0000-0001-7894-4907, de Senna, V., Vieira, Israel Teixeira and Shahani, A. K. 2005. A genetic algorithm for the project assignment problem. Computers & Operations Research 32 (5) , pp. 1255-1265. 10.1016/j.cor.2003.11.003

Full text not available from this repository.

Abstract

In this paper we present a genetic algorithm as an aid for project assignment. The assignment problem illustrated concerns the allocation of projects to students. Students have to choose from a list of possible projects, indicating their preferred choices in advance. Inevitably, some of the more popular projects become ‘over-subscribed’ and assignment becomes a complex problem. The developed algorithm has compared well to an optimal integer programming approach. One clear advantage of the genetic algorithm is that, by its very nature, we are able to produce a number of feasible project assignments, thus facilitating discussion on the merits of various allocations and supporting multi-objective decision making.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management Q Science > QA Mathematics
Uncontrolled Keywords:	Genetic algorithms; Project assignment; Multi-objective decision making
Publisher:	Elsevier
ISSN:	03050548
Last Modified:	20 Oct 2022 07:48
URI:	https://orca.cardiff.ac.uk/id/eprint/26469

Citation Data

Cited 65 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item