Solving a multi-mode bi-objective resource investment problem using meta-heuristic algorithms

Abstract

In this paper, a multi-mode bi-objective resource investment problem 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 is considered. Due to problem complexity, two modified meta-heuristic algorithms namely NSGA-II and MOPSO are applied to solve the model. To compare the algorithms, a set of test problem is considered. Furthermore, a MADM approach called TOPSIS is applied to compare the algorithms' results. To compare the algorithms' performance, six well-known metrics, as well as the graphical comparison are considered. Finally, the computational results declare that NSGA-II has better performance regarding the performance metrics.

A hybrid algorithm for unrelated parallel machines scheduling

“…Determination of the parameters is an important issue on the efficiency of the proposed algorithm, it means that the value that our parameters are set on, can change the performance of the meta heuristics algorithms (Arjmand & Najafi, 2015). In order to make a better comparison between GA, SA and proposed hybrid algorithm, different values were evaluated for each parameter, and the best values were selected for simulations, this work is also done in some papers for example in Shokouhifar, and Jalali 2015a and 2015b.…”

A new approach for solving resource constrained project scheduling problems using differential evolution algorithm

“…Different methods have been proposed to remove infeasible solutions (Arjmand & Najafi, 2015). The repair approach implemented by Shahdrok and Kianfer (2007) changes infeasible solutions to feasible solutions and was applied here.…”

“…The design of the first part of the chromosomes was based on the activity sequence proposed by Hartmann (2000). For MRCPSP problems, the chromosomes should consist of three parts (Arjmand & Najafi, 2015). A list of available resource capacities has been proposed for second part of the present approach for SMRCPSP as: (( ,..., ), ( ,..., )).…”

“…A resource constrained project scheduling problem (RCPSP) is a type of project scheduling that plays a prominent role in project management (Arjmand & Najafi, 2015). RCPSP discusses scheduling plans and projects in light of resource constraints.…”

“…The RIP with discounted cash flow (RIPDCF) maximizes discounted cash flows for project payments as proposed by Najafi and Niaki (2007). Arjmand and Najafi (2015) solved a multi-mode bi-objective resource investment problem using two modified meta-heuristic algorithms they called NSGA-II and MOPSO. They compared the algorithms using the MADM approach called TOPSIS.…”