A genetic algorithm for the project assignment problem

Harper, Paul Robert; Senna, Valter de; Vieira, Israel Teixeira; Shahani, A. K.

doi:10.1016/j.cor.2003.11.003

Cited by 78 publications

(73 citation statements)

References 16 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Note that SR d (B) = 0 as there is no X e X B . Then, the optimal components assignment with maximal network reliability is obtained by maximizing objective function (9).…”

Section: Problem Formulationmentioning

confidence: 99%

See 1 more Smart Citation

Multistate components assignment problem with optimal network reliability subject to assignment budget

Lin

Yeh

2011

Applied Mathematics and Computation

View full text Add to dashboard Cite

“…Note that SR d (B) = 0 as there is no X e X B . Then, the optimal components assignment with maximal network reliability is obtained by maximizing objective function (9).…”

Section: Problem Formulationmentioning

confidence: 99%

“…GA developed by Holland [10] is a powerful probabilistic search and optimization algorithm. Many researchers [4,9,26,32,33] have employed GA to solve some versions of APs. Moreover, GA is applied to solve not only APs, but also the network reliability optimization problems [3,5,17,25,29].…”

Section: Introductionmentioning

confidence: 99%

Multistate components assignment problem with optimal network reliability subject to assignment budget

Lin

Yeh

2011

Applied Mathematics and Computation

View full text Add to dashboard Cite

“…The SAP is a special case of the generalized assignment problem [11], which seeks the minimu m cost of assigning jobs to agents subject to the agents' capacities. Even though an optimal solution to the SAP can be found when the classical integer programming approach is applied to the generalized assignment problem, the advantage of using genetic algorith m (GA) is that GA can produce different allocations which may enable discussion on the merits of each allocation [8].…”

Section: Supervisor Allocation Problemmentioning

confidence: 99%

“…[8] proposed a genetic algorith m for assignment of projects to students. A list of projects is made available where the students indicate their preferred choices.…”

Section: Related Workmentioning

confidence: 99%

A Genetic Algorithm for Allocating Project Supervisors to Students

Salami¹,

Mamman²

2016

IJISA

View full text Add to dashboard Cite

Abstract-Research projects are graduation requirements for many university students. If students are arbitrarily assigned project supervisors without factoring in the students' preferences, they may be allocated supervisors whose research interests differ fro m theirs or who m they just do not enjoy working with. In this paper we present a genetic algorith m (GA ) for assigning project supervisors to students taking into account the students' preferences for lecturers as well as lecturers' capacities. Ou r work differs fro m several existing ones which tackle the student project allocation (SPA) problem. SPA is concerned with assigning research projects to students (and sometimes lecturers), wh ile our wo rk focuses on assigning supervisors to students. The advantage of the latter over the former is that it does not require pro jects to be available at the time of assignment, thus allowing the students to discuss their own pro ject ideas/topics with supervisors after the allocation. Experimental results show that our approach outperforms GAs that utilize standard selection and crossover operations. Our GA also compares favorably to an optimal integer programming approach and has the added advantage of producing mu ltip le good allocations, which can be d iscussed in order to adopt a final allocation.

show abstract

“…Methods for solving the SPA problem are, among others, building an integer program and solving it with a solver Anwar and Bahaj (2003), defining a linear program for some particular cases Saber and Ghosh (2001), or developing specific heuristics like a genetic algorithm Harper et al (2005). Manlove and O'Malley Manlove and O'Malley (2008) show the complexity and give an approximation algorithm for a generalized SPA problem in which both the students and the lecturers have preferences over the projects.…”

Section: Introductionmentioning

confidence: 99%

Course Opening, Assignment and Timetabling with Student Preferences

Varone

Schindl

2013

Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems

View full text Add to dashboard Cite

Abstract:We consider the following problem of course scheduling and assignment of students. Students express their preferences for each course from several sets of proposed courses and each student has to take a certain number of courses from each set. A minimum number of students is required to open a course and a maximum number of students is specified for each course. The courses have to be scheduled on a limited number of periods so that simultaneous courses have no students in common. This problem can be seen as a generalization of the Student Project Allocation problem. It consists in determining which courses to open, specifying the schedule for these opened courses, and assigning students to them, so that their preferences are maximized. Our model is an Integer Programming problem, which we solve with a common available solver using an iterative process.

show abstract

A genetic algorithm for the project assignment problem

Cited by 78 publications

References 16 publications

Multistate components assignment problem with optimal network reliability subject to assignment budget

Multistate components assignment problem with optimal network reliability subject to assignment budget

A Genetic Algorithm for Allocating Project Supervisors to Students

Course Opening, Assignment and Timetabling with Student Preferences

Contact Info

Product

Resources

About