<b>The Optimization of the Time-Cost Tradeoff Problem in Projects with Conditional Activities Using of the Multi-Objective Charged System Search Algorithm (SMOCSS)</b>
DOI:
https://doi.org/10.7596/taksad.v5i3.571Keywords:
Time-cost tradeoff problem (TCTP), multi-objective optimization, charged system search algorithm (CSS), project management, simple multi-objective charged system search (SMOCSS).Abstract
Abstract
The appropriate planning and scheduling for reaching the project goals in the most economical way is the very basic issue of the project management. As in each project, the project manager must determine the required activities for the implementation of the project and select the best option in the implementation of each of the activities, in a way that the least final cost and time of the project is achieved. Considering the number of activities and selecting options for each of the activities, usually the selection has not one unique solution, but it consists of a set of solutions that are not preferred to each other and are known as Pareto solutions. On the other hand, in some actual projects, there are activities that their implementation options depend on the implementation of the prerequisite activity and are not applicable using all the implementation options, and even in some cases the implementation or the non-implementation of some activities are also dependent on the prerequisite activity implementation. These projects can be introduced as conditional projects. Much researchs have been conducted for acquiring Pareto solution set, using different methods and algorithms, but in all the done tasks the time-cost optimization of conditional projects is not considered. Thus, in the present study the concept of conditional network is defined along with some practical examples, then an appropriate way to illustrate these networks and suitable time-cost formulation of these are presented. Finally, for some instances of conditional activity networks, conditional project time-cost optimization conducted multi-objectively using known meta-heuristic algorithms such as multi-objective genetic algorithm, multi-objective particle swarm algorithm and multi-objective charged system search algorithm.
References
Hindelang, T.J., Muth, J.F. (1979). A dynamic programming algorithm for decision CPM networks. Operat Res, pp. 225-241.
Elmaghraby, S.E. (1993). Resource allocation via dynamic programming in activity networks, Eur. J. Operational Res., 64. 199-215.
Feng, C.W., Liu, L. & Burns, S.A. (1997). Using genetic algorithms to solve construction time-cost trade-off problems’, Journal of Computing in Civil Engineering, ASCE, 11(3). 184-189.
Zheng, D. X.M., Thomas N.g., S.T. & Kumaraswamy, M.M. (2004). Applying a genetic algorithm-based multi-objective approach for time-cost optimization’, Journal of Construction Engineering and Management. 130(2). 168-176.
Daisy X. M., Zheng, S., Thomas N.g., & Mohan M. Kumaraswamy. (2005). Applying Pareto Ranking and Niche Formation to Genetic Algorithm-Based Multiobjective Time–Cost. Optimization. J. Construction. Eng. Manage. 131(1), 81-91.
Coello Coello, C. A., Pulido, G. T., & Lechuga, M. S. (2004). Handling multiple objectives with particle swarm optimization. IEEE Transaction on Evolutionary Computation, 8(3), 256–279.
Carlos A. Coello Coello C. A., David A., Van Veldhuizen, Gary B. Lamont. (2002). Evolutionary Algorithms for Solving Multi-Objective Problems. Boston. Kluwer Academic Publishers.
Kaveh A., Talatahari S. (2010). A novel heuristic optimization method: charged system search. Acta Mech; 213: 267–289.
Kaveh, A., & Talatahari, S. (2010). Optimal design of skeletal structures via the charged system search algorithm. Structural and Multidisciplinary Optimization. 37. 893–911.
Kaveh, A., & Talatahari, S. (2010). Charged system search for optimum grillage systems design using the LRFD-AISC code. Journal of Constructional Steel Research. (66), 767–771.
Sharbatdar M.K., Talatahari S., Mousavi. M.R. (2016). Developing New Charged System Search-based Algorithm: Application in The Time-Cost Trade-off Problems. TURKISH ONLINE JOURNAL OF DESIGN ART AND COMMUNICATION. 4.
Butterfield. D. (2011). Painting and Decorating, 6th Ed. Wiley-Blackwell. ISBN: 978-1-4443-3501-9.
McCabe. G.B., Kennedy. J.R. (2003). Planning the Modern Public Library Building. Westport, Conecticut. London. The libraries unlimited library management collection.
Levin. R. (1980). Planning and control with PERT/CPM. M.Y. McGrow-Hill.
Downloads
Published
How to Cite
Issue
Section
License
All papers licensed under Creative Commons 4.0 CC-BY.- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
Under the following terms:
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
