A hybrid genetic algorithm for the discrete time-cost trade-off problem

Date

2012-10-01

Author

Sönmez, Rifat

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

246
views

0
downloads

In this paper we present a hybrid strategy developed using genetic algorithms (GAs), simulated annealing (SA), and quantum simulated annealing techniques (QSA) for the discrete time-cost trade-off problem (DTCTP). In the hybrid algorithm (HA), SA is used to improve hill-climbing ability of GA. In addition to SA, the hybrid strategy includes QSA to achieve enhanced local search capability. The HA and a sole GA have been coded in Visual C++ on a personal computer. Ten benchmark test problems with a range of 18 to 630 activities are used to evaluate performance of the HA. The benchmark problems are solved to optimality using mixed integer programming technique. The results of the performance analysis indicate that the hybrid strategy improves convergence of GA significantly and HA provides a powerful alternative for the DTCTP.

Subject Keywords

Project management, Discrete time-cost trade-off problem, Optimization, Genetic algorithms

URI

https://hdl.handle.net/11511/37997

Journal

EXPERT SYSTEMS WITH APPLICATIONS

DOI

https://doi.org/10.1016/j.eswa.2012.04.019

Collections

Department of Civil Engineering, Article

Suggestions

OpenMETU
Core

A neural network method for direction of arrival estimation with uniform circular dipole array in the presence of mutual coupling Caylar, Selcuk; Leblebicioğlu, Mehmet Kemal; Dural, Guelbin (2007-06-16) In recent years application of Neural Network (NN) algorithms in both target tracking problem and DoA estimation have become popular because of the increased computational efficiency This paper presents the implementation of modified neural network algorithm(MN-MUST) to the uniform circular dipole array in the presence of mutual coupling. In smart antenna systems, mutual coupling between elements can significantly degrade the processing algorithms. In this paper mutual coupling affects on MN-MUST has been i...
A Meta-Heuristic Paradigm for solving the Forward Kinematics of 6-6 General Parallel Manipulator Chandra, Rohitash; Frean, Marcus; Rolland, Luc (2009-12-18) The forward kinematics of the general Gough platform, namely the 6-6 parallel manipulator is solved using hybrid meta-heuristic techniques in which the simulated annealing algorithm replaces the mutation operator in a genetic algorithm. The results are compared with the standard simulated annealing and genetic algorithm. It shows that the standard simulated annealing algorithm outperforms standard genetic algorithm in terms of computation time and overall accuracy of the solution on this problem. However, t...
A modified applied element model for the simulation of plain concrete behaviour Soysal, Berat Feyza; Arıcı, Yalın; Tuncay, Kağan (2022-08-01) A modified applied element model to simulate the behaviour of plain concrete continuum structures including discrete cracking is proposed in this study. In the classical applied element model, Poisson effects are fully ignored. To remediate this issue, diagonal elements are introduced to include the Poisson effect, and the constitutive parameters are rigorously determined using the Cauchy-Born rule and the hyper-elastic theory. The formulation is validated for linear elastic problems and the consistency and...
An Evolutionary Algorithm for the Multi-objective Multiple Knapsack Problem SOYLU, Banu; Köksalan, Mustafa Murat (2009-06-26) In this study, we consider the multi-objective multiple knapsack problem (MMKP) and we adapt our favorable weight based evolutionary algorithm (FWEA) to approximate the efficient frontier of MMKP. The algorithm assigns fitness to solutions based on their relative strengths as well as their non-dominated frontiers. The relative strength is measured based on a weighted Tchebycheff distance from the ideal point where each Solution chooses its own weights that minimize its distance from the ideal point. We carr...
A new algorithm and computation approach for economic dispatch with prohibited operating zones in power systems Cetinkaya, N; Urkmez, A; Erkmen, İsmet; Yalcinoz, T (2005-01-01) This paper presents a new algorithm and computation approach to solve the economic load dispatch (ELD) in electrical power systems. We applied a new power formula to solve the LLD problem. If production units cost Curves are represented property then ELD becomes More Correct. In this respect we assumed that production units have prohibited operating zones. Cost curves of the production units are generally accepted as piece-wise quadratic function. The power production is cheaper since we do not use the prod...

Citation Formats

R. Sönmez, “A hybrid genetic algorithm for the discrete time-cost trade-off problem,” EXPERT SYSTEMS WITH APPLICATIONS, pp. 11428–11434, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37997.