Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms
The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Islamic Azad University, Qazvin Branch
2016-12-01
|
| Series: | Journal of Optimization in Industrial Engineering |
| Subjects: | |
| Online Access: | http://www.qjie.ir/article_263_df1598cc2762beba0b7ea8a8063beb4a.pdf |
| _version_ | 1811203214733737984 |
|---|---|
| author | Javad Hasanpour Mohammad Ghodoosi Zahra Sadat Hosseini |
| author_facet | Javad Hasanpour Mohammad Ghodoosi Zahra Sadat Hosseini |
| author_sort | Javad Hasanpour |
| collection | DOAJ |
| description | The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategies. We also introduce the preemptive extension of the problem which allows activity splitting. In this paper the preemption multi-mode resource-constrained project scheduling problem (P-MMRCPSP) with Minimum makespan and the maximization of net present value (NPV) has been considered. Since the considered model is NP-Hard, The performance of our proposed model is evaluated by comparison with two well-known algorithms; non-dominated sorting genetic algorithm (NSGA II), multi-objective imperialist competitive algorithm (MOICA). These metaheuristics have been compared on the basis of a computational experiment performed on a set of instances obtained from standard test problems constructed by the ProGen project generator, where, additionally, cash flows were generated randomly with the uniform distribution. Since the effectiveness of most meta-heuristic algorithms significantly depends on choosing the proper parameters. A Taguchi experimental design method (DOE) was applied to set and estimate the proper values of GAs parameters for improving their performances. The computational results show that the proposed MOICA outperforms the NSGA-II. |
| first_indexed | 2024-04-12T02:52:01Z |
| format | Article |
| id | doaj.art-9adc7c65c39e4fe0ac5de75bf5ebfe2f |
| institution | Directory Open Access Journal |
| issn | 2251-9904 2423-3935 |
| language | English |
| last_indexed | 2024-04-12T02:52:01Z |
| publishDate | 2016-12-01 |
| publisher | Islamic Azad University, Qazvin Branch |
| record_format | Article |
| series | Journal of Optimization in Industrial Engineering |
| spelling | doaj.art-9adc7c65c39e4fe0ac5de75bf5ebfe2f2022-12-22T03:50:57ZengIslamic Azad University, Qazvin BranchJournal of Optimization in Industrial Engineering2251-99042423-39352016-12-011021799210.22094/joie.2016.263263Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithmsJavad Hasanpour0Mohammad Ghodoosi1Zahra Sadat Hosseini2Msc, Department of industrial Engineering, Quchan University of Advanced Technology, Quchan, IranMsc, Department of industrial Engineering, University of Torbat Heydarieh, Torbat Heydarieh, IranPhD Student of Industrial Engineering, Yazd University ,Yazd, IranThe aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategies. We also introduce the preemptive extension of the problem which allows activity splitting. In this paper the preemption multi-mode resource-constrained project scheduling problem (P-MMRCPSP) with Minimum makespan and the maximization of net present value (NPV) has been considered. Since the considered model is NP-Hard, The performance of our proposed model is evaluated by comparison with two well-known algorithms; non-dominated sorting genetic algorithm (NSGA II), multi-objective imperialist competitive algorithm (MOICA). These metaheuristics have been compared on the basis of a computational experiment performed on a set of instances obtained from standard test problems constructed by the ProGen project generator, where, additionally, cash flows were generated randomly with the uniform distribution. Since the effectiveness of most meta-heuristic algorithms significantly depends on choosing the proper parameters. A Taguchi experimental design method (DOE) was applied to set and estimate the proper values of GAs parameters for improving their performances. The computational results show that the proposed MOICA outperforms the NSGA-II.http://www.qjie.ir/article_263_df1598cc2762beba0b7ea8a8063beb4a.pdfMulti-objective Project SchedulingResource ConstraintPreemptiveNet Present ValueMeta-heuristic Algorithm |
| spellingShingle | Javad Hasanpour Mohammad Ghodoosi Zahra Sadat Hosseini Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms Journal of Optimization in Industrial Engineering Multi-objective Project Scheduling Resource Constraint Preemptive Net Present Value Meta-heuristic Algorithm |
| title | Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms |
| title_full | Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms |
| title_fullStr | Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms |
| title_full_unstemmed | Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms |
| title_short | Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms |
| title_sort | optimizing a bi objective preemptive multi mode resource constrained project scheduling problem nsga ii and moica algorithms |
| topic | Multi-objective Project Scheduling Resource Constraint Preemptive Net Present Value Meta-heuristic Algorithm |
| url | http://www.qjie.ir/article_263_df1598cc2762beba0b7ea8a8063beb4a.pdf |
| work_keys_str_mv | AT javadhasanpour optimizingabiobjectivepreemptivemultimoderesourceconstrainedprojectschedulingproblemnsgaiiandmoicaalgorithms AT mohammadghodoosi optimizingabiobjectivepreemptivemultimoderesourceconstrainedprojectschedulingproblemnsgaiiandmoicaalgorithms AT zahrasadathosseini optimizingabiobjectivepreemptivemultimoderesourceconstrainedprojectschedulingproblemnsgaiiandmoicaalgorithms |