University of TehranAdvances in Industrial Engineering2783-174450320161121Three Developed Meta-heuristic Algorithms to Solve RACP Minimizing Makespan and Total Resource Costs Simultaneouslyارائۀ سه الگوریتم فرا ابتکاری توسعهیافته بهمنظور حل مسئلۀ هزینۀ دسترسپذیری منابع با اهداف کمینهسازی زمان اتمام پروژه و مجموع هزینههای منابع بهصورت همزمان4714826317810.22059/jieng.2016.63178ENAmir Abbas NajafiFaculty of Industrial Engineering, Khajeh Nasir Toosi University of Technology, Tehran, IranMasoud ArjmandFaculty of Industrial Engineering, Khajeh Nasir Toosi University of Technology, Tehran, IranJournal Article20160605In this paper, a bi-objective resource availability cost problem (RACP) is studied, in which the first objective function tries to minimize the completion time of the project, and the second one tries to minimize the total resource costs. Due to the problem complexity, three developed meta-heuristic algorithms, namely NSGA-II and NRGA and MOPSO, are applied to solve the model. To evaluate the algorithms, a set of tests’ problem are considered. In addition, a MADM approach called TOPSIS is employed to compare the algorithms' results. Finally, the sensitivity analysis in terms of problem’s performance is fulfilled.https://aie.ut.ac.ir/article_63178_ffe698baa7942ed5ca551d159e7a4bb9.pdf