Article ID: | iaor2006852 |
Country: | United Kingdom |
Volume: | 32 |
Issue: | 5 |
Start Page Number: | 1255 |
End Page Number: | 1265 |
Publication Date: | May 2005 |
Journal: | Computers and Operations Research |
Authors: | Harper Paul R., Senna Valter de, Vieira Israel T., Shahani Arjan K. |
Keywords: | allocation: resources, heuristics, programming: assignment |
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.