Using genetic algorithms to facilitate schedule optimization

• Main Authors: Que, Bryan Christopher, Barrientos, Reymel, Cheng, Joseph Aldrich
• 格式: text
• 語言: English
• 出版: Animo Repository 2000
• 主題: Civil Engineering
• 在線閱讀: https://animorepository.dlsu.edu.ph/etd_honors/138
• 機構: De La Salle University

Abstract. The common approach used in solving a principal subset of the time-cost trade-off problems in project management is through network compression. Network compression is an essential tool for the effective and efficient implementation of a project. However, for large projects with thousands of activities as is normal for most private commercial and industrial projects and major government infrastructure projects, this approach becomes unfeasible, whether done manually, with or without the aid of the available commercial project management software, or through currently available computational approaches. This paper uses genetic algorithms (GAs), a set of tools based on natural selection and the mechanisms of population genetics, to solve the problem of network compression. A different perspective on the problem from that used in network compression, however, is taken and the problem is termed as schedule optimization. The approach presented in this paper allowed a powerful and user-friendly program to be developed for solving the problem of schedule optimization that is suitable for practical and commercial purposes.