Optimizing of Discrete Time- cost Trade-off Problem in Construction Projects Using Advanced Jaya Algorithm

This paper proposes a novel algorithm to optimize the discrete time-cost trade-off problem (DTCTP) in construction projects. As DTCTP is assumed NP-hard, the new metaheuristic models are investigated to contribute for decision-making of project managers. DTCTP can be modelled as multi-mode to represent real-life problems more practical. According to the model, the project activities have at least two or more durations and cost alternative modes. For solving this problem effectively, a novel optimization metaheuristic method named Advanced Jaya Algorithm (A-JA) is proposed, which is generated from Jaya Algorithm (JA). The benchmark function tests are applied to verify the model with other well-known metaheuristic methods. The key weakness of the base algorithm JA is that, it has unstable solution accuracy and low likelihood of escaping local optimums. According to the results, A-JA considerably improves these areas. Two case studies of DTCTP are carried out after verification to demonstrate the effectiveness and efficiency of the proposed algorithm in comparison with JA and three well-known methods. The results of A-JA are found to be more powerful than the base algorithm JA and the benchmark algorithms. The proposed method achieves the Pareto fronts to help decision makers to make trade-off between the objectives and choose the optimum solution considering on their preference.