Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Activity Uncrashing Heuristic with Noncritical Activity Rescheduling Method for the Discrete Time-Cost Trade-Off Problem
Despite intensive research efforts that have been devoted to discrete time-cost optimization of construction projects, the current methods have very limited capabilities for solving the problem for real-life–sized projects. This study presents a new activity uncrashing heuristic with noncritical activity rescheduling method to narrow the gap between the research and practice for time-cost optimization. The uncrashing heuristic searches for new solutions by uncrashing the critical activities with the highest cost-slope. This novel feature of the proposed heuristic enables identification and elimination of the dominated solutions during the search procedure. Hence, the heuristic can determine new high-quality solutions based on the nondominated solutions. Furthermore, the proposed noncritical activity rescheduling method of the heuristic decreases the amount of scheduling calculations, and high-quality solutions are achieved within a short CPU time. Results of the computational experiments reveal that the new heuristic outperforms state-of-the-art methods significantly for large-scale single-objective cost minimization and Pareto front optimization problems. Hence, the primary contribution of the paper is a new heuristic method that can successfully achieve high-quality solutions for large-scale discrete time-cost optimization problems.
Activity Uncrashing Heuristic with Noncritical Activity Rescheduling Method for the Discrete Time-Cost Trade-Off Problem
Despite intensive research efforts that have been devoted to discrete time-cost optimization of construction projects, the current methods have very limited capabilities for solving the problem for real-life–sized projects. This study presents a new activity uncrashing heuristic with noncritical activity rescheduling method to narrow the gap between the research and practice for time-cost optimization. The uncrashing heuristic searches for new solutions by uncrashing the critical activities with the highest cost-slope. This novel feature of the proposed heuristic enables identification and elimination of the dominated solutions during the search procedure. Hence, the heuristic can determine new high-quality solutions based on the nondominated solutions. Furthermore, the proposed noncritical activity rescheduling method of the heuristic decreases the amount of scheduling calculations, and high-quality solutions are achieved within a short CPU time. Results of the computational experiments reveal that the new heuristic outperforms state-of-the-art methods significantly for large-scale single-objective cost minimization and Pareto front optimization problems. Hence, the primary contribution of the paper is a new heuristic method that can successfully achieve high-quality solutions for large-scale discrete time-cost optimization problems.
Activity Uncrashing Heuristic with Noncritical Activity Rescheduling Method for the Discrete Time-Cost Trade-Off Problem
Sonmez, Rifat (Autor:in) / Aminbakhsh, Saman (Autor:in) / Atan, Tankut (Autor:in)
18.05.2020
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Critical Sequence Crashing Heuristic for Resource-Constrained Discrete Time–Cost Trade-Off Problem
| Online Contents | 2016
Household Activity Rescheduling in Response to Automobile Reduction Scenarios
| British Library Online Contents | 2002
Solution of discrete time–cost trade-off problem with adaptive search domain
| Emerald Group Publishing | 2025
Individuals’ activity – travel rescheduling behaviour: experiment and model-based analysis
| Online Contents | 2009