The Fuzzy Time-Cost-Quality-Environment Trade-off Analysis of Multi-mode Construction Systems for Large-scale Hydroelectric Projects

2013 ◽  
pp. 1403-1415 ◽  
Author(s):  
Huan Zheng
Keyword(s):  
Large Scale ◽  
Time Cost ◽  
Trade Off ◽  
Hydroelectric Projects ◽  
Multi Mode

Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations

2015 ◽  
Vol 30 (5) ◽  
pp. 965-1001 ◽  
Author(s):  
Kaveh Khalili-Damghani ◽  
Madjid Tavana ◽  
Amir-Reza Abtahi ◽  
Francisco J. Santos Arteaga
Keyword(s):  
Time Cost ◽  
Trade Off ◽  
Precedence Relations ◽  
Multi Mode ◽  
Generalized Precedence Relations

scholarly journals Utility of Genetic Algorithms for Solving Large-Scale Construction Time-Cost Trade-Off Problems

2018 ◽  
Vol 32 (1) ◽  
pp. 04017072 ◽  
Author(s):  
Duzgun Agdas ◽  
David J. Warne ◽  
Jorge Osio-Norgaard ◽  
Forrest J. Masters
Keyword(s):  
Genetic Algorithms ◽  
Large Scale ◽  
Scale Construction ◽  
Time Cost ◽  
Construction Time ◽  
Trade Off

scholarly journals Bi-Objective Scheduling Optimization for Discrete Time/Cost Trade-Off in Projects

2018 ◽  
Vol 10 (8) ◽  
pp. 2802 ◽  
Author(s):  
Hongbo Li ◽  
Zhe Xu ◽  
Wenchao Wei
Keyword(s):  
Discrete Time ◽  
Large Scale ◽  
Heuristic Algorithms ◽  
Critical Path ◽  
Large Set ◽  
Time Cost ◽  
Trade Off ◽  
Project Duration ◽  
Computational Performance ◽  
Trade Offs

In sustainable project management, time and cost are two critical factors affecting the success of a project. Time/cost trade-offs in projects accelerate the execution of some activities by increasing the amount of non-renewable resources committed to them and therefore shorten the project duration. The discrete time/cost trade-off problem (DTCTP) has been extensively studied during the past 20 years. However, due to its complexity, the DTCTP—especially the DTCTP curve problem (DTCTP-C)—has only been solved for relatively small instances. To the best of our knowledge, there is no computational performance analysis for solving the DTCTP-C on large project instances with up to 500 activities. This paper aims to fill this gap. We present two bi-objective heuristic algorithms for the DTCTP-C where both project duration and cost are minimized. The objective is to obtain a good appropriate efficient set for the large-scale instances. The first algorithm is based on the non-dominated sorting genetic algorithm II (NSGA-II) and uses a specially designed critical path-based crossover operator. The second algorithm is a steepest descent heuristic which generates efficient solutions by iteratively solving the DTCTP with different deadlines. Computational experiments are conducted to validate the proposed algorithms on a large set of randomly generated problem instances.

Sign in / Sign up

Export Citation Format

Share Document