CFP last date
20 June 2024
Reseach Article

SPS by Combination of Crossover Types and Changeable Mutation SGA

by Dinesh Bhagwan Hanchate, Rajankumar S. Bichkar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 94 - Number 10
Year of Publication: 2014
Authors: Dinesh Bhagwan Hanchate, Rajankumar S. Bichkar

Dinesh Bhagwan Hanchate, Rajankumar S. Bichkar . SPS by Combination of Crossover Types and Changeable Mutation SGA. International Journal of Computer Applications. 94, 10 ( May 2014), 1-11. DOI=10.5120/16376-5882

@article{ 10.5120/16376-5882,
author = { Dinesh Bhagwan Hanchate, Rajankumar S. Bichkar },
title = { SPS by Combination of Crossover Types and Changeable Mutation SGA },
journal = { International Journal of Computer Applications },
issue_date = { May 2014 },
volume = { 94 },
number = { 10 },
month = { May },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-11 },
numpages = {9},
url = { },
doi = { 10.5120/16376-5882 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2024-02-06T22:17:15.898145+05:30
%A Dinesh Bhagwan Hanchate
%A Rajankumar S. Bichkar
%T SPS by Combination of Crossover Types and Changeable Mutation SGA
%J International Journal of Computer Applications
%@ 0975-8887
%V 94
%N 10
%P 1-11
%D 2014
%I Foundation of Computer Science (FCS), NY, USA

Software engineering includes an important 4Ps concept regarding the productivity, processes, people, and project. Efficiently managing skilled people in Software Project Scheduling (SPS), considering various tasks and software project cost is an upheld task. Scheduling and then making Software cost estimation is composite work for project manager (PM) which consists of many cost drivers and their principles related to 4Ps. In this paper, we considered skilled employees as one of the important 4Ps and an important resource to schedule the cost and calculate the cost of the project along with some constraints of tasks. The paper gives a near-optimal estimated cost of project by using different combination of crossover types and dynamic mutation rated Simple Genetic Algorithm (SGA). The paper also considers the aspects of head count, effort and duration calculated by COCOMO-II. These parameters are used to verify the fitness of each chromosome to get estimated cost by SGA closer to the cost estimated by COCOMOII. The concept of concurrency utilization is included in this paper which satisfies the ultimate aim of project manager or company to get the quality project within minimum time and cost.

  1. Charles F Baer. Does mutation rate depend on itself? In PLoS Biol, Feb 2008.
  2. Barry Bohem. Software Engineering economics. Prentice Hall PTR, New Jersey, 1981.
  3. Dr. Larry Bowen. Scheduling algorithms. 2001.
  4. Mark Christensen Carl K. Chang. A net practice for software project management. In IEEE software, Nov-Dec 1999.
  5. Avraham Shtub Cohen, Avishai Mandelbaum. Multi-project scheduling and control: A process-based comparative study. In Project Management Journal, JUNE.
  6. Charlesworth B Charlesworth D Crow JF Drake, JW. Rates of spontaneous mutation. In Genetics, page Volume 5, 1998.
  7. E. W. Davis and G. E. Heidorn. An algorithm for optimal project scheduling under multiple resource constraints. In Management Science.
  8. Hilary Freeman. Importance of tasks. 2001.
  9. David E. Goldberg. Genetic Algorithm in Search, Optimization and Machine Learning. Addison-Wesley, New Jersey, 1989.
  10. David E. Goldberg and Kalyanmoy Deb. A comparative analysis of selection schemes used in GAs. IOP Publishing Ltd and Oxford University Press, UK, 1997.
  11. Himanshu Bhalchandra Dave Himanshu Dave. Design and Analysis of Algorithms. Pearson Education, UK, 2008.
  12. Sam Hsiung and James Matthews. An introduction to genetic algorithms.
  13. Jalote. An Integrated Approach to Software Engineering. Narosa publishing House, UK, 2005.
  14. J. J. Grefenstette. Optimization of control parameters for genetic algorithms. In IEEE Trns. System, Man and Cybernetics, Jan 1996.
  15. PD Keightley. Rates and fitness consequeces of new mutations in humans. In Genetics, pages 295–304, Feb 2012.
  16. Pukkala M. Kurttila. Examining the performance of six heuristic optimisation techniques in different forest planning problems. In Trends in Ecology and Evolution.
  17. Park Mark Anclif. Mutation rate threshold under changing environments with sharp peak fitness function. In Journal of the Korean Physical Society, page Volume 5, 1993.
  18. Tom Mitchell. Machine Learning. McGraw-Hill, New Jersey, 1997.
  19. Pinedo. Scheduling:Theory, Algorithms, and Systems. Kluwer Academic Publishers, UK, 2001.
  20. Roger S Pressman. Software Engineering: A practitioners Approach. McGraw-Hill Inc. , New york, 2001.
  21. Jeff D. Hamann P. Thompson and John Sessions. Selection and penalty strategies for genetic algorithms designed to solve spatial forest planning problems. In International Journal of Forestry Research, page 14, 2009.
  22. E Horowitz & S. Sahani. Fundamentals of Computer Algorithms. Galgotia Publications, New Jersey, 1999.
  23. Ian Sommerville. Software Engineering. Addison-Wesley, New york, 2011.
  24. Ting and Tang. Solving software project scheduling problems with ant colony optimisation. In Computer and Operation Research, 2013.
  25. P. H. Calamai Venema and P. Fieguth. Forest structure optimization using evolutionary programming and landscape ecology metrics. In European Journal of Operational Research.
  26. Michele McDonough Venkatraman. Types of task relationships in microsoft project. In Venkatraman,Michele Mc- Donough, Types of Task Relationships in Microsoft Project, pages Lesson–5, August 2011.
  27. Liao Ying-Hong and Chuen-Tsai Sun. An educational genetic algorithms learning tool. 2001.
Index Terms

Computer Science
Information Sciences


SGA COCOMO-II Software Cost Estimation Project Scheduling