Optimization of time-cost-resource trade-off problems in project scheduling using meta-heuristic algorithms

Download
2009
Bettemir, Önder Halis
In this thesis, meta-heuristic algorithms are developed to obtain optimum or near optimum solutions for the time-cost-resource trade-off and resource leveling problems in project scheduling. Time cost trade-off, resource leveling, single-mode resource constrained project scheduling, multi-mode resource constrained project scheduling and resource constrained time cost trade-off problems are analyzed. Genetic algorithm simulated annealing, quantum simulated annealing, memetic algorithm, variable neighborhood search, particle swarm optimization, ant colony optimization and electromagnetic scatter search meta-heuristic algorithms are implemented for time cost trade-off problems with unlimited resources. In this thesis, three new meta-heuristic algorithms are developed by embedding meta-heuristic algorithms in each other. Hybrid genetic algorithm with simulated annealing presents the best results for time cost trade-off. Resource leveling problem is analyzed by five genetic algorithm based meta-heuristic algorithms. Apart from simple genetic algorithm, four meta-heuristic algorithms obtained same schedules obtained in the literature. In addition to this, in one of the test problems the solution is improved by the four meta-heuristic algorithms. For the resource constrained scheduling problems; genetic algorithm, genetic algorithm with simulated annealing, hybrid genetic algorithm with simulated annealing and particle swarm optimization meta-heuristic algorithms are implemented. The algorithms are tested by using the project sets of Kolisch and Sprecher (1996). Genetic algorithm with simulated annealing and hybrid genetic algorithm simulated annealing algorithm obtained very successful results when compared with the previous state of the art algorithms. 120-activity multi-mode problem set is produced by using the single mode problem set of Kolisch and Sprecher (1996) for the analysis of resource constrained time cost trade-off problem. Genetic algorithm with simulated annealing presented the least total project cost.

Suggestions

Linear static analysis of large structural models on pc clusters
Özmen, Semih; Toker, Kurç; Department of Civil Engineering (2009)
This research focuses on implementing and improving a parallel solution framework for the linear static analysis of large structural models on PC clusters. The framework consists of two separate programs where the first one is responsible from preparing data for the parallel solution that involves partitioning, workload balancing, and equation numbering. The second program is a fully parallel nite element program that utilizes substructure based solution approach with direct solvers. The first step of data...
Optimum design of pın-jointed 3-D dome structures using global optimization techniques
Saraç, Yavuz; Hasançebi, Oğuzhan; Department of Civil Engineering (2005)
Difficult gradient calculations, converging to a local optimum without exploring the design space adequately, too much dependency on the starting solution, lacking capabilities to treat discrete and mixed design variables are the main drawbacks of conventional optimization techniques. So evolutionary optimization methods received significant interest amongst researchers in the optimization area. Genetic algorithms (GAs) and simulated annealing (SA) are the main representatives of evolutionary optimization m...
Approximate analysis and condition assesment of reinforced concrete t-beam bridges using artificial neural networks
Dumlupınar, Taha; Hasançebi, Oğuzhan; Department of Civil Engineering (2008)
In recent years, artificial neural networks (ANNs) have been employed for estimation and prediction purposes in many areas of civil/structural engineering. In this thesis, multilayered feedforward backpropagation algorithm is used for the approximate analysis and calibration of RC T-beam bridges and modeling of bridge ratings of these bridges. Currently bridges are analyzed using a standard FEM program. However, when a large population of bridges is concerned, such as the one considered in this project (Pen...
Critical Sequence Crashing Heuristic for Resource-Constrained Discrete Time-Cost Trade-Off Problem
Sönmez, Rifat; Uysal, Furkan (American Society of Civil Engineers (ASCE), 2016-03-01)
Despite the importance of project deadlines and resource constraints in construction scheduling, very little success has been achieved in solving the resource-constrained discrete time-cost trade-off problem (RCDTCTP), especially for large-scale projects. In this paper a new heuristic method is designed and developed to achieve fast and high-quality solutions for the large-scale RCDTCTP. The proposed method is based on the novel principles to enable effective exploration of the search space through adequate...
Optimal load and resistance factor design of geometrically nonlinear steel space frames via tabu search and genetic algorithm
DEĞERTEKİN, SADIK ÖZGÜR; Saka, M. P.; HAYALİOĞLU, MEHMET SEDAT (Elsevier BV, 2008-01-01)
In this paper, algorithms are presented for the optimum design of geometrically nonlinear steel space frames using tabu search and genetic algorithm. Tabu search utilizes the features of short-term memory facility (tabu list) and aspiration criteria. Genetic algorithm employs reproduction, crossover and mutation operators. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange...
Citation Formats
Ö. H. Bettemir, “Optimization of time-cost-resource trade-off problems in project scheduling using meta-heuristic algorithms,” Ph.D. - Doctoral Program, Middle East Technical University, 2009.