earticle

논문검색

An Optimized Resolution for Software Project Planning with Improved Max–Min Ant System Algorithm

초록

영어

Software Project Management (SPM) is one of the primary factors to software success or failure. SPM has been the bottleneck in software engineering area. We apply an improved Max–Min Ant System algorithm to Software Project Planning to make the appropriate worker-task assignment in a software project so the cost and duration of the project are minimized. Experimental results shows that using this Improved Ant Colony Optimization algorithm can obtain a feasible solution which can help us to get the appropriate PERT Graph and Gantt Chart of the software project, then we can obtain the minimized project duration and cost. So Software project management can been improved.

목차

Abstract
 1. Introduction
 2. The Model of Software Project Planning
 3. The Fitness Function
 4. An Improved MMSA Algorithm for Software Project Plan
  4.1. Construction Graph for Software Project
  4.2. The Pheromone Update Strategy
  4.3. Improved MMAS Algorithm
  4.4. Algorithm Description
 5. Experimental Results
  5.1. Model Parameter
  5.2. Experimental Report
 6. Conclusions
 Acknowledgements
 References

저자정보

  • WanJiang Han School Of Software Engineering, Beijing University of Posts and Telecommunication, Beijing 100876, China
  • HeYang Jiang International School, Beijing University of Post and Telecommunication Beijing 100876, China
  • TianBo Lu School Of Software Engineering, Beijing University of Posts and Telecommunication, Beijing 100876, China
  • XiaoYan Zhang School Of Software Engineering, Beijing University of Posts and Telecommunication, Beijing 100876, China
  • WeiJian Li International School, Beijing University of Post and Telecommunication Beijing 100876, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.