Hierarchy Genetic Algorithm to Solve Multi-Objective Scheduling Problems Involving Various Types of Assignments for Parallel Processing System

2010 ◽  
pp. 251-256 ◽  
Author(s):  
Masahiro Arakawa
2014 ◽  
Vol 31 (8) ◽  
pp. 689-696 ◽  
Author(s):  
Jong Hoon Choi ◽  
Je Seok Kim ◽  
Jin Han Jeong ◽  
Jung Min Kim ◽  
Jahng Hyon Park

Author(s):  
Ramin Taheri ◽  
Karim Mazaheri

In this paper, a numerical optimization method has been carried out to optimize the shape and efficiency of a propeller. For analysis of the hydrodynamic performance parameters, an extended vortex lattice method was used by implementing an open-source code which is called OpenProp. The method of optimization is a non-gradient based algorithm. After a trade-off between a few gradient-based and non-gradient based algorithms, it is found that the problem of being trapped in local optimum solutions can be easily solved by choosing nongradient based ones. Hence, modified Genetic algorithm is used to implement the so-called hydrodynamic performance analyzer code. The objective function is to maximize efficiency by considering the design variables as non-dimensional blade’s chord and thickness distribution along the blade. For initial guess data of the DTRC 4119 propeller which are radially distributed along the blade is used. The hydrodynamic performance analyzer code is modified by a higher order QuasiNewton scheme. Also hybrid function is used to accurate the convergence. Finally, parallel processing implementation on the codes has been done successfully. To improve the computation speed, the algorithm is improved to be extended on a parallel processing system. The process of parallelizing has been done simplicity by Matlab M-code and the number of cores has been chosen as 4. The final results verify both fast convergence in comparison with common methods and nearly 10% improvement in propeller efficiency (mechanical efficiency of the system) which is significant for these kinds of problems. Therefore, the algorithm starts with geometry arrived at by other researchers and improves it to a more efficient propeller.


2020 ◽  
Vol 12 (1) ◽  
pp. 168781401988529 ◽  
Author(s):  
Xin Zan ◽  
Zepeng Wu ◽  
Cheng Guo ◽  
Zhenhua Yu

This work focuses on multi-objective scheduling problems of automated manufacturing systems. Such an automated manufacturing system has limited resources and flexibility of processing routes of jobs, and hence is prone to deadlock. Its scheduling problem includes both deadlock avoidance and performance optimization. A new Pareto-based genetic algorithm is proposed to solve multi-objective scheduling problems of automated manufacturing systems. In automated manufacturing systems, scheduling not only sets up a routing for each job but also provides a feasible sequence of job operations. Possible solutions are expressed as individuals containing information of processing routes and the operation sequence of all jobs. The feasibility of individuals is checked by the Petri net model of an automated manufacturing system and its deadlock controller, and infeasible individuals are amended into feasible ones. The proposed algorithm has been tested with different instances and compared to the modified non-dominated sorting genetic algorithm II. The experiment results show the feasibility and effectiveness of the proposed algorithm.


Author(s):  
Paul R. Wilding ◽  
Nathan R. Murray ◽  
Matthew J. Memmott

Multi-objective optimization is a powerful tool that has been successfully applied to many fields but has seen minimal use in the design and development of nuclear power plant systems. When applied to design, multi-objective optimization involves the manipulation of key design parameters in order to develop optimal designs. These design parameters include continuous and/or discrete variables and represent the physical design specifications. They are modified across a specific design space to accomplish a number of set objective functions, representing the goals for both system design and performance, which conflict and cannot be combined into a single objective function. In this paper, a non-dominated sorting genetic algorithm (NSGA) and parallel processing in Python 3 were used to optimize the design of the passive endothermic reaction cooling system (PERCS) model developed in RELAP5/MOD 3.3. This system has been proposed as a retrofit to currently-operating light water reactors (LWR) and is designed to remove decay heat from the reactor core via the endothermic decomposition of magnesium carbonate (MgCO3) and natural circulation of the reactor coolant. The PERCS design is currently a shell-and-tube heat exchanger, with the coolant flowing through the tube side and MgCO3 on the shell side. During a station blackout (SBO), the PERCS initially keeps the reactor core outlet temperature from exceeding 635 K and then reduces it to below 620 K for 30 days. The optimization of the PERCS was performed with three different objectives: (1) minimization of equipment costs, (2) minimization of deviation of the core outlet temperature during a SBO from its normal operation steady-state value, and (3) minimization of fractional consumption of MgCO3, a metric that is measurable and directly related to the operating time of the PERCS. The manipulated parameters of the optimization include the radius of the PERCS shell, the pitch, hydraulic diameter, thickness and length of the PERCS tubes, and the elevation of the PERCS with respect to the reactor core. The NSGA methodology works by creating a population of PERCS options with varying design parameters. Using the evolutionary concepts of selection, reproduction, mutation, and survival of the fittest, the NSGA method repeatedly generates new PERCS options and gets rid of less fit ones. In the end, the result was a Pareto front of PERCS designs, each thermodynamically viable and optimal with respect to the three objectives. The Pareto front of options as a whole represents the optimized trade-off between the objectives.


Sign in / Sign up

Export Citation Format

Share Document