Multi-objective optimization of rolling schedules for tandem hot rolling based on opposition learning multi-objective genetic algorithm

Author(s):  
Yong Li ◽  
Xinhua Zhao ◽  
Yu Wang ◽  
Mingxu Ren
2014 ◽  
Vol 962-965 ◽  
pp. 2903-2908
Author(s):  
Yun Lian Liu ◽  
Wen Li ◽  
Tie Bin Wu ◽  
Yun Cheng ◽  
Tao Yun Zhou ◽  
...  

An improved multi-objective genetic algorithm is proposed to solve constrained optimization problems. The constrained optimization problem is converted into a multi-objective optimization problem. In the evolution process, our algorithm is based on multi-objective technique, where the population is divided into dominated and non-dominated subpopulation. Arithmetic crossover operator is utilized for the randomly selected individuals from dominated and non-dominated subpopulation, respectively. The crossover operator can lead gradually the individuals to the extreme point and improve the local searching ability. Diversity mutation operator is introduced for non-dominated subpopulation. Through testing the performance of the proposed algorithm on 3 benchmark functions and 1 engineering optimization problems, and comparing with other meta-heuristics, the result of simulation shows that the proposed algorithm has great ability of global search. Keywords: multi-objective optimization;genetic algorithm;constrained optimization problem;engineering application


2011 ◽  
Vol 48-49 ◽  
pp. 314-317
Author(s):  
Di Wu ◽  
Sheng Yao Yang ◽  
J.C. Liu

The performance optimization of cognitive radio is a multi-objective optimization problem. Existing genetic algorithms are difficult to assign the weight of each objective when the linear weighting method is used to simplify the multi-objective optimization problem into a single objective optimization problem. In this paper, we propose a new cognitive decision engine algorithm using multi-objective genetic algorithm with population adaptation. A multicarrier system is used for simulation analysis, and experimental results show that the proposed algorithm is effective and meets the real-time requirement.


2020 ◽  
Vol 17 (10) ◽  
pp. 2050007
Author(s):  
Guiping Liu ◽  
Rui Luo ◽  
Sheng Liu

In this paper, a new interval multi-objective optimization (MOO) method integrating with the multidimensional parallelepiped (MP) interval model has been proposed to handle the uncertain problems with dependent interval variables. The MP interval model is integrated to depict the uncertain domain of the problem, where the uncertainties are described by marginal intervals and the degree of the dependencies among the interval variables is described by correlation coefficients. Then an efficient multi-objective iterative algorithm combining the micro multi-objective genetic algorithm (MOGA) with an approximate optimization method is formulated. Three numerical examples are presented to demonstrate the efficiency of the proposed approach.


2012 ◽  
Vol 457-458 ◽  
pp. 1142-1148
Author(s):  
Fu Yang ◽  
Liu Xin ◽  
Pei Yuan Guo

Hardware-software partitioning is the key technology in hardware-software co-design; the results will determine the design of system directly. Genetic algorithm is a classical search algorithm for solving such combinatorial optimization problem. A Multi-objective genetic algorithm for hardware-software partitioning is presented in this paper. This method can give consideration to both system performance and indicators such as time, power, area and cost, and achieve multi-objective optimization in system on programmable chip (SOPC). Simulation results show that the method can solve the SOPC hardware-software partitioning problem effectively.


2008 ◽  
Vol 32 (9) ◽  
pp. 1781-1789 ◽  
Author(s):  
N. Chakraborti ◽  
B. Siva Kumar ◽  
V. Satish Babu ◽  
S. Moitra ◽  
A. Mukhopadhyay

Author(s):  
A. Farhang-Mehr ◽  
J. Wu ◽  
S. Azarm

Abstract Some preliminary results for a new multi-objective genetic algorithm (MOGA) are presented. This new algorithm aims at obtaining the fullest possible representation of observed Pareto solutions to a multi-objective optimization problem. The algorithm, hereafter called entropy-based MOGA (or E-MOGA), is based on an application of the concepts from the statistical theory of gases to a MOGA. A few set quality metrics are introduced and used for a comparison of the E-MOGA to a previously published MOGA. Due to the stochastic nature of the MOGA, confidence intervals with a 95% confidence level are calculated for the quality metrics based on the randomness in the initial population. An engineering example, namely the design of a speed reducer is used to demonstrate the performance of E-MOGA when compared to the previous MOGA.


MRS Advances ◽  
2019 ◽  
Vol 4 (61-62) ◽  
pp. 3373-3380
Author(s):  
Carlos A Hernández Carreón ◽  
Juana E Mancilla Tolama ◽  
Guadalupe Castilla Valdez ◽  
Iván Hernández González

ABSTRACTThe hot rolling process reduces a slab passing through a series of work-rolls to obtain a strip of target thickness. Developing robust, efficient, and accurate simulation methods improve the process. This research aims to minimize the hot rolling time, bending of work rolls, thermal crown, and wear of work rolls, subject to some process constraints. The problem solution is by using a multi-objective genetic algorithm with four function objectives. The second generation of the Non-dominated Sorting Genetic Algorithm was chosen to solve the problem of this research. A probed constitutive model has been incorporated into the algorithm to compute the flow stress as a function of the chemical composition of steels. The algorithm implemented to minimize the four objectives proposed obtained the optimal schedule and associated makespan.


Sign in / Sign up

Export Citation Format

Share Document