Discrete particle swarm optimization method for the large-scale discrete time-cost trade-off problem

Date

2016-06-01

Author

Aminbakhsh, Saman
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

168
views

0
downloads

Despite many research studies have concentrated on designing heuristic and meta-heuristic methods for the discrete time-cost trade-off problem (DTCTP), very little success has been achieved in solving large-scale instances. This paper presents a discrete particle swarm optimization (DPSO) to achieve an effective method for the large-scale DTCTP. The proposed DPSO is based on the novel principles for representation, initialization and position-updating of the particles, and brings several benefits for solving the DTCTP, such as an adequate representation of the discrete search space, and enhanced optimization capabilities due to improved quality of the initial swarm. The computational experiment results reveal that the new method outperforms the state-of-the-art methods, both in terms of the solution quality and computation time, especially for medium and large-scale problems. High quality solutions with minor deviations from the global optima are achieved within seconds, for the first time for instances including up to 630 activities. The main contribution of the proposed particle swarm optimization method is that it provides high quality solutions for the time-cost optimization of large size projects within seconds, and enables optimal planning of real-life-size projects.

Subject Keywords

Project management, Particle swarm optimization, Discrete time-cost trade-off problem, Construction projects

URI

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

Journal

EXPERT SYSTEMS WITH APPLICATIONS

DOI

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

Collections

Department of Civil Engineering, Article

Suggestions

OpenMETU
Core

Pareto Front Particle Swarm Optimizer for Discrete Time-Cost Trade-Off Problem Aminbakhsh, Saman; Sönmez, Rifat (2017-01-01) Intensive heuristic and metaheuristic research efforts have focused on the Pareto front optimization of discrete time-cost trade-off problem (DTCTP). However, very little success has been achieved in solving the problem for medium and large-scale projects. This paper presents a new particle swarm optimization method to achieve an advancement in the Pareto front optimization of medium and large-scale construction projects. The proposed Pareto front particle swarm optimizer (PFPSO) is based on a multiobjectiv...
A hybrid genetic algorithm for the discrete time-cost trade-off problem Sönmez, Rifat (2012-10-01) 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 1...
DISCRETE TIME/COST TRADE-OFF PROJECT SCHEDULING PROBLEM - AN APPLICATION TO THE MINISTRY OF HEALTH PROJECTS Akbudak, Özlem; Azizoğlu, Meral; Karakaya, Gülşah; Department of Industrial Engineering (2022-4) The Discrete Time/Cost Trade-off (DTCT) problem is a widely studied and important research area in project scheduling literature. Decision-makers try to select the best schedule alternative when there are two or more conflicting criteria. So-called Time/Cost Trade-off problems represent the two conflicting criteria generalized as time and cost. Decreasing the processing time of a task requires more resources which demand additional cost. This study focuses on the DTCT problems where some of the tasks have d...
Hybrid Optimization Method for Large-Scale Multimode Resource-Constrained Project Scheduling Problem Sönmez, Rifat (2016-11-01) Despite many research efforts that have focused on the multimode resource-constrained project scheduling problem (MRCPSP), very little success has been achieved in solving the problem for large-scale projects. In this paper a new hybrid optimization method is presented to achieve an advancement in optimal planning and scheduling of large-scale construction projects with multiple duration/resource execution modes and resource constraints. The proposed method consists of a novel heuristic and unique genetic o...
Small Response Surface Designs for Metamodel Estimation Batmaz, İnci (Elsevier BV, 2003-01-01) The primary objective of this study is to provide the novice researchers in simulation metamodeling with guidance on how to use small designs for metamodel estimation especially when cost effectiveness is a concern. This study was carried out in three phases: First, a group of second-order small designs were evaluated with respect to various criteria. Next, the metamodel of a time-shared computer system was estimated using these designs. Finally, the predictive capabilities of these small designs in giving ...

Citation Formats

S. Aminbakhsh and R. Sönmez, “Discrete particle swarm optimization method for the large-scale discrete time-cost trade-off problem,” EXPERT SYSTEMS WITH APPLICATIONS, pp. 177–185, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35775.