In this chapter some alternatives are discussed to take advantage of parallel computers in dynamic multi-objective optimization problems (DMO) using evolutionary algorithms. In DMO problems, the objective functions, the constraints, and hence, also the solutions, can change over time and usually demand to be solved online. Thus, high performance computing approaches, such as parallel processing...

This paper presents a decision tool for the optimisation of wind turbine technical parameters, using multiphysical model power system. includes modelling aerodynamical, mechanical and electromechanical system behaviours. The aerodynamics is based on blade element momentum model. A mass turbines components also used in this paper. performed with NSGA-II algorithm which may choose parameters (bla...

In this study, nondominated sorting genetic algorithm II (NSGA-II) was used to minimize the cost and carbon emissions of a liquefied natural gas (LNG) dual-fuel ship for given route. This study considered regulations emission control areas (ECA) European Union (EU) Emissions Trading System (ETS) determine optimal speed LNG/oil ratio ship. NSGA-II arrival time at each port LNG usage voyage leg a...

this paper discusses the performance evaluation and availability analysis of ammonia synthesis unit of a fertilizer plant. the fertilizer plant is a complex and repairable engineering system comprises of various units viz. shell gasification and carbon recovery, desulphurization, co-shift conversion, decarbonation, nitrogen wash and ammonia synthesis etc. one of the most important functionaries...

Reliability optimization problem has a wide application in engineering area. One of the most important problems in reliability is redundancy allocation problem (RAP). In this research, we worked on a RAP with repairable components and k-out-of-n sub-systems structure. The objective function was to maximize system reliability under cost and weight constraints. The aim was determining optimal com...

Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) O(mN3) computational complexity (where m is the number of objectives and N is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algo...

Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload ...