Software Project Scheduling Using the Hyper-Cube Ant Colony Optimization Algorithm
No Thumbnail Available
Date
2015
Journal Title
Journal ISSN
Volume Title
Publisher
Univ Osijek, Tech Fac
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
This paper introduces a proposal of design of Ant Colony Optimization algorithm paradigm using Hyper-Cube framework to solve the Software Project Scheduling Problem. This NP-hard problem consists in assigning tasks to employees in order to minimize the project duration and its overall cost. This assignment must satisfy the problem constraints and precedence between tasks. The approach presented here employs the Hyper-Cube framework in order to establish an explicitly multidimensional space to control the ant behaviour. This allows us to autonomously handle the exploration of the search space with the aim of reaching encouraging solutions.
Description
johnson, franklin/0000-0003-4522-3809; Misra, Sanjay/0000-0002-3556-9331; Crawford, Broderick/0000-0001-5500-0188
Keywords
Ant Colony Optimization, Hyper-Cube, scheduling, Software Project Management
Turkish CoHE Thesis Center URL
Fields of Science
Citation
WoS Q
Q4
Scopus Q
Q3
Source
Volume
22
Issue
5
Start Page
1171
End Page
1178