Abstract

One of the key important issues in project management is trade off between cost and time in such a way that the project is completed in the shortest time and minimum cost. Genetic algorithm is a practical approach for such optimization problems. In this paper, an algorithm is presented to solve the time-cost tradeoff problem (TCTP) using genetic algorithm. In this algorithm in order to search the problem space two control variables are used. Also an intelligent mutation operator is presented to approximate to the projectpsilas optimal point. Comparing this algorithm with Siemens classical algorithm shows the higher speed of proposed algorithm because in this algorithm many computations of paths in projectpsilas network graph are not needed.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.