Abstract
In construction projects, critical path method (CPM) has been mainly used for project scheduling and planning in the past. The main objective of CPM is to find critical activities and schedule the project in such a way that the project makespan is minimized. Resource allocation project scheduling problem has been one of the most popular issues among construction management researchers in the past decades. Resource leveling problem in the real world is also important and should be considered in the planning of a project. On the other side, since these two objectives have opposite goals in the projects, considering both of these objectives simultaneously has always been a challenging problem. In this paper, we try to solve these problems at the same time. For this purpose, two new metaheuristic algorithms so-called colliding body optimization and charged system search are utilized. Two case examples are solved to show the applicability and performance of the considered algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alcaraz J, Maroto C, Ruiz R (2003) Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. J Oper Res Soc 54:614–626
Al-Jibouri S (2002) Effects of resource management regimes on project schedule. Int J Project Manag 20:271–277
Blazewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints: classification and complexity. Discrete Appl Math 5:11–24
Boctor F (1993) Heuristics for scheduling projects with resource restrictions and several resource-duration modes. Int J Prod Res 31:2547–2558
Burgess AR, Killebrew JB (1962) Variation in activity level on a cyclic arrow diagram. J Ind Eng 13:76–83
Chen PH, Weng H (2008) A two-phase GA model for resource-constrained project scheduling. Autom Constr 18:285–298
Hartmann S (2001) Project scheduling with multiple modes: a genetic algorithm. Ann Oper Res 102:111–135
Hartmann S, Drexl A (1998) Project scheduling with multiple modes: a comparison of exact algorithms. Networks 32:283–297
Hartmann S, Kolisch R (2006) Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem: an update. Eur J Oper Res 127:394–407
Hegazy T (1999) Optimization of resource allocation and leveling using genetic algorithms. J Constr Eng Manag 125:167–175
Jing-wen Z, Hui-fang S (2009) Multi-mode double resource-constrained time/cost trade-offs project scheduling problems. In: IEEE management and service science international conference. Wuhan, pp 1–4
Kaveh A (2014) Advances in metaheuristic algorithms for optimal design of structures. Springer, Switzerland
Kaveh A, Mahdavai VR (2014a) Colliding bodies optimization: a novel meta-heuristic method. Comput Struct 139:18–27
Kaveh A, Mahdavai VR (2014b) Colliding bodies optimization for discrete optimal design of truss structures. Comput Struct 139:43–53
Kaveh A, Sharafi P (2012) Ordering for bandwidth and profile minimization problems via charged system search method. Iran J Sci Technol 36:39–52
Kaveh A, Shokohi F (2014) Cost optimization of castellated beams using charged system search algorithm. Iran J Sci Technol Trans Civil Eng 38(C1+):235–249
Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mech 213:267–286
Kaveh A, Talatahari S, Farhmand Azar B (2012) Optimum design of composite open channels using charged system search algorithm. Iran J Sci Technol 36:67–77
Kaveh A, Khanzadi M, Alipour M, Rajabi Naraky M (2015) CBO and CSS algorithms for resource allocation and time-cost trade-off. Period Polytech Civil Eng 59(3):361–371
Kim KW, Yun YS, Yoon JM, Gend M, Yamazaki G (2005) Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling. Comput Ind 56:143–160
Knotts G, Dror M, Hartman B (2000) Agent-based project scheduling. IIE Trans 32:387–401
Kolisch R, Drexl A (1997) Local search for nonpreemptive multi-mode resource constrained project scheduling. IIE Trans 29:987–999
Koulinas GK, Anagnostopoulos KP (2013) A new tabu search-based hyper-heuristic algorithm for solving construction leveling problems with limited resource availabilities. Autom Constr 31:169–175
Liao TW, Egbelu PJ, Sarker BR, Leu SS (2011) Metaheuristics for project and construction management: a state-of-the-art review. Autom Constr 20:491–505
Özdamar L, Ulusoy G (1994) A local constraint based analysis approach to project scheduling under general resource constraints. Eur J Oper Res 79:287–298
Patterson J, Slowinski R, Talbot F, Weglarz J (1989) An algorithm for a general class of precedence and resource constrained scheduling problem. In: Slowinski R, Weglarz J (eds) Advances in project scheduling. Elsevier, Amsterdam, pp 3–28
Roca J, Pugnaghi E, Libert G (2008) Solving an extended resource leveling problem with multiobjective evolutionary algorithms. World Acad Sci Eng Technol 46:712–723
Talbot F (1982) Resource-constrained project scheduling with time-resource trade-offs: the non-preemptive case. Manag Sci 28:1197–1210
Zhao SL, Liu Y, Zhao HM, Zhou R (2006) GA-based resource leveling optimization for construction project. In: IEEE fifth international conference on machine learning and cybernetics, Dalian, pp 2363–2367
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Khanzadi, M., Kaveh, A., Alipour, M. et al. Application of CBO and CSS for Resource Allocation and Resource Leveling Problem. Iran. J. Sci. Technol.Trans. Civ. Eng. 40, 1–10 (2016). https://doi.org/10.1007/s40996-016-0004-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40996-016-0004-5