# Study on Parameter Optimization Design of Drum Brake Based on Hybrid Cellular Multiobjective Genetic Algorithm

Authors: Yi Zhang; Hu Zhang; Chao Lu
Journal: Mathematical Problems in Engineering
 (2012)

---

## Abstract

In consideration of the significant role the brake plays in ensuring the fast and safe running of vehicles, and since the present parameter optimization design models of brake are far from the practical application, this paper proposes a multiobjective optimization model of drum brake, aiming at maximizing the braking efficiency and minimizing the volume and temperature rise of drum brake. As the commonly used optimization algorithms are of some deficiency, we present a differential evolution cellular multiobjective genetic algorithm (DECell) by introducing differential evolution strategy into the canonical cellular genetic algorithm for tackling this problem. For DECell, the gained Pareto front could be as close as possible to the exact Pareto front, and also the diversity of nondominated individuals could be better maintained. The experiments on the test functions reveal that DECell is of good performance in solving high-dimension nonlinear multiobjective problems. And the results of optimizing the new brake model indicate that DECell obviously outperforms the compared popular algorithm NSGA-II concerning the number of obtained brake design parameter sets, the speed, and stability for finding them.


---

## Body

## 1. Introduction

The safe reliability of the vehicles is attracting more and more attentions with the sharp increase in the vehicles. Since the improvement of the brake design and manufacturing is of great significance in ensuring the brake quality thus the vehicle’s safe running, the brake parameter optimization design which is a key part in the whole brake design procedure is becoming increasingly important. Therefore, the research in this field is becoming a hot topic.In general, in the brake parameters optimizing procedure, the first step is to set up parameter optimization model and the next step is to calculate the model with an optimization algorithm. A lot of researches have been done in this field [1–13], most of which are done by Chinese scholars. Their researches mainly focus on two aspects: the establishment of the optimization model [1, 3, 6, 7] and the design, selection, and application of the algorithms for solving the model [2, 4, 9, 10]. Although plenty of achievements have been gained in the existing studies, they still need to be improved to some extent, especially in the following three aspects. First, the complexity of the model is not satisfactory. In general, there are a lot of brake performance indicators, such as brake temperature rise, brake drum volume, and braking efficiency. However, in existing models, only one or two of them are selected as optimization objectives, which is far from engineering practice. Second, the multiobjective optimization problems are often solved by being transferred into single-objective problems with weighting or separate calculating method, which ignores the fact that the solution of a multiobjective optimization problem is a set. Third, the performance of the adopted algorithms cannot meet the requirements. The frequently used algorithms in the existing studies are the MATLAB optimization toolbox, basic genetic algorithms, basic ant colony algorithm, and so forth. However, these algorithms are easy to be trapped in local convergence when solving complex problems, for which the gained results are undesirable.Based on foregoing statement, this paper establishes a multiobjective optimization design model of drum brake, which aims at maximizing the braking efficiency and minimizing the volume and temperature rise of the drum brake. It is expected that this model could meet the requirements of practical engineering design better. Besides, in order to deal with the model more efficiently, a differential evolution cellular multiobjective genetic algorithm (DECell) is proposed by introducing a differential evolution strategy into the cellular genetic algorithm in which an individual may only interact with individuals belonging to its neighborhood. The proposed algorithm is then applied to solve the brake model.The rest of the paper is organized as follows. The next section shows the details of the multiobjective optimization model of drum brake. Section3 presents the differential cellular multiobjective genetic algorithm (DECell). Section 4 tests the performance of DECell using several representative test functions. The optimization procedures of design parameters of new brake model are presented in Section 5. And in Section 6, we study a case of designing brake using DECell. This paper concludes with a summary in Section 7.


## 2. Multiobjective Optimization Design Model of Drum Brake

Drum brake is one of the most commonly used brakes in vehicle design; it can be categorized into leading- and trailing-shoe brake, two-leading-shoe brake, two-trailing-shoe brake, and servo brake concerning the arrangement of the brake shoes. The optimization design object in this paper is the leading- and trailing-shoe brake, which is shown in Figure1.Figure 1
Structural parameters and force diagram.Figure1 shows the structural parameters and force diagram of the leading- and trailing-drum brake (only left part of the structure is presented). With the effect of braking force P, the two brake shoes at both sides rub the drum brake to generate frictional resisting torque and thus to brake. In Figure 1, F1 is the pressing force of the brake shoe, while Rf is the action radius of the frictional force. δ represents the angle between x axis and the active line of F1. The main structural parameters are the starting angle of brake friction plate (θ0), wrap angle of friction plate (θ), the distance from braking force P to the brake center (a), the central location of the brake shoe pin (c,c′), and so forth.


### 2.1. Design Variables

One hasXT=[x1,x2,…,x11]=[θ0,θ,b1,R,c′,c,a,b2,e,d,p], where θ0 is the starting wrap angle of the friction plate, θ is the wrap angle of the friction plate, b1 is the friction plate width, R is the brake drum radius, c and c′ are the central sites of the brake shoe pin, a means the distance from the braking force to the brake center, b2 is the brake width, e is the thickness of the brake drum, d is the brake cylinder diameter, and p is the braking oil pressure.


### 2.2. Objective Functions

The optimization target is the comprehensive performance of the brake. And the subobjectives are maximizing the braking efficiency factor and minimizing the volume and temperature rise of the drum brake. The subobjectives are presented as follows.(
1
) Braking Efficiency Factor
One has the following [14]:
(2.1)K=MμPRf,
where Mμ is the braking output torque, P is the input force, and Rf represents the action radius of the frictional force. Therefore, efficiency factor of the brake with tight (loose) shoe is as follows:
(2.2)K1,2=μ(a+c)c′(cosδ±μsinδ)∓μRf,
where
(2.3)Rf=4R[cosθ0-cos(θ0+θ)][cos2θ-cos2(θ0+θ)]2+[2θ-sin2(θ0+θ)+sin2θ0]2,δ=arctan[cos2θ0-cos2(θ0+θ)2θ-sin2(θ0+θ)+sin2θ0].
μ is the friction factor between the brake drum and the friction plate.
With the same braking force, the bigger the braking efficiency is, the bigger the braking torque is, and the better the brake performs, hence the more efficient the brake is. Therefore, the enhancement of braking efficiency is of great significance to the safe running of vehicle. On this basis, the braking efficiency factor is selected as the optimization objective, and the objective function is(2.4)f1(X)=K1+K2,
where K1 represents efficiency factor of the brake with tight shoe and K2 represents efficiency factor of the brake with loose shoe (see (2.2)).(
2
) The Volume of the Drum Brake
With the same function and efficiency, the smaller the brake is, the fewer materials and the less space it will take up. Hence, the volume of the brake drum should be as small as possible, and it is taken as the optimization objective as follows:(2.5)f2(X)=V=πb2(R+e)2.(
3
) Temperature Rise of Drum Brake
It can be regarded that the heat energy generated through braking is absorbed by the front brake and rear brake due to the fast braking process. The heat energy is then distributed to the front brake and rear brake in accordance with their distribution coefficients. The brake drum is installed at the rear wheel, so the rear brake temperature can be calculated by the following formula:(2.6)f3(X)=Δt=12×mava2(mdcd+mhch)×10-9(1-β),
where ma is the total mass of the vehicle (kg); md is the total mass of each drum brake (kg); mh is the total mass of the heating metal materials linking with the drum brake; Cd is the specific heat capacity (J/(kg·K)) of material of the drum brake, while Ch is the specific heat capacity (J/(kg·K)) of the heating metal materials linking the drum brake; va is the initial velocity (m/s) of the brake drum; β is the braking force distribution coefficient. For the convenience of calculation, the brake mass md and the total mass of the metal materials linking the drum brake mh are selected through the following formula:
(2.7)md=2ρde·2πRb2,mh=2ρcΔ·2θb1R,
where ρd and ρc are the density of the brake drum and the density of the brake shoe, respectively. Let ρd=ρc=7570 kg/m3; e and Δ are the thickness of brake drum and thickness of brake shoe, respectively, where Δ=10 mm.


### 2.3. Constraint Conditions

(
1
) Self-Locking Constraint
The possibility of the self-locking for the brake shoe should be taken into consideration when designing the drum brake. To avoid self-locking, the following constraint should be satisfied:(2.8)g1(X)=μ-c′cosδRf-c′sinδ<0.(
2
) Constraint of the Maximum Pressure on the Liners
The maximum pressure on the frictional liners should be less than the defined pressure value:(2.9)g2(X)=πd2p(a+c)Rfb1R2[cosθ0-cos(θ0+θ)]·[c′(cosδ+μsinδ)-μRf]-1.6≤0.(
3
) Constraint of the Uniformity of Pressure Distribution
The nonuniform distribution of pressure would cause uneven wear of the frictional liners, which would change the contact area, location, and pressure characteristic of the friction interface. Then the braking efficiency and stability is greatly lowered. The constraint is as follows:(2.10)g3(X)=c′θ(a+c)sin(θ/2)-2≤0.(
4
) Constraint of the Wearing Characteristic of Frictional Liners
During emergency braking, the specific energy dissipating rate of the frictional liners should be less than the defined rate:(2.11)g4(X)=maυa28tθRb1-Eu≤0,
where Eu is the upper limit of the specific energy dissipating rate of rear wheels, while the general upper limit of the specific energy dissipating rate of the brake drum is 1.9 W/mm2; ma is the total mass of the vehicle; R and b1 are measured in millimeter and braking time t=va/j; va is the initial velocity (m/s); j is the braking deceleration (m/s2), and in general j=0.6g, where g is the gravity acceleration.(
5
) Constraints of the Friction Area of Brake Lining
While braking, the frictional characteristic would be better if the positive pressure and energy load of the brake shoe lining area get lower. In cars, the general value range of the friction area of drum brake lining should obey the following constraints:(2.12)g5(X)=104-Ap≤0,g6(X)=Ap-3×104≤0,
where Ap=b1Rθ (mm2).(
6
) Heating Load Constraint
To calculate the heating load of the brake, the temperature rise of brake from the initial speed of30km/h to full stop should be less than the defined value [Δt]=15 K [15]:
(2.13)g7(X)=Δt-[Δt]≤0.(
7
) Constraints of the Radius of Brake Drum
Since the diameter of car brake drum is usually64%~74% of rim diameter [10], thus, the ratio of car brake drum radius R against rim radius rd should be in the range:
(2.14)g8(X)=0.64-Rrd≤0,g9(X)=Rrd-0.74≤0,
where rd is the rim radius (mm).(
8
) Constraints of the Liner Width
When choosing the liner width, the pressure in a unit area should not be oversized since too large width would cause nonuniform contact. In general, the ratio of liner width against brake drum radius should meet the following constrains:(2.15)g10(X)=0.32-b1R≤0,g11(X)=b1R-0.54≤0.


## 2.1. Design Variables

One hasXT=[x1,x2,…,x11]=[θ0,θ,b1,R,c′,c,a,b2,e,d,p], where θ0 is the starting wrap angle of the friction plate, θ is the wrap angle of the friction plate, b1 is the friction plate width, R is the brake drum radius, c and c′ are the central sites of the brake shoe pin, a means the distance from the braking force to the brake center, b2 is the brake width, e is the thickness of the brake drum, d is the brake cylinder diameter, and p is the braking oil pressure.


## 2.2. Objective Functions

The optimization target is the comprehensive performance of the brake. And the subobjectives are maximizing the braking efficiency factor and minimizing the volume and temperature rise of the drum brake. The subobjectives are presented as follows.(
1
) Braking Efficiency Factor
One has the following [14]:
(2.1)K=MμPRf,
where Mμ is the braking output torque, P is the input force, and Rf represents the action radius of the frictional force. Therefore, efficiency factor of the brake with tight (loose) shoe is as follows:
(2.2)K1,2=μ(a+c)c′(cosδ±μsinδ)∓μRf,
where
(2.3)Rf=4R[cosθ0-cos(θ0+θ)][cos2θ-cos2(θ0+θ)]2+[2θ-sin2(θ0+θ)+sin2θ0]2,δ=arctan[cos2θ0-cos2(θ0+θ)2θ-sin2(θ0+θ)+sin2θ0].
μ is the friction factor between the brake drum and the friction plate.
With the same braking force, the bigger the braking efficiency is, the bigger the braking torque is, and the better the brake performs, hence the more efficient the brake is. Therefore, the enhancement of braking efficiency is of great significance to the safe running of vehicle. On this basis, the braking efficiency factor is selected as the optimization objective, and the objective function is(2.4)f1(X)=K1+K2,
where K1 represents efficiency factor of the brake with tight shoe and K2 represents efficiency factor of the brake with loose shoe (see (2.2)).(
2
) The Volume of the Drum Brake
With the same function and efficiency, the smaller the brake is, the fewer materials and the less space it will take up. Hence, the volume of the brake drum should be as small as possible, and it is taken as the optimization objective as follows:(2.5)f2(X)=V=πb2(R+e)2.(
3
) Temperature Rise of Drum Brake
It can be regarded that the heat energy generated through braking is absorbed by the front brake and rear brake due to the fast braking process. The heat energy is then distributed to the front brake and rear brake in accordance with their distribution coefficients. The brake drum is installed at the rear wheel, so the rear brake temperature can be calculated by the following formula:(2.6)f3(X)=Δt=12×mava2(mdcd+mhch)×10-9(1-β),
where ma is the total mass of the vehicle (kg); md is the total mass of each drum brake (kg); mh is the total mass of the heating metal materials linking with the drum brake; Cd is the specific heat capacity (J/(kg·K)) of material of the drum brake, while Ch is the specific heat capacity (J/(kg·K)) of the heating metal materials linking the drum brake; va is the initial velocity (m/s) of the brake drum; β is the braking force distribution coefficient. For the convenience of calculation, the brake mass md and the total mass of the metal materials linking the drum brake mh are selected through the following formula:
(2.7)md=2ρde·2πRb2,mh=2ρcΔ·2θb1R,
where ρd and ρc are the density of the brake drum and the density of the brake shoe, respectively. Let ρd=ρc=7570 kg/m3; e and Δ are the thickness of brake drum and thickness of brake shoe, respectively, where Δ=10 mm.


## 2.3. Constraint Conditions

(
1
) Self-Locking Constraint
The possibility of the self-locking for the brake shoe should be taken into consideration when designing the drum brake. To avoid self-locking, the following constraint should be satisfied:(2.8)g1(X)=μ-c′cosδRf-c′sinδ<0.(
2
) Constraint of the Maximum Pressure on the Liners
The maximum pressure on the frictional liners should be less than the defined pressure value:(2.9)g2(X)=πd2p(a+c)Rfb1R2[cosθ0-cos(θ0+θ)]·[c′(cosδ+μsinδ)-μRf]-1.6≤0.(
3
) Constraint of the Uniformity of Pressure Distribution
The nonuniform distribution of pressure would cause uneven wear of the frictional liners, which would change the contact area, location, and pressure characteristic of the friction interface. Then the braking efficiency and stability is greatly lowered. The constraint is as follows:(2.10)g3(X)=c′θ(a+c)sin(θ/2)-2≤0.(
4
) Constraint of the Wearing Characteristic of Frictional Liners
During emergency braking, the specific energy dissipating rate of the frictional liners should be less than the defined rate:(2.11)g4(X)=maυa28tθRb1-Eu≤0,
where Eu is the upper limit of the specific energy dissipating rate of rear wheels, while the general upper limit of the specific energy dissipating rate of the brake drum is 1.9 W/mm2; ma is the total mass of the vehicle; R and b1 are measured in millimeter and braking time t=va/j; va is the initial velocity (m/s); j is the braking deceleration (m/s2), and in general j=0.6g, where g is the gravity acceleration.(
5
) Constraints of the Friction Area of Brake Lining
While braking, the frictional characteristic would be better if the positive pressure and energy load of the brake shoe lining area get lower. In cars, the general value range of the friction area of drum brake lining should obey the following constraints:(2.12)g5(X)=104-Ap≤0,g6(X)=Ap-3×104≤0,
where Ap=b1Rθ (mm2).(
6
) Heating Load Constraint
To calculate the heating load of the brake, the temperature rise of brake from the initial speed of30km/h to full stop should be less than the defined value [Δt]=15 K [15]:
(2.13)g7(X)=Δt-[Δt]≤0.(
7
) Constraints of the Radius of Brake Drum
Since the diameter of car brake drum is usually64%~74% of rim diameter [10], thus, the ratio of car brake drum radius R against rim radius rd should be in the range:
(2.14)g8(X)=0.64-Rrd≤0,g9(X)=Rrd-0.74≤0,
where rd is the rim radius (mm).(
8
) Constraints of the Liner Width
When choosing the liner width, the pressure in a unit area should not be oversized since too large width would cause nonuniform contact. In general, the ratio of liner width against brake drum radius should meet the following constrains:(2.15)g10(X)=0.32-b1R≤0,g11(X)=b1R-0.54≤0.


## 3. Differential Cellular Multiobjective Genetic Algorithm

In order to solve the above-mentioned multiobjective optimization model much more efficiently, we introduce differential evolution (DE) strategy into the cellular genetic algorithm and thus form a new algorithm called differential cellular multiobjective genetic algorithm (DECell), which is able to minimize the distance from gained Pareto front set to exact optimal front while maintaining good uniformity and distribution range.


### 3.1. Differential Evolution Strategy

DE strategy is well suited for solving multiobjective problems of multidimension and nonlinear as the main feature characterizing it is performing global parallel direct search by using the information of the distance and direction among the individuals in the population, and what is more, it can be easily implemented [16, 17]. The detailed operation process states as follows.As for each individualx→i,D,i∈{0,1,…,N-1},i∈Z, N means the population size, and the definition of the operation is:
(3.1)v→i,D=x→r1,D+F·(x→r2,D-x→r3,D),
where D is the number of the decision variables; x→r1,D,x→r2,D, and x→r3,D are the three selected parents; r1, r2, and r3 are the index positions of the parents; and F means the scaling factor. The previous formula can be explained as follows: select two parent vectors x→r2,D and x→r3,D randomly; get the difference value of the two vectors; add the zoomed difference to the third parent vector x→r1,D, and then the individual vector after crossover is v→i,D=[vi,1,…,vi,j,…,vi,D]; as for each component xi,j, which is in the parent vector x→i,D=[xi,1,…,xi,j,…,xi,D] locating in the ith index position, generate randomly a number randj∈[0,1]; make a comparison between randj and the crossover factor CR or between j and K to judge whether to replace xi,j with vi,j; then get the new individual u→i,D=[ui,1,…,ui,j,…,ui,D], where K∈{0,1,…,D-1},K∈Z:
(3.2)ui,j={vi,j,ifrandj<CRorj=K,xi,j,otherwise.


### 3.2. DECell Algorithm Principle

Cellular genetic algorithms (cGAs) are a kind of decentralized genetic algorithms (GAs) in which the population is structured in such way that the interaction of the individuals composing it is limited to a certain subset of individuals in the immediate vicinity of their location. Usually, the population is arranged in a 2D toroidal mesh in cGAs, and individuals are allowed to interact only with their nearby neighbors (see Figure2 in the dotted box). This endows the cGA with useful properties for the optimization and also facilitates a parallel implementation because of its inherent parallel design [18].Figure 2
Breeding loop in DECell.Based on cGA, the detailed principle of DECell is presented in Figure2. First, the population is structured in a two-dimension annular gird. Since cGAs are based on the concept of neighborhood, each individual (namely, current individual) has a set of close individuals or neighbors according to some regular structure (like Moore structure, von Neumann structure). In this paper, the neighborhood structure uses Moore structure, where current individual has eight nearby neighbors (see Figure 2). We select two better ones from the neighbors of current individual based on fitness. The three individuals containing the two selected individuals and current one compose the parent individuals, on which crossover operation is then performed by using DE strategy. An offspring is generated after mutation operation. If the offspring dominates the current individual, or both the offspring and the current individual are nondominated, but the offspring is with larger crowding distance than the current individual, then it will replace the current individual. Exploration and diffusion of solutions to the rest of the population happen in a smooth way, due to the continuous overlap existing among the different neighborhoods, which make high-quality solutions propagate over the population.In the genetic operation process for each cellular individual, the nondominated individuals are stored in an external archive at the same time, and all the individuals in an external archive are ranked according to their crowding distance. If the number of the superior individuals exceeds the specified capacity of the archive, the individuals with smaller crowding distance will be removed. At the end of each generation, some of the individuals in the external archive are chosen randomly to replace the individuals of the same number in the original population so as to update the population constantly. By this method, the nondominated individuals in the external archive are able to obtain a reasonably good approximation to the Pareto optimal front when maintaining the diversity. The main pseudocode of DECell is in Pseudocode1.Pseudocode 1:DECell pseudocode.
proc stepsUp()
population←creatPopulation(); //Create initial population.
archive←creatFront(); //Create a external archive for storing non-dominated solutions.
while! StopCondition()//Termination condition.
for  individuals←1  to  population.Size
//Select the neighbors for the current individual (MOORE is adopted).
neighborhood←selection(neighborhood);
//Select two parent individuals from the neighbors.
parent1←selection(neighborhood);
parent2←selection(neighborhood);
//Make sure the two parent individuals are different.
while  parent1==parent2
parent2←selection(neighborhood);
endwhile
//Crossover operator with DE strategy and Pseudocode2 presents
the detailed operation.
offspring←crossoverInDE(position(individual),position(parent1),
position(parent2));
offspring←Mutation(offspring); // Mutation.
evalutionFitness(offspring);  // Evaluate the offspring individuals.
// The superior offspring replaces the present individual.
insert(position(individual), offspring, population);
// Put the non-dominated individuals into the external archive.
addToArchive(individual);
endfor
population←replaceIndividuals(population, archive); //Feedback mechanism.
endwhile
end_proc stepsUp;


## 3.1. Differential Evolution Strategy

DE strategy is well suited for solving multiobjective problems of multidimension and nonlinear as the main feature characterizing it is performing global parallel direct search by using the information of the distance and direction among the individuals in the population, and what is more, it can be easily implemented [16, 17]. The detailed operation process states as follows.As for each individualx→i,D,i∈{0,1,…,N-1},i∈Z, N means the population size, and the definition of the operation is:
(3.1)v→i,D=x→r1,D+F·(x→r2,D-x→r3,D),
where D is the number of the decision variables; x→r1,D,x→r2,D, and x→r3,D are the three selected parents; r1, r2, and r3 are the index positions of the parents; and F means the scaling factor. The previous formula can be explained as follows: select two parent vectors x→r2,D and x→r3,D randomly; get the difference value of the two vectors; add the zoomed difference to the third parent vector x→r1,D, and then the individual vector after crossover is v→i,D=[vi,1,…,vi,j,…,vi,D]; as for each component xi,j, which is in the parent vector x→i,D=[xi,1,…,xi,j,…,xi,D] locating in the ith index position, generate randomly a number randj∈[0,1]; make a comparison between randj and the crossover factor CR or between j and K to judge whether to replace xi,j with vi,j; then get the new individual u→i,D=[ui,1,…,ui,j,…,ui,D], where K∈{0,1,…,D-1},K∈Z:
(3.2)ui,j={vi,j,ifrandj<CRorj=K,xi,j,otherwise.


## 3.2. DECell Algorithm Principle

Cellular genetic algorithms (cGAs) are a kind of decentralized genetic algorithms (GAs) in which the population is structured in such way that the interaction of the individuals composing it is limited to a certain subset of individuals in the immediate vicinity of their location. Usually, the population is arranged in a 2D toroidal mesh in cGAs, and individuals are allowed to interact only with their nearby neighbors (see Figure2 in the dotted box). This endows the cGA with useful properties for the optimization and also facilitates a parallel implementation because of its inherent parallel design [18].Figure 2
Breeding loop in DECell.Based on cGA, the detailed principle of DECell is presented in Figure2. First, the population is structured in a two-dimension annular gird. Since cGAs are based on the concept of neighborhood, each individual (namely, current individual) has a set of close individuals or neighbors according to some regular structure (like Moore structure, von Neumann structure). In this paper, the neighborhood structure uses Moore structure, where current individual has eight nearby neighbors (see Figure 2). We select two better ones from the neighbors of current individual based on fitness. The three individuals containing the two selected individuals and current one compose the parent individuals, on which crossover operation is then performed by using DE strategy. An offspring is generated after mutation operation. If the offspring dominates the current individual, or both the offspring and the current individual are nondominated, but the offspring is with larger crowding distance than the current individual, then it will replace the current individual. Exploration and diffusion of solutions to the rest of the population happen in a smooth way, due to the continuous overlap existing among the different neighborhoods, which make high-quality solutions propagate over the population.In the genetic operation process for each cellular individual, the nondominated individuals are stored in an external archive at the same time, and all the individuals in an external archive are ranked according to their crowding distance. If the number of the superior individuals exceeds the specified capacity of the archive, the individuals with smaller crowding distance will be removed. At the end of each generation, some of the individuals in the external archive are chosen randomly to replace the individuals of the same number in the original population so as to update the population constantly. By this method, the nondominated individuals in the external archive are able to obtain a reasonably good approximation to the Pareto optimal front when maintaining the diversity. The main pseudocode of DECell is in Pseudocode1.Pseudocode 1:DECell pseudocode.
proc stepsUp()
population←creatPopulation(); //Create initial population.
archive←creatFront(); //Create a external archive for storing non-dominated solutions.
while! StopCondition()//Termination condition.
for  individuals←1  to  population.Size
//Select the neighbors for the current individual (MOORE is adopted).
neighborhood←selection(neighborhood);
//Select two parent individuals from the neighbors.
parent1←selection(neighborhood);
parent2←selection(neighborhood);
//Make sure the two parent individuals are different.
while  parent1==parent2
parent2←selection(neighborhood);
endwhile
//Crossover operator with DE strategy and Pseudocode2 presents
the detailed operation.
offspring←crossoverInDE(position(individual),position(parent1),
position(parent2));
offspring←Mutation(offspring); // Mutation.
evalutionFitness(offspring);  // Evaluate the offspring individuals.
// The superior offspring replaces the present individual.
insert(position(individual), offspring, population);
// Put the non-dominated individuals into the external archive.
addToArchive(individual);
endfor
population←replaceIndividuals(population, archive); //Feedback mechanism.
endwhile
end_proc stepsUp;


## 4. DECell Performance Test and Results Analysis

To assess how competitive the DECell is, a set of unconstraint, multivariable, and multiobjective test functions (i.e., DTLZ family) [19] and two constraint multiobjective test functions (i.e., the Viennet2 and Tanka) [20, 21] are adopted. DECell, NSGAII [22], MOCell [23], PESA2 [24], and PAES [25] are used simultaneously to compute the above-mentioned test functions, respectively. The performances of the five algorithms are then compared and analyzed under the same assessment system.


### 4.1. Performance Assessment Indicators of Algorithms

This paper uses three assessment indicators: generational distance [26], spread [23], and hypervolume [27].(
1
) Generational Distance
Generational distance is used to measure the distance between the obtained Pareto front and the Pareto optimal front. The computational formula is as follows:(4.1)GD=∑i=1ndi2n,
where n is the number of the obtained Pareto front and di is the Euclidean distance between the ith solution and the nearest solution in the Pareto optimal front in the objective space. It is obvious that all the obtained solutions are exactly the Pareto optimal solutions if GD=0. Therefore, the smaller the value of GD is, the better it converges to the Pareto optimal solutions.(
2
) Spread
The spread measurement proposed by Deb is an indicator that measures the distribution and spread of the obtained Pareto front. The calculation formula is as follows:(4.2)Δ=df+dl+∑i=1n-1|di-d-|df+dl+(n-1)×d-,
where di is the Euclidean distance between every two adjacent individuals in the obtained Pareto front, d- is the mean of these distances, df and dl are the Euclidean distances between the boundary individuals of the obtained Pareto front and the boundary individuals of the Pareto optimal front, and n is the number of the individuals in the obtained Pareto front. A zero value of this indicator means an ideal uniform distribution. Therefore, the smaller this indicator’s value is, the more uniform it distributes.(
3
) Hypervolume
Hypervolume is adopted to calculate the volume covered by the individuals of the obtained Pareto front. It is defined as(4.3)HV=volume(⋃i=1|Q|vi),
where Q is the amount of the obtained Pareto front; as for each individual i in the Pareto front, vi is the hypercube formed by the reference point W=(0,..,0) and the individual i. Larger values of HV indicate that the obtained Pareto front individuals can be broadly distributed in the objective space.


### 4.2. Computational Results and Analysis

The parameters settings of DECell, NSGA-II, MOCell, PESA2, and PAES are as follows: all the algorithms adopt real coding and polynomial mutation. NSGAII, MOCell, PESA2, and PAES employ SBX [28] crossover operator, while DECell adopts DE crossover operator. Let F=0.1 and CR=0.5. The population size is 100, the maximum evaluation generation is 20000, and crossover probability is 0.9, while mutation probability is 1/len, where “len” means the variable length. These five algorithms run 20 times independently for every test function, respectively. Quantitative analysis on the performances of these five algorithms is presented in Tables 1, 2, and 3, in which the values in the dark grey blanks are the optimal values, while those in light grey blanks are the second optimal values.Table 1
Average (avg) and standard deviation (std) of the GD indicator of the Pareto front obtained by five algorithms for different problems.Table 2
Average (avg) and standard deviation (std) of the spread (Δ) indicator of the Pareto front obtained by five algorithms for different problems.Table 3
Average (avg) and standard deviation (std) of the HV indicator of the Pareto front obtained by five algorithms for different problems.We consider first the generational distance (GD). As the test results of the computation on the benchmarks in Table1 show that, DECell can get the best indicator values in six of the eight multiobjective problems, MOCell and PESA2 can only obtain the best values in one of the eight test functions, respectively. Moreover, NSGA-II and PAES cannot get any best GD value in any of the problems. Therefore, a conclusion can be made that in general DECell outperforms the other four algorithms in terms of convergence when solving high-dimensional multiobjective optimization problems (MOPs) mentioned previously.Regarding the spread value (Table2), the results reveal that DECell outperforms the other four algorithms in terms of the diversity of the nondominated solutions along with the obtained Pareto front since it obtains the best (lowest) spread value in five of the eight multiobjective functions, along with two suboptimal values. The Δ indicators suggest that PAES performs the worst, as it cannot get best value in any problem, only with one suboptimal value.The values of hypervolume indicator (HV) in Table3 indicate that DECell gets better results than the other algorithms. DECell obtains the best values (the highest values) in six of the eight test functions, while NSGA-II gets the best values in two of the eight functions, which denotes that the Pareto front individuals obtained by DECell are able to be distributed more broadly in the objective space.To compare the performance of algorithms more clearly, we present Figures3, 4, 5, 6, and 7 the Pareto fronts gained by DECell, MOCell, NSGA-II, PESA2, and PAES when solving DTLZ2, where the grid areas are the Pareto optimal front surface and the dots represent the Pareto front obtained by each algorithm. It is clear that DECell outperforms the other four algorithms concerning distribution and convergence when solving DTLZ2. The PEAS2 has the worst distribution, while MOCell has the worst convergence. And as for the coverage of the gained solutions, DECell outperforms the other ones, which is followed by MOCell and NSGA-II, and next is PAES, while PESA2 is the worst, which matches the results shown in Tables 1, 2, and 3.Figure 3
DTLZ2 solved by DECell.Figure 4
DTLZ2 solved by MOCell.Figure 5
DTLZ2 solved by NSGA-II.Figure 6
DTLZ2 solved by PESA2.Figure 7
DTLZ2 solved by PAES.Another analysis method is needed to further analyze the influence of the evaluation number on the algorithm performance. The simple way is to observe the evolution of three given indicators during the whole execution of the algorithms from which we can tell what is happening in every generation. Figure8 shows the convergence progress of GD, HV, and spread when solving DTLZ1 problem with different evaluation number. In this figure, with evaluation number increasing, we can see that the GD values obtained by all the algorithms have converged to the lowest (or best) value and the HV value obtained by DECell is larger (or better) than those obtained by the other algorithms during evolution. We also observe that fluctuation in spread value is unstable, but the fluctuation of DECell is smaller than that of the other algorithms, and the spread value obtained by DECell is lower (or better) than those by the other algorithms with the progress of evolution as well.Evolution of the three indicators for different algorithms in ZDT1.
(a)
(b)
(c)A more detailed analysis can be performed if we show the results using boxplots, which constitutes a useful way of depicting groups of numerical data. Figure9 presents the boxplot distribution of GD, spread, and HV values obtained by the five algorithms in ZTLZ3. We can see that GD and spread values obtained by DECell have been lower (or better) than the ones obtained by the other algorithms though HV values obtained by these algorithms vary slightly (in fact, HV values have no confidence interval).Boxplot representation of GD, spread, and HV values of the fronts computed by five algorithms in ZTLZ3.
(a)
(b)
(c)It can be concluded that in general DECell performs better than the other algorithms when solving complicated multiobjective problems, while NSGA-II takes the second place. Though DECell is outstanding in accuracy, it is worse than some other MOEAs in efficiency. That is to say, DECell costs more computational time than NSGA-II, PESA2 for the problems, because DECell is a kind of decentralized cellular genetic algorithms, where individual interacts only with its nearby neighbors and diffusion of solutions to the population happens slowly in a smooth fashion.


## 4.1. Performance Assessment Indicators of Algorithms

This paper uses three assessment indicators: generational distance [26], spread [23], and hypervolume [27].(
1
) Generational Distance
Generational distance is used to measure the distance between the obtained Pareto front and the Pareto optimal front. The computational formula is as follows:(4.1)GD=∑i=1ndi2n,
where n is the number of the obtained Pareto front and di is the Euclidean distance between the ith solution and the nearest solution in the Pareto optimal front in the objective space. It is obvious that all the obtained solutions are exactly the Pareto optimal solutions if GD=0. Therefore, the smaller the value of GD is, the better it converges to the Pareto optimal solutions.(
2
) Spread
The spread measurement proposed by Deb is an indicator that measures the distribution and spread of the obtained Pareto front. The calculation formula is as follows:(4.2)Δ=df+dl+∑i=1n-1|di-d-|df+dl+(n-1)×d-,
where di is the Euclidean distance between every two adjacent individuals in the obtained Pareto front, d- is the mean of these distances, df and dl are the Euclidean distances between the boundary individuals of the obtained Pareto front and the boundary individuals of the Pareto optimal front, and n is the number of the individuals in the obtained Pareto front. A zero value of this indicator means an ideal uniform distribution. Therefore, the smaller this indicator’s value is, the more uniform it distributes.(
3
) Hypervolume
Hypervolume is adopted to calculate the volume covered by the individuals of the obtained Pareto front. It is defined as(4.3)HV=volume(⋃i=1|Q|vi),
where Q is the amount of the obtained Pareto front; as for each individual i in the Pareto front, vi is the hypercube formed by the reference point W=(0,..,0) and the individual i. Larger values of HV indicate that the obtained Pareto front individuals can be broadly distributed in the objective space.


## 4.2. Computational Results and Analysis

The parameters settings of DECell, NSGA-II, MOCell, PESA2, and PAES are as follows: all the algorithms adopt real coding and polynomial mutation. NSGAII, MOCell, PESA2, and PAES employ SBX [28] crossover operator, while DECell adopts DE crossover operator. Let F=0.1 and CR=0.5. The population size is 100, the maximum evaluation generation is 20000, and crossover probability is 0.9, while mutation probability is 1/len, where “len” means the variable length. These five algorithms run 20 times independently for every test function, respectively. Quantitative analysis on the performances of these five algorithms is presented in Tables 1, 2, and 3, in which the values in the dark grey blanks are the optimal values, while those in light grey blanks are the second optimal values.Table 1
Average (avg) and standard deviation (std) of the GD indicator of the Pareto front obtained by five algorithms for different problems.Table 2
Average (avg) and standard deviation (std) of the spread (Δ) indicator of the Pareto front obtained by five algorithms for different problems.Table 3
Average (avg) and standard deviation (std) of the HV indicator of the Pareto front obtained by five algorithms for different problems.We consider first the generational distance (GD). As the test results of the computation on the benchmarks in Table1 show that, DECell can get the best indicator values in six of the eight multiobjective problems, MOCell and PESA2 can only obtain the best values in one of the eight test functions, respectively. Moreover, NSGA-II and PAES cannot get any best GD value in any of the problems. Therefore, a conclusion can be made that in general DECell outperforms the other four algorithms in terms of convergence when solving high-dimensional multiobjective optimization problems (MOPs) mentioned previously.Regarding the spread value (Table2), the results reveal that DECell outperforms the other four algorithms in terms of the diversity of the nondominated solutions along with the obtained Pareto front since it obtains the best (lowest) spread value in five of the eight multiobjective functions, along with two suboptimal values. The Δ indicators suggest that PAES performs the worst, as it cannot get best value in any problem, only with one suboptimal value.The values of hypervolume indicator (HV) in Table3 indicate that DECell gets better results than the other algorithms. DECell obtains the best values (the highest values) in six of the eight test functions, while NSGA-II gets the best values in two of the eight functions, which denotes that the Pareto front individuals obtained by DECell are able to be distributed more broadly in the objective space.To compare the performance of algorithms more clearly, we present Figures3, 4, 5, 6, and 7 the Pareto fronts gained by DECell, MOCell, NSGA-II, PESA2, and PAES when solving DTLZ2, where the grid areas are the Pareto optimal front surface and the dots represent the Pareto front obtained by each algorithm. It is clear that DECell outperforms the other four algorithms concerning distribution and convergence when solving DTLZ2. The PEAS2 has the worst distribution, while MOCell has the worst convergence. And as for the coverage of the gained solutions, DECell outperforms the other ones, which is followed by MOCell and NSGA-II, and next is PAES, while PESA2 is the worst, which matches the results shown in Tables 1, 2, and 3.Figure 3
DTLZ2 solved by DECell.Figure 4
DTLZ2 solved by MOCell.Figure 5
DTLZ2 solved by NSGA-II.Figure 6
DTLZ2 solved by PESA2.Figure 7
DTLZ2 solved by PAES.Another analysis method is needed to further analyze the influence of the evaluation number on the algorithm performance. The simple way is to observe the evolution of three given indicators during the whole execution of the algorithms from which we can tell what is happening in every generation. Figure8 shows the convergence progress of GD, HV, and spread when solving DTLZ1 problem with different evaluation number. In this figure, with evaluation number increasing, we can see that the GD values obtained by all the algorithms have converged to the lowest (or best) value and the HV value obtained by DECell is larger (or better) than those obtained by the other algorithms during evolution. We also observe that fluctuation in spread value is unstable, but the fluctuation of DECell is smaller than that of the other algorithms, and the spread value obtained by DECell is lower (or better) than those by the other algorithms with the progress of evolution as well.Evolution of the three indicators for different algorithms in ZDT1.
(a)
(b)
(c)A more detailed analysis can be performed if we show the results using boxplots, which constitutes a useful way of depicting groups of numerical data. Figure9 presents the boxplot distribution of GD, spread, and HV values obtained by the five algorithms in ZTLZ3. We can see that GD and spread values obtained by DECell have been lower (or better) than the ones obtained by the other algorithms though HV values obtained by these algorithms vary slightly (in fact, HV values have no confidence interval).Boxplot representation of GD, spread, and HV values of the fronts computed by five algorithms in ZTLZ3.
(a)
(b)
(c)It can be concluded that in general DECell performs better than the other algorithms when solving complicated multiobjective problems, while NSGA-II takes the second place. Though DECell is outstanding in accuracy, it is worse than some other MOEAs in efficiency. That is to say, DECell costs more computational time than NSGA-II, PESA2 for the problems, because DECell is a kind of decentralized cellular genetic algorithms, where individual interacts only with its nearby neighbors and diffusion of solutions to the population happens slowly in a smooth fashion.


## 5. Parameter Optimization Design of Brake Based on DECell

The computational procedures of the brake model by using DECell are as follows.(
1
) Population Initialization
Randomly generate initial population in the constraint range of optimization parameters by real coding. The optimization parameters areXT=[x1,x2,…,x11]=[θ0,θ,b1,R,c′,c,a,b2,e,d,p].(
2
) Selection
The tournament method is used, which selects the parent individuals based on the individual rank and crowding distance. The detailed procedures are as follows: select the neighbors of the current individual; compare the ranks of the neighbors, and remain the individuals with lower ranks since the individuals with lower ranks performs better; if the neighbors are of the same rank, compare their crowding distances, and reserve the ones with bigger crowding distances. At last, two better individuals are selected from the neighbors.(
3
) Crossover
Crossover operation is performed to generate more new individuals and improve the space searching ability. DE strategy is introduced to the crossover operation, and the detailed procedures are explained in formulas (3.1) and (3.2). The parameters CR and F are adopted in this operation, where the crossover coefficient (CR) equals 0.5 and the scaling factor (F) equals 0.5. The detailed parameter setting is as per [29]. The code of the crossover flow is presented in Pseudocode 2.Pseudocode 2:Crossover operation pseudocode based on DE strategy.
proc crossoverInDE(r1,r2,r3)
//Px1 and Px2 are the corresponding initial position index and terminal position
index of the parameters
Rand
j
=
randInt
(
P
x
1
,
P
x
2
);
// perform differential crossover operation
for (j=Px1,j⇐Px2,j=j+1)
if (rand(0,1) < CR orj=Randj)
vr3[j],t=xr3[j],t+F×(xrl[j],t-xr2[j],t); //t means current functions evaluations
else
vr3[j],t=xr3[j],t;
end if
end for
returnvr3,t;
end_proc crossoverInDE(
4
) Mutation
This operation aims to avoid local convergence.(
5
) Termination Condition
If the maximum evaluation generations are reached, output the results or go back to step(2).


## 6. Case Study

For a vehicle, some of its parameters and its leading- and trailing-shoe brake are shown in Table4.Table 4
Model parameters.
Parameters
The weightof the vehicle ma (kg)
Distribution coefficientβ
Rim radiusRr (mm)
Initial velocity of brake va (km/h)
Friction coefficientof the friction plate μ
Specific heat capacityCd,  Ch (J/(kg·K))
Values
1560
0.77
177.8
30
0.35
482To search optimal solutions of the multiobjective problems, Table5 presents the boundary of design variables.Table 5
Domain of decision variables.
Variable
α
' (degree)
β (degree)
b
1 (mm)
R  (mm)
c
'  (mm)
c  (mm)
Upper limit
10
90
36
120
120
85
Lower limit
45
120
75
180
160
120
Variable
a (mm)
b
2 (mm)
e (mm)
d (mm)
p (MP)
Upper limit
60
90
5
15
6
Lower limit
130
120
16
35
12To evaluate the competitiveness of this algorithm, the most commonly used multiobjective genetic algorithm NSGA-II is also adopted to compute the brake model besides DECell. The parameters settings are as follows: population sizeM=100, archive capacity of DECell N=100, feedback number C=25, crossover probability pc=0.9, and mutation probability pm=1/var, where “var” is the number of the decision variables.


### 6.1. Qualitative Analysis

After each evolution, the superior solutions gained by NSGA-II are put in the final population, while those obtained by DECell are stored in the external archive. Since the population size and the archive capacity are both 100, each algorithm obtains 100 superior solutions after computation. However, there are still some dominated solutions existing in the 100 individuals, which means that there would be 100 or less non- dominated ones after each computation.Let the maximum evaluation generations beG=25000. Two algorithms are operated under the same conditions; they both get 100 nondominated individuals, which are shown in Figure 8.Even though we cannot easily and specifically tell which algorithm performs better in terms of the three objectives from Figure10, the overall situation shows that the braking efficiency factor obtained by DECell is obviously bigger than that got by NSGA-II. Since the bigger the braking efficiency factor is, the better the braking performance is, it is clear that DECell outperforms NSGA-II for the objective of braking efficiency. In order to make clear the relationship between temperature rise and the volume of the brake drum, the two-dimensional graph of the two factors is shown separately in Figure 11.Figure 10
Distribution of the Pareto front.Figure 11
Pareto front set schematic diagram between volume and temperature rise.In Figure11, the Pareto fronts in upper left are of higher temperature rise and smaller brake drum volume, which means that the smaller the brake drum is, the higher the brake temperature rise will be, that is, the heat dispersion is worse. As for the Pareto fronts in lower right, they have lower brake temperature rise and larger brake drum volume, which indicates that bigger brake drum volume accompanies smaller brake temperature rise; that is, the heat dispersion is much better. In Figure 11, as for the two factors, the Pareto front individuals gained by DECell distribute more uniform than those of NSGA-II; moreover, it is of better continuity. What is more, more Pareto front individuals obtained by DECell are distributed in the compromise position. It can be concluded that DECell outperforms NSGA-II in terms of distribution and convergence.Figure12 presents the relationship between braking efficiency factor and the volume of the brake drum. In the figure, Pareto front solutions obtained by the two algorithms distribute disorderly in 2D multiobjective space, which implies that the efficiency factor is irrelative with the volume of drum brake. That is to say, there is no promoting or conflicting relationship between them.Figure 12
Pareto front set schematic diagram between volume and efficiency factor.


### 6.2. Quantitative Analysis

#### 6.2.1. Convergence Rate Analysis

To further assess the algorithms performance in searching Pareto optimal solutions, different maximum evolution generations, which are got from 1000 to 10000 with the interval 1000, are adopted. For every maximum evolution generation, the aforementioned two algorithms are applied to compute the model of brake for 20 times, respectively, and the averages of the number of the nondominated individuals gained by each algorithm during the 20 times computations are plotted in Figure13.Figure 13
The number of the nondominated individuals obtained by the two algorithms.Figure13 shows that DECell can always find more nondominated individuals than NSGA-II with the same maximum evolution generations and the former algorithm outperforms the latter in terms of space searching ability, optimal solution saving ability, and exploring ability.


#### 6.2.2. Convergence Accuracy Analysis

To further analyze the computational stability and accuracy of the algorithm, the maximum evolution generation is set asG=25000 and 20 independent computations on the brake optimization design model are performed by NSGA-II and DECell, respectively. Each algorithm gets 2000 Pareto solutions (i.e., 2000 sets of objective function values are obtained), which are then statistically analyzed in terms of three indicators: the mean, standard deviation and optimal value of all the values gained for each objective. The results are presented in Table 6.Table 6
Performance comparison.Each data in the grey blanks presented in Table6 is the superior value of the two data in the same type. If the brake is of large braking efficiency factor, small volume, and low temperature rise, it is of good performance.As is shown in Table6, DECell gets better mean efficiency factor and temperature rise values, except that the average volume of drum brake optimized by DECell is a little larger than that of NSGA-II (the volume is still acceptable). The results denote that DECell outperforms NSGA-II in finding much better design parameters of brake.Meanwhile, as for the deviation of three indicators, two of them obtained by DECell are lower than those obtained by NSGA-II, which means that DECell is of low volatility and good stability. As for each objective, all the optimal values found by DECell are better than those got by NSGA-II. It indicates that DECell can converge to the much better Pareto solutions and it is of higher accuracy.Therefore, it can be concluded that differential cellular multiobjective genetic algorithm performs better than NSGA-II in terms of solution space searching ability and speed for finding much more and better solutions when solving the brake optimization design model. Moreover, the solutions could be kept effectively. What is more, this algorithm is of good stability and high accuracy, in which much more good design parameters of brake could be easily found for designers to choose.


## 6.1. Qualitative Analysis

After each evolution, the superior solutions gained by NSGA-II are put in the final population, while those obtained by DECell are stored in the external archive. Since the population size and the archive capacity are both 100, each algorithm obtains 100 superior solutions after computation. However, there are still some dominated solutions existing in the 100 individuals, which means that there would be 100 or less non- dominated ones after each computation.Let the maximum evaluation generations beG=25000. Two algorithms are operated under the same conditions; they both get 100 nondominated individuals, which are shown in Figure 8.Even though we cannot easily and specifically tell which algorithm performs better in terms of the three objectives from Figure10, the overall situation shows that the braking efficiency factor obtained by DECell is obviously bigger than that got by NSGA-II. Since the bigger the braking efficiency factor is, the better the braking performance is, it is clear that DECell outperforms NSGA-II for the objective of braking efficiency. In order to make clear the relationship between temperature rise and the volume of the brake drum, the two-dimensional graph of the two factors is shown separately in Figure 11.Figure 10
Distribution of the Pareto front.Figure 11
Pareto front set schematic diagram between volume and temperature rise.In Figure11, the Pareto fronts in upper left are of higher temperature rise and smaller brake drum volume, which means that the smaller the brake drum is, the higher the brake temperature rise will be, that is, the heat dispersion is worse. As for the Pareto fronts in lower right, they have lower brake temperature rise and larger brake drum volume, which indicates that bigger brake drum volume accompanies smaller brake temperature rise; that is, the heat dispersion is much better. In Figure 11, as for the two factors, the Pareto front individuals gained by DECell distribute more uniform than those of NSGA-II; moreover, it is of better continuity. What is more, more Pareto front individuals obtained by DECell are distributed in the compromise position. It can be concluded that DECell outperforms NSGA-II in terms of distribution and convergence.Figure12 presents the relationship between braking efficiency factor and the volume of the brake drum. In the figure, Pareto front solutions obtained by the two algorithms distribute disorderly in 2D multiobjective space, which implies that the efficiency factor is irrelative with the volume of drum brake. That is to say, there is no promoting or conflicting relationship between them.Figure 12
Pareto front set schematic diagram between volume and efficiency factor.


## 6.2. Quantitative Analysis

### 6.2.1. Convergence Rate Analysis

To further assess the algorithms performance in searching Pareto optimal solutions, different maximum evolution generations, which are got from 1000 to 10000 with the interval 1000, are adopted. For every maximum evolution generation, the aforementioned two algorithms are applied to compute the model of brake for 20 times, respectively, and the averages of the number of the nondominated individuals gained by each algorithm during the 20 times computations are plotted in Figure13.Figure 13
The number of the nondominated individuals obtained by the two algorithms.Figure13 shows that DECell can always find more nondominated individuals than NSGA-II with the same maximum evolution generations and the former algorithm outperforms the latter in terms of space searching ability, optimal solution saving ability, and exploring ability.


### 6.2.2. Convergence Accuracy Analysis

To further analyze the computational stability and accuracy of the algorithm, the maximum evolution generation is set asG=25000 and 20 independent computations on the brake optimization design model are performed by NSGA-II and DECell, respectively. Each algorithm gets 2000 Pareto solutions (i.e., 2000 sets of objective function values are obtained), which are then statistically analyzed in terms of three indicators: the mean, standard deviation and optimal value of all the values gained for each objective. The results are presented in Table 6.Table 6
Performance comparison.Each data in the grey blanks presented in Table6 is the superior value of the two data in the same type. If the brake is of large braking efficiency factor, small volume, and low temperature rise, it is of good performance.As is shown in Table6, DECell gets better mean efficiency factor and temperature rise values, except that the average volume of drum brake optimized by DECell is a little larger than that of NSGA-II (the volume is still acceptable). The results denote that DECell outperforms NSGA-II in finding much better design parameters of brake.Meanwhile, as for the deviation of three indicators, two of them obtained by DECell are lower than those obtained by NSGA-II, which means that DECell is of low volatility and good stability. As for each objective, all the optimal values found by DECell are better than those got by NSGA-II. It indicates that DECell can converge to the much better Pareto solutions and it is of higher accuracy.Therefore, it can be concluded that differential cellular multiobjective genetic algorithm performs better than NSGA-II in terms of solution space searching ability and speed for finding much more and better solutions when solving the brake optimization design model. Moreover, the solutions could be kept effectively. What is more, this algorithm is of good stability and high accuracy, in which much more good design parameters of brake could be easily found for designers to choose.


## 6.2.1. Convergence Rate Analysis

To further assess the algorithms performance in searching Pareto optimal solutions, different maximum evolution generations, which are got from 1000 to 10000 with the interval 1000, are adopted. For every maximum evolution generation, the aforementioned two algorithms are applied to compute the model of brake for 20 times, respectively, and the averages of the number of the nondominated individuals gained by each algorithm during the 20 times computations are plotted in Figure13.Figure 13
The number of the nondominated individuals obtained by the two algorithms.Figure13 shows that DECell can always find more nondominated individuals than NSGA-II with the same maximum evolution generations and the former algorithm outperforms the latter in terms of space searching ability, optimal solution saving ability, and exploring ability.


## 6.2.2. Convergence Accuracy Analysis

To further analyze the computational stability and accuracy of the algorithm, the maximum evolution generation is set asG=25000 and 20 independent computations on the brake optimization design model are performed by NSGA-II and DECell, respectively. Each algorithm gets 2000 Pareto solutions (i.e., 2000 sets of objective function values are obtained), which are then statistically analyzed in terms of three indicators: the mean, standard deviation and optimal value of all the values gained for each objective. The results are presented in Table 6.Table 6
Performance comparison.Each data in the grey blanks presented in Table6 is the superior value of the two data in the same type. If the brake is of large braking efficiency factor, small volume, and low temperature rise, it is of good performance.As is shown in Table6, DECell gets better mean efficiency factor and temperature rise values, except that the average volume of drum brake optimized by DECell is a little larger than that of NSGA-II (the volume is still acceptable). The results denote that DECell outperforms NSGA-II in finding much better design parameters of brake.Meanwhile, as for the deviation of three indicators, two of them obtained by DECell are lower than those obtained by NSGA-II, which means that DECell is of low volatility and good stability. As for each objective, all the optimal values found by DECell are better than those got by NSGA-II. It indicates that DECell can converge to the much better Pareto solutions and it is of higher accuracy.Therefore, it can be concluded that differential cellular multiobjective genetic algorithm performs better than NSGA-II in terms of solution space searching ability and speed for finding much more and better solutions when solving the brake optimization design model. Moreover, the solutions could be kept effectively. What is more, this algorithm is of good stability and high accuracy, in which much more good design parameters of brake could be easily found for designers to choose.


## 7. Conclusions

This paper established a multiobjective optimization design model of drum brake with the goals of maximizing the efficiency factor of braking, minimizing the volume of drum brake, and minimizing the temperature rise of brake, in order to better meet the requirements of engineering practice.We present a new optimization algorithm by introducing the differential strategy into the canonical cellular genetic algorithm to solve the model effectively, which is called differential evolution cellular multiobjective genetic algorithm (DECell). In DECell, all the population individuals are structured in a bidimensional grid, and each individual may only interact with its neighborhood. Besides, three parent individuals are selected for each individual to take part in the crossover operation together. With this method, the obtained Pareto front would be as approximate as possible to the Pareto optimal front. Besides, their distribution uniformity and coverage are well maintained. The evaluation on test function indicates that the proposed algorithm outperforms the other four popular multiobjective algorithms (i.e., NSGAII, MOCell, PESA2, and PAES) greatly when solving high-dimensional nonlinear multiobjective problems. The experimental computation of DECell and NSGA-II on parameter optimization design of drum brake suggests that the DECell can find much more and better solutions stably. It is an effective algorithm that can be applied to solve the drum brake parameters optimization and other complicated engineering problems.



---

*Source: 734193-2012-12-30.xml*