Dear users,
This is our new website
(we are launching the new one in order to improve our communication and provide better services to the editors and authors. So we will upload all data soon).
Please click here to visit our current website, and also to submit your paper:
www.ijsom.com
Thanks for your patience during relocation.
Feel free to contact us via info@ijsom.com and ijsom.info@gmail.com
|
|
|
|
|
|
|
 |
Search published articles |
 |
|
Showing 1 results for Non-Dominated Sorting Genetic Algorithm (nsga-Ii)
Masoud Rabbani, Safoura Famil Alamdar, Parisa Famil Alamdar,
Volume 3, Issue 3 (11-2016)
Abstract
In this study, a two-objective mixed-integer linear programming model (MILP) for multi-product re-entrant flow shop scheduling problem has been designed. As a result, two objectives are considered. One of them is maximization of the production rate and the other is the minimization of processing time. The system has m stations and can process several products in a moment. The re-entrant flow shop scheduling problem is well known as NP-hard problem and its complexity has been discussed by several researchers. Given that NSGA-II algorithm is one of the strongest and most applicable algorithm in solving multi-objective optimization problems, it is used to solve this problem. To increase algorithm performance, Taguchi technique is used to design experiments for algorithm’s parameters. Numerical experiments are proposed to show the efficiency and effectiveness of the model. Finally, the results of NSGA-II are compared with SPEA2 algorithm (Strength Pareto Evolutionary Algorithm 2). The experimental results show that the proposed algorithm performs significantly better than the SPEA2.
|
|
|
|
|
|
|
|
|
