Software project scheduling using the Hyper-Cube ant colony optimization algorithm

Broderick Crawford; Ricardo Soto; Franklin Johnson; Sanjay Misra; Fernando Paredes; Eduardo Olguín

doi:10.17559/TV-20140519212813

Software project scheduling using the Hyper-Cube ant colony optimization algorithm

Translated title of the contribution: Software project scheduling using the Hyper-Cube ant colony optimization algorithm

Broderick Crawford, Ricardo Soto, Franklin Johnson, Sanjay Misra, Fernando Paredes, Eduardo Olguín

SCHOOL OF COMPUTER ENGINEERING

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

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.

Translated title of the contribution	Software project scheduling using the Hyper-Cube ant colony optimization algorithm
Original language	English
Pages (from-to)	1171-1178
Number of pages	8
Journal	Tehnicki Vjesnik
Volume	22
Issue number	5
DOIs	https://doi.org/10.17559/TV-20140519212813
State	Published - 22 Oct 2015

Keywords

Ant Colony Optimization
Hyper-Cube
Scheduling
Software Project Management

Access to Document

10.17559/TV-20140519212813

Cite this

@article{fea97575f811445fa80b4e30033a8f66,

title = "Software project scheduling using the Hyper-Cube ant colony optimization algorithm",

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.",

keywords = "Ant Colony Optimization, Hyper-Cube, Scheduling, Software Project Management",

author = "Broderick Crawford and Ricardo Soto and Franklin Johnson and Sanjay Misra and Fernando Paredes and Eduardo Olgu{\'i}n",

year = "2015",

month = oct,

day = "22",

doi = "10.17559/TV-20140519212813",

language = "English",

volume = "22",

pages = "1171--1178",

journal = "Tehnicki Vjesnik",

issn = "1330-3651",

publisher = "Strojarski Facultet, Sveuciliste Josipa Jurja Strossmayera u Osijeki",

number = "5",

}

TY - JOUR

T1 - Software project scheduling using the Hyper-Cube ant colony optimization algorithm

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Johnson, Franklin

AU - Misra, Sanjay

AU - Paredes, Fernando

AU - Olguín, Eduardo

PY - 2015/10/22

Y1 - 2015/10/22

N2 - 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.

AB - 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.

KW - Ant Colony Optimization

KW - Hyper-Cube

KW - Scheduling

KW - Software Project Management

UR - http://www.scopus.com/inward/record.url?scp=84946059895&partnerID=8YFLogxK

U2 - 10.17559/TV-20140519212813

DO - 10.17559/TV-20140519212813

M3 - Article

AN - SCOPUS:84946059895

SN - 1330-3651

VL - 22

SP - 1171

EP - 1178

JO - Tehnicki Vjesnik

JF - Tehnicki Vjesnik

IS - 5

ER -

Software project scheduling using the Hyper-Cube ant colony optimization algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this