Software Project Scheduling Problem (SPSP) is one of Project Scheduling Problem which is classified as NP-Hard problem. In 2014, variation of Ant Colony Optimization (ACO) algorithms was successfully developed. The algorithm is Max-Min Ant System (MMAS) that proposed to solve SPSP. In 2012, there is variation of ACO named Ant Colony Extended (ACE) developed for Travelling Salesman Problem and it shows better performance than well-known ACO algorithms: MMAS and Ant Colony System (ACS). However, there is no research about ACE's performance in SPSP where MMAS is successfully applied. In this paper, ACE and MMAS algorithm were compared in SPSP. The experiment result shows that ACE has better performance than MMAS for SPSP. The performance is indicated by fitness value of the algorithms.
展开▼
