Pareto oriented optimization of discrete time cost trade off problem using particle swarm optimization

Date

2015-09-07

Author

Aminbakhsh, Saman
Sönmez, Rifat

Metadata

Show full item record

Item Usage Stats

163
views

0
downloads

In project scheduling, it is feasible to reduce the duration of a project by allocating additional resources to its activities. However, crashing the project schedule will impose additional costs. Numerous research has focused on optimizing the trade-off between time and cost to achieve a set of non-dominated solutions. However, the majority of the research on time-cost trade-off problem developed methods for relatively simple problems including up to eighteen activities, which are not representing the complexity of real-life construction projects. In this work a Particle Swarm Optimization (PSO) technique is presented for Pareto oriented optimization of the complex discrete time-cost trade-off problems. The proposed PSO engages novel principles for representation and position-updating of the particles. The performance of the PSO is compared to the existing methods using a well-known 18-activity benchmark problem. A 63-activity problem is also included in computational experiments to validate the efficiency and effectiveness of the proposed PSO for a more complex problem. The results indicate that the proposed method provides a powerful alternative for the Pareto front optimization of DTCTPs.

Subject Keywords

Pareto front, Particle swarm optimization, Project scheduling, Time-cost trade-off problem

URI

http://www.arcom.ac.uk/-docs/proceedings/a2604506123225031831e79ce484fe5d.pdf
https://hdl.handle.net/11511/72547

Conference Name

31st Annual Association of Researchers in Construction Management Conference (7 - 9 Eylül 2015)

Collections

Department of Civil Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem Degirmenci, G.; Azizoğlu, Meral (2013-10-01) The time/cost trade-off models in project management aim to reduce the project completion time by putting extra resources on activity durations. The budget problem in discrete time/cost trade-off scheduling selects a time/cost mode for each activity so as to minimize the project completion time without exceeding the available budget. There may be alternative modes that solve the budget problem optimally and each solution may have a different total cost value. In this study we consider the budget problem and...
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 meta-heuristic algorithms for the resource constrained multi-project scheduling problem Uysal, Furkan; Sönmez, Rifat; Department of Civil Engineering (2014) The general resource constrained multi-project scheduling problem (RCMPSP) consists of simultaneous scheduling of two or more projects with common resource constraints, while minimizing duration of the projects. Critical Path Method and other scheduling methods do not consider resource conflicts and practically used commercial project management software packages and heuristic methods provide very limited solutions for the solution of the RCMPSP. Considering the practical importance of multi-project schedul...
A mixed integer model for optimization of discrete time cost tradeoff problem Tatar, Ali Can; Bilir, Mert; Sönmez, Rifat; Atan, Sabri Tankut (null; 2016-06-25) In construction projects, activity durations can be expedited by allocating additional resources. Decreasing activity durations by means of crashing, usually leads to increase in the direct expenses. This trade-off between time and cost is called as the time-cost trade-off problem. Since in practice many resources are available in discrete units, numerous research has focussed on the discrete version of this problem called the discrete time-cost trade-off problem (DTCTP). Achieving the project schedule that...
Resource Constrained Multi-project Scheduling: Application in Software Company Kurt, Pelin Akyil; KEÇECİ, BARIŞ (2019-01-01) Project scheduling is a common problem of today's companies, which have project type production system. Project scheduling is a mechanism to communicate what tasks need to get done and which organizational resources will be allocated to complete those tasks in what timeframe. In this study, it is aimed to find the shortest completion time of projects and the starting/ending time of each activity as well in a software company, which is running simultaneous projects including multiple activities with predeces...

Citation Formats

S. Aminbakhsh and R. Sönmez, “Pareto oriented optimization of discrete time cost trade off problem using particle swarm optimization,” Lincoln, United Kingdom, 2015, p. 33, Accessed: 00, 2021. [Online]. Available: http://www.arcom.ac.uk/-docs/proceedings/a2604506123225031831e79ce484fe5d.pdf.