2013
DOI: 10.1016/j.cie.2012.09.008
|View full text |Cite
|
Sign up to set email alerts
|

A non-dominated sorting genetic algorithm based approach for optimal machines selection in reconfigurable manufacturing environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 114 publications
(22 citation statements)
references
References 11 publications
0
22
0
Order By: Relevance
“…To map the whole Pareto optimal frontier, the optimization procedure often should be repeated many times, which is a time-consuming process [18]. Evolutionary algorithms have been recognized to be well suited to multiobjective optimization, for example, one of the most efficient and commonly used versions of multi-objective GA (NSGA-II) can handle large and complex constraints by natural-inspired operators, and the NSGA-II algorithm has low computational complexity and good convergence by applying effective elite strategy than the previous evolutionary algorithms [15]; it has been successfully applied in solving many complex engineering optimization problems and achieved remarkable results [19][20][21][22][23][24][25][26]. First of all, NSGA-II is selected to solve the multi-objective optimization model for oil-gas production process, and then, in order to further improve the diversity and convergence of Pareto optimal solutions obtained by NSGA-II algorithm when solving the complicated and constrained optimization problems, an improved NSGA-II algorithm (I-NSGA-II) is proposed in this paper.…”
Section: Multi-objective Optimization For Oil-gas Production Process mentioning
confidence: 99%
“…To map the whole Pareto optimal frontier, the optimization procedure often should be repeated many times, which is a time-consuming process [18]. Evolutionary algorithms have been recognized to be well suited to multiobjective optimization, for example, one of the most efficient and commonly used versions of multi-objective GA (NSGA-II) can handle large and complex constraints by natural-inspired operators, and the NSGA-II algorithm has low computational complexity and good convergence by applying effective elite strategy than the previous evolutionary algorithms [15]; it has been successfully applied in solving many complex engineering optimization problems and achieved remarkable results [19][20][21][22][23][24][25][26]. First of all, NSGA-II is selected to solve the multi-objective optimization model for oil-gas production process, and then, in order to further improve the diversity and convergence of Pareto optimal solutions obtained by NSGA-II algorithm when solving the complicated and constrained optimization problems, an improved NSGA-II algorithm (I-NSGA-II) is proposed in this paper.…”
Section: Multi-objective Optimization For Oil-gas Production Process mentioning
confidence: 99%
“…With the help of a genetic algorithm, they computed lot sizes, analogous configurations, and optimal scheduling of production activities. Furthermore, a non-dominated sorting genetic algorithm (NSGA-II) was projected by Bensmaine et al [37] to choose the candidate reconfigurable machines. The main aim was a reduction of the overall cost (sum of manufacturing, reconfiguration, tool changing, and tooling costs) and overall completion time.…”
Section: Literature Surveymentioning
confidence: 99%
“…A quantitative model was also developed for RMS scalability by Wang et al [7] which calculated the number of reconfigurations based on adjustment gradient. NSGA-II technique has also been used by Bensmaine et al [19] in the selection of optimal machines from the set of candidate machine configurations. In this research work multi product case with high degree of freedom can be considered as future work and with the idea of co-evolution, the machine configurations can be used for different product designs over and over again preserving the feasibility of the system for a long period of time.…”
Section: Literature Reviewmentioning
confidence: 99%