期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2017
卷号：17
期号：5
页码：125-134
出版社：International Journal of Computer Science and Network Security
摘要：In this paper an Imperialist competitive algorithm was proposed for Multi-mode resource constrained project scheduling problem (MRCPSP) with considering flotation of activities and discounted cash flow on project cost. This problem is a generalization of the RCPSP problem. In First step mathematical model of problem was defined. Then a solution based on imperialist competitive algorithm was proposed. In next step Taguchi experiments designing applied to tune available parameters of algorithm in order to increase efficiency. Consideration of activities flotation leads to reducing project cost value without changing duration of completing project. To evaluate efficiency of algorithm the result of imperialist competitive algorithm shows low data dispersion and reduction total cost of project compared with genetic and particle swarm optimization algorithm in the same condition.
