Resource allocation using metaheuristic search
Files
Date
Authors
Supervisor
Item type
Conference Contribution
Degree name
Journal Title
Journal ISSN
Volume Title
Publisher
Academy & Industry Research Collaboration Center (AIRCC) Publishing Corporation
Abstract
This research is focused on solving problems in the area of software project management using metaheuristic search algorithmsand as such is research in the field of search based software engineering. The main aim of this research is to evaluate the performance of different metaheuristic search techniques in resource allocation and scheduling problems that would be typical of software development projects.This paper reports a set of experiments which evaluate the performance of three algorithms, namely simulated annealing, tabu search and genetic algorithms. The experimental results indicate that all of themetaheuristics search techniques can be used to solve problems in resource allocation an d scheduling within a software project. Finally, a comparative analysis suggests that overa ll the genetic algorithm had performed better than simulated annealing and tabu search.Description
Source
Fourth International Conference on Computer Science & Information Technology held at Pullman Hotel, Sydney, 2014-02-21 to 2014-02-22, pp.353 - 364
Publisher's version
Rights statement
Computer Science & Information Technology (CS & IT) is an open access-Computer Science Conference Proceedings (CSCP) series welcomes conferences to publish their proceedings / post conference proceedings.