Improved cloud storage auditing scheme with deduplication

Jindan Zhang; Urszula Ogiela; David Taniar; Nadia Nedjah; Jindan Zhang; Urszula Ogiela; David Taniar; Nadia Nedjah

doi:10.3934/mbe.2023342

Mathematical Biosciences and Engineering

2023, Volume 20, Issue 5: 7905-7921. doi: 10.3934/mbe.2023342

Previous Article Next Article

Research article Special Issues

Improved cloud storage auditing scheme with deduplication

1.
Xianyang Vocational & Technical College, Xianyang, Shaanxi, China
2.
AGH University of Science and Technology, Institute of Computer Science, Krakow, Poland
3.
Faculty of Information Technology, Monash University, Australia
4.
Department of Electronics Engineering and Telecommunications of the Engineering Faculty, State University of Rio de Janeiro, Rio de Janeiro, Brazil

Received: 01 November 2022 Revised: 22 January 2023 Accepted: 06 February 2023 Published: 22 February 2023

Cloud storage has become a crucial service for many users who deal with big data. The auditing scheme for cloud storage is a mechanism that checks the integrity of outsourced data. Cloud storage deduplication is a technique that helps cloud service providers save on storage costs by storing only one copy of a file when multiple users outsource the same file to cloud servers. However, combining storage auditing and deduplication techniques can be challenging. To address this challenge, in 2019 Hou et al. proposed a cloud storage auditing scheme with deduplication that supports different security levels of data popularity. This proposal is interesting and has practical applications. However, in this paper, we show that their proposal has a flaw: the cloud or other adversaries can easily forge the data block's authenticators, which means the cloud can delete all the outsourced encrypted data blocks but still provide correct storage proof for the third-party auditor. Based on Hou et al.'s scheme, we propose an improved cloud storage auditing scheme with deduplication and analyze its security. The results show that the proposed scheme is more secure.

Keywords:

Citation: Jindan Zhang, Urszula Ogiela, David Taniar, Nadia Nedjah. Improved cloud storage auditing scheme with deduplication[J]. Mathematical Biosciences and Engineering, 2023, 20(5): 7905-7921. doi: 10.3934/mbe.2023342

Related Papers:

[1]	Huangjing Yu, Heming Jia, Jianping Zhou, Abdelazim G. Hussien . Enhanced Aquila optimizer algorithm for global optimization and constrained engineering problems. Mathematical Biosciences and Engineering, 2022, 19(12): 14173-14211. doi: 10.3934/mbe.2022660
[2]	Yufei Wang, Yujun Zhang, Yuxin Yan, Juan Zhao, Zhengming Gao . An enhanced aquila optimization algorithm with velocity-aided global search mechanism and adaptive opposition-based learning. Mathematical Biosciences and Engineering, 2023, 20(4): 6422-6467. doi: 10.3934/mbe.2023278
[3]	Shuang Wang, Heming Jia, Qingxin Liu, Rong Zheng . An improved hybrid Aquila Optimizer and Harris Hawks Optimization for global optimization. Mathematical Biosciences and Engineering, 2021, 18(6): 7076-7109. doi: 10.3934/mbe.2021352
[4]	Di Wu, Changsheng Wen, Honghua Rao, Heming Jia, Qingxin Liu, Laith Abualigah . Modified reptile search algorithm with multi-hunting coordination strategy for global optimization problems. Mathematical Biosciences and Engineering, 2023, 20(6): 10090-10134. doi: 10.3934/mbe.2023443
[5]	Zijiao Zhang, Chong Wu, Shiyou Qu, Jiaming Liu . A hierarchical chain-based Archimedes optimization algorithm. Mathematical Biosciences and Engineering, 2023, 20(12): 20881-20913. doi: 10.3934/mbe.2023924
[6]	Dongning Chen, Jianchang Liu, Chengyu Yao, Ziwei Zhang, Xinwei Du . Multi-strategy improved salp swarm algorithm and its application in reliability optimization. Mathematical Biosciences and Engineering, 2022, 19(5): 5269-5292. doi: 10.3934/mbe.2022247
[7]	Jiahao Zhang, Zhengming Gao, Suruo Li, Juan Zhao, Wenguang Song . Improved intelligent clonal optimizer based on adaptive parameter strategy. Mathematical Biosciences and Engineering, 2022, 19(10): 10275-10315. doi: 10.3934/mbe.2022481
[8]	Yijie Zhang, Yuhang Cai . Adaptive dynamic self-learning grey wolf optimization algorithm for solving global optimization problems and engineering problems. Mathematical Biosciences and Engineering, 2024, 21(3): 3910-3943. doi: 10.3934/mbe.2024174
[9]	YoungSu Yun, Mitsuo Gen, Tserengotov Nomin Erdene . Applying GA-PSO-TLBO approach to engineering optimization problems. Mathematical Biosciences and Engineering, 2023, 20(1): 552-571. doi: 10.3934/mbe.2023025
[10]	Xiaorui Yang, Yumei Zhang, Xiaojiao Lv, Honghong Yang, Zengguo Sun, Xiaojun Wu . Hybrid multi-strategy chaos somersault foraging chimp optimization algorithm research. Mathematical Biosciences and Engineering, 2023, 20(7): 12263-12297. doi: 10.3934/mbe.2023546

Abstract

1. Introduction

With the rapid development of contemporary science and technology, many practical engineering application problems have become increasingly complex, and the complexity required for their calculations has also gradually increased. When solving engineering application problems, people often do not have a suitable solution to execute. To simplify the complexity of practical problems and reduce energy consumption, metaheuristic algorithms with an optimal solution have attracted more and more attention. Metaheuristic algorithms are heuristic algorithms that simulate the process of a certain natural phenomenon or observe the survival behavior of natural organisms. Due to their high efficiency, strong timeliness, and global convergence, they can often quickly find a feasible solution from unknown spaces when solving nonlinear practical problems. However, due to the constraints and complexity of real-life practical problems, we cannot obtain the optimal solutions for all problems using only one algorithm. Therefore, metaheuristic algorithms based on physics, humans, biological populations, and evolution have been continuously proposed by scholars to solve practical engineering problems.

The inspiration for physics-based metaheuristic algorithms mostly comes from the laws of physics and chemical energy reactions in nature. For example, the gravitational search algorithm (GSA) ^[1], the rime optimization algorithm (RIME) ^[2], the simulated annealing (SA) ^[3], the black hole (BH) ^[4], the Kepler optimization algorithm (KOA) ^[5]. Human-based metaheuristic algorithms mainly simulate a series of human behaviors. For example, the teaching learning based optimization (TLBO) ^[6], the mother optimization algorithm (MOA) ^[7], the harmony search (HS) ^[8], the group teaching optimization algorithm (GTOA) ^[9], the brain storming optimization (BSO) ^[10]. The metaheuristic algorithm based on biological populations is currently one of the two popular branches, which mainly simulates the social behavior of natural biological populations, including foraging, nesting, and avoiding natural enemies. For example, particle swarm optimization (PSO) ^[11], the monarch butterfly optimization (MBO) ^[12], the QoS-based dissemination of content in grids ^[13], the reorganization and discovery of grid information with epidemic tuning ^[14], the bio-inspired algorithm for outlier's detection ^[15], the colony predation algorithm (CPA) ^[16], the ant colony optimization (ACO) ^[17], the crayfish optimization algorithm (COA) ^[18], the Siberian tiger optimization (STO) ^[19]. The evolution-based metaheuristic algorithm is the other branch of the two popular branches. Its inspiration mainly comes from gene mutation, cross-inheritance, natural selection, and other phenomena in evolutionary biology. For example, genetic algorithm (GA) ^[20], evolutionary programming (EP) ^[21], differential evolution (DE) ^[22], virulence optimization algorithm (VOA) ^[23], The bio-geography based optimizer (BBO) ^[24]. Metaheuristic optimization algorithms based on physics, humans, biological populations, and evolution and their inspirations are listed in Table 1.

Table 1. Metaheuristic optimization algorithms.

Classes	Metaheuristic	Inspiration	Date
Physics-based	GSA	The laws of universal gravitation and Newton's second law, which seeks the optimal solution through the interaction between gravity and mass	2009
	RIME	Based on the physical phenomenon of rime-ice, the algorithm is exploration and exploitation by simulating the growth process of rime-ice	2023
	SA	Originate from the principle of solid-state annealing, which raises an object to a very high temperature and then slowly cools it down	1983
	BH	Determine the spin of a black hole by determining the physical size of its innermost stable circular orbit, however, the space-time differences is the main factor between non-spin Schwarzschild black holes and Kerr black holes of the same mass	2013
	KOA	Kepler laws of planetary motion, which predict the velocity and position of planets at any time to find the closest solution to the optimal solution	2023
Human-based	TLBO	Guidance of teachers to students and mutual learning among students	2012
	MOA	The mother's leadership of the child's growth process is simulated, and the algorithm is divided into three stages: education, advice, and upbringing	2023
	HS	Simulate the principle of music performance	2001
	GTOA	Simulate the mechanism of group teaching	2020
	BSO	Simulate the process of humans using creative thinking to solve problems during meetings	2016
Based on biological populations	PSO	Simulate the behavior of birds searching for food in nature	1995
	MBO	Simulated the migration of monarch butterflies thousands of miles to Mexico	2019
	QoS-based dissemination of content in Grids	Inspired by the way of information transmission by ants and termites, a new grid information system is built to reorganize and disseminate information	2008
	Reorganization and discovery of grid information with epidemic tuning	Inspired by the information exchange behavior of ant colonies, resources are discovered by sharing information among groups	2008
	Bio-inspired algorithm for outliers detection	The similarity between mobile agent and data object is used to detect abnormal data in distributed system	2017
	CPA	Simulate the cooperative predation behavior of animals in nature, dispersing prey and rounding them up	2021
	ACO	Based on the behavior of ants discovering paths while searching for food	2006
	COA	The algorithm was divided into three stages based on the crayfish's summer resort behavior, competition and foraging behavior in response to temperature changes	2023
	STO	The hunting behavior of Siberian tigers in battle was simulated	2022
Evolution-based	GA	Borrow Mendel's genetic theory and Darwin's evolution theory and achieves the selection process of natural selection and survival of the fittest by simulating natural evolution	1992
	EP	Simulate the adaptive behavior of organisms to evolution	2003
	DE	Based on evolutionary ideas such as genetic algorithms and is based on distinct differences within the population	1997
	VOA	Inspired by the virus invasion of human body, the algorithm is exploration and exploitation by simulating the special invasion mechanism of virus	2016
	BBO	Simulate the change of species migration in a habitat	2008

| Show Table

DownLoad: CSV

The PDO algorithm ^[25] is a metaheuristic algorithm based on biological populations proposed in 2022. This algorithm simulates each cluster of prairie dogs' behavior in searching for food, building caves, and preventing natural enemies. Each cluster of prairie dogs has its information exchange mode. During the exploration phase, they continuously search for the best food source to build each family cave. However, during the exploitation phase, due to the influence of natural enemies and food sources, the algorithm easily falls into local optima, reducing its optimization performance. According to the no free lunch (NFL) ^[26] theorem, no algorithm can solve all optimization problems. Regardless of the algorithm used, at least one objective function enables the algorithm to find the optimal value. Therefore, Liu et al. applied the improved prairie dog optimization (IPDO) algorithm ^[27] to test its performance in gate recursive unit networks; Nguyen et al. ^[28] used the PDO algorithm to solve the problem of damage identification in engineering structures; Gürses et al. ^[29] combined Gaussian mutation and chaos search with PDO to enhance the optimization ability of the algorithm; Abualigah et al. ^[30] combined the opposition-based Laplacian distribution with the PDO algorithm and applied it to industrial engineering design problems and photovoltaic solar problems.

Whether prairie dogs are searching for food or avoiding natural enemies, they generate an audio signal to find better food resources or evade the pursuit of natural enemies in response to the slow convergence speed of the PDO algorithm and prairie dog's habitual nature. This paper proposes a modified prairie dog optimization (MPDO) algorithm. Adding an audio signal factor to represent the distance between the prairie dog and the food (natural enemy), the prairie dogs adjust their position based on the audio signal's strength and speed to ensure sufficient food and safety. This method is called the frequency wave strategy, effectively improving the algorithm's performance, and the global optimization ability of the algorithm is enhanced. The frequency wave strategy balances the exploration and exploitation of the algorithm, and controls the prairie dog's position by controlling the search range for food and the effective escape range for natural enemies. In addition, the MPDO algorithm also adds chaotic tent mapping and lens opposition-based learning strategy. The tent chaotic mapping ^[31] is added in population initialization, making the initialization distribution of the prairie dogs population more uniform and providing the possibility of finding the optimal solution. At the same time, the lens opposition-based learning strategy ^[32] enhances the algorithm's global exploration ability.

Through the above strategies, the MPDO algorithm has better global exploration ability. During the experimental phase, 23 standard benchmark and IEEE CEC2014 functions were used to test the MPDO algorithm. Then experimental data, convergence curves, and Wilcoxon rank sum test were analyzed. Finally, to test the MPDO algorithm's practicality in practical engineering problems, this article selected six engineering application problems to test the optimization performance of the MPDO algorithm. These experimental results indicate that the MPDO algorithm has good optimization performance.

The major contributions of this article are as follows:

● A frequency wave strategy was proposed according to prairie dogs' habitual nature. Then, chaotic tent mapping and lens opposition-based learning strategies are added to enhance the global exploration ability of the algorithm;

● Apply the MPDO algorithm to 23 benchmark functions to test its performance;

● The optimization performance of the MPDO algorithm was tested in IEEE CEC2014;

● Eight different algorithms were compared in 23 benchmark functions and IEEE CEC2014 testing.

The rest framework of this article is as follows: The second part briefly introduces the PDO algorithm. The third part introduces the modified methods of the MPDO algorithm and the idea of proposing strategies. The fourth part applies the MPDO algorithm to 23 benchmark and IEEE CEC2014 test functions and analyzes the experimental results. The fifth part provides the experimental results of the MPDO algorithm in six engineering design problems. Finally, the sixth part summarizes the entire article.

2. PDO

The PDO algorithm is a metaheuristic algorithm that simulates the foraging activities of prairie dogs. Prairie dogs engage in social activities such as foraging, building caves, maintaining caves and guarding against predators daily. Therefore, based on the daily activities of prairie dogs, the PDO algorithm is divided into four time periods. Then, we divide exploration and exploitation based on a fixed mirror lifestyle.

2.1. Population initialization

The foraging activity of each prairie dog is represented by 1 × dim in the spatial dimension. In order to prevent prairie dogs from deviating from their trajectory when foraging, upper-bound UB and lower-bound LB are specified to limit the movement range of prairie dogs. The set of each prairie dog in different locations is a solution to a problem. Figure 1 shows the solution of N prairie dogs in the dim dimension.

Figure 1. Population initialization.

DownLoad: Full-Size Img PowerPoint

2.2. Exploration stage

During the first time period, the position of prairie dogs in foraging activities was related to the food sources ρ, the current quality of food, and the location of randomly synthesized prairie dogs. ρ is a fixed food source alarm at 0.1 Khz. In the mathematical model, the quality of the current food is defined as the effectiveness of the evaluation currently obtained best solution eCBest_{i, j}. The position of the randomly synthesized prairie dog is defined as the random cumulative effect CPD_{i, j}. The calculation formula is as follows:

$eCBes{t_{i, j}} = GBes{t_{i, j}} \times \Delta + \frac{{P{D_{i, j}} \times mean(P{D_i})}}{{GBes{t_{i, j}} \times (U{B_j} - L{B_j}) + \Delta }}$

(1)

$CP{D_{i, j}} = \frac{{GBes{t_{i, j}} - rP{D_{i, j}}}}{{GBes{t_{i, j}} + \Delta }}$

(2)

where GBest_{i, j} is the global optimal solution obtained so far, Δ is a very small number indicating the differences between prairie dog, and rPD_{i, j} are the positions of the random solutions of prairie dog.

Therefore, the formula for updating the location of prairie dogs searching for food is as follows:

$P{D_{i + 1, j + 1}} = GBes{t_{i, j}} - eCBes{t_{i, j}} \times \rho - CP{D_{i, j}} \times Levy\left( n \right)$

(3)

In formula (3), Levy is a Levy distribution with discontinuous jumps.

After finding new food sources, prairie dogs excavate and build new caves around them. During this time period, the location of prairie dogs is related to their excavation intensity DS of the caves. The update formula for DS is as follows:

$DS = 1.5 \times r \times {(1 - \frac{t}{T})^{(2\frac{t}{T})}}$

(4)

r is transformed between -1 and 1 according to the parity of the current iteration number, t is the current iteration number, and T is the maximum iteration number.

The formula (5) shows an update in the position of prairie dogs during the second time period:

$P{D_{i + 1, j + 1}} = GBes{t_{i, j}} \times rPD \times DS \times Levy\left( n \right)$

(5)

2.3. Exploitation stage

During the third time period, prairie dogs will refer to the quality of the current food source ε and the cumulative effect of all prairie dogs to randomly update their positions. In the mathematical model, the quality of the current food source ε is a small number designated as representing the quality of food source. The formula for updating the position of prairie dogs is as follows:

$P{D_{i + 1, j + 1}} = GBes{t_{i, j}} - eCBes{t_{i, j}} \times \varepsilon - CP{D_{i, j}} \times rand$

(6)

where, rand is a random number between 0 and 1.

During the foraging process of prairie dogs, predators often attack them. Therefore, the predator attack is defined as the predatory effect PE. The calculation formula for PE is as follows:

$PE = 1.5 \times {(1 - \frac{t}{T})^{(2\frac{t}{T})}}$

(7)

Update the position of prairie dogs during the fourth period by formula (8).

$P{D_{i + 1, j + 1}} = GBes{t_{i, j}} \times PE \times rand$

(8)

2.4. Implementation of PDO algorithm

The original PDO algorithm simulated the behavior of prairie dogs in foraging, burrowing, and avoiding natural enemies, dividing the behavior of prairie dogs into four time periods. During these four time periods, prairie dogs, according to food sources alarm ρ, the cumulative effect of CPD_{i, j} on all prairie dogs, the intensity of burrowing DS, the quality of food sources ε, and the predatory effect PE of the predator constantly updates position to find better food sources. Formula (9) summarizes the updated positions of prairie dogs at four time periods.

$\left\{ {\begin{array}{*{20}{c}} {P{D_{i + 1, j + 1}} = GBes{t_{i, j}} - eCBes{t_{i, j}} \times \rho - CP{D_{i, j}} \times Levy\left( n \right)\begin{array}{*{20}{c}} {}&{\forall t < \frac{T}{4}} \end{array}} \\ {P{D_{i + 1, j + 1}} = GBes{t_{i, j}} \times rPD \times DS \times Levy\left( n \right)\begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} {}&{}&{} \end{array}}&{\forall \frac{T}{4} \leqslant t < \frac{T}{2}} \end{array}} \\ {P{D_{i + 1, j + 1}} = GBes{t_{i, j}} - eCBes{t_{i, j}} \times \varepsilon - CP{D_{i, j}}\begin{array}{*{20}{c}} { \times rand}&{\forall \frac{T}{2} \leqslant t < 3\frac{T}{4}} \end{array}} \\ {P{D_{i + 1, j + 1}} = GBes{t_{i, j}} \times PE \times rand\begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} {}&{} \end{array}}&{}&{} \end{array}}&{}&{}&{\forall 3\frac{T}{4} \leqslant t < T} \end{array}} \end{array}} \right.$

(9)

The pseudo-code of the PDO algorithm is shown in Algorithm 1.

Algorithm 1. Prairie Dog Optimization Algorithm Pseudo-Code.
Population initialization
Initialization parameters
Calculate fitness value
while t ≤ T
Update DS and PE using formulas (4) and (7)
Update CPD_{i, j} using formula (2)
If t < T / 4
Update position using formula (3)
Else if T / 4 ≤ t < T / 2
Update position using formula (5)
Else if T / 2 ≤ t < (3 × T) / 4
Update position using formula (6)
Else if (3 × T) / 4 ≤ t
Update position using formula (8)
End
t = t + 1
End

3. MPDO

3.1. Frequency wave strategy

The prairie dog population has a perfect speech coordination system, where thought recognizes various foods and natural enemies and emits different frequencies of audio frequency fluctuation signals to provide feedback on the position of food and natural enemies. Therefore, a frequency wave strategy is proposed to improve the optimization performance of the algorithm. During the food search (Figure 2(b)), prairie dogs respond to the distance between food resource and prairie dogs with the audio signal's strength. When the audio signal is weak, prairie dogs tend to sound sources to search for better food; when the audio signal is strong, the prairie dog approaches the sound source around their current position. The distance between the predator and the prairie dog is reflected by the speed of the audio signal (Figure 2(a)). When predators appear in the prairie dog's view at a relatively long distance, they will emit a slower audio signal to remind the prairie dog population to stay away from their natural enemy; when the location of the predator poses a threat to the prairie dog, a faster audio signal will cause the prairie dog population to flee to the effective avoidance area quickly. Figure 2 is a schematic diagram of an audio signal warning simulation, briefly showing the movement of prairie dog within different signal ranges.

Figure 2. Audio signal warning simulation schematic diagram.

DownLoad: Full-Size Img PowerPoint

The audio signal factor of the frequency wave strategy is defined as A, which changes randomly due to changes in the position of food or natural enemies. The distance between the prairie dog and food (natural enemies) is defined as d, and the sound source area (avoidance area) is defined as area. They calculation formulas are as follows:

$A = 2 \times rand$

(10)

$d = Pos - PD$

(11)

$area = {(abs(Po{s^2} - PD_{i, j}^2))^{0.2}}$

(12)

In the above formulas, rand is the sound frequency fluctuation between 0 and 1 caused by random changes in the position of food or natural enemies. Pos is the location of food (natural enemies).

The specific update formula for frequency wave strategy is as follows:

$\left\{ {\begin{array}{*{20}{c}} {{x_{new}} = P{D_{i, j}} - A \times d \times Levy}&{A < 1} \\ {{x_{new}} = P{D_{i, j}} + r \times A \times area}&{else} \end{array}} \right.$

(13)

where, x_new represents the new location of the prairie dog, and r is a random number between –1 and 1.

3.2. Tent chaotic initialization

The original PDO algorithm uses the traditional population initialization method, which cannot effectively guarantee the randomness and diversity of the generated initial population position. However, the tent chaotic initialization population has ergodicity and orderliness, which can make the initial position distribution of the prairie dog population more uniform, thus expanding the scope of individual search space and maintaining population diversity. The mathematical model of tent chaos is as follows:

${x_{i + 1}} = \left\{ {\begin{array}{*{20}{c}} {\frac{{{x_i}}}{{0.7}}}&{{x_i} < 0.7} \\ {\frac{{10}}{3}(1 - {x_i})}&{{x_i} \geqslant 0.7} \end{array}} \right.$

(14)

In order to compare the differences between the original initialization and tent chaotic maps more intuitively, assuming the dimension is two-dimensional and the population size is 30, two initialization population distribution maps are shown in Figure 3.

Figure 3. Distribution map of different initialized population.

DownLoad: Full-Size Img PowerPoint

From Figure 3, it can be observed that the population distribution generated by tent chaotic initialization is more orderly and uniform.

3.3. Lens opposition-based learning strategy

Traditional opposition-based learning is a strategy to expand the search range by generating the current solution in the opposite direction. The generated opposite solution is generally fixed, which is not conducive to the algorithm finding a better position. Based on the optical principle of convex lens imaging, taking one-dimensional space as an example, the coordinate axis [lb, ub] represents the search range, and the y-axis represents the convex lens. Assuming that there is an m individual with a height of H, the projection on the coordinate axis is X. The refraction of the lens y generates an image m' with a height of H'. The projection of m' on the coordinate axis is X'. The opposite individual X' generated by the convex lens imaging principle is shown in Figure 4.

Figure 4. Schematic diagram of lens opposition-based learning.

DownLoad: Full-Size Img PowerPoint

The formula is derived from the principle of convex lens imaging:

$\frac{{(ub + lb)/2 - X}}{{{X^{'}} - (ub + lb)/2}} = \frac{H}{{{H^{'}}}}$

(15)

Let H / H' = k, k be called the scaling factor, and substitute k into formula (15) to obtain the calculation formula for the opposition solution X':

${X^{'}} = \frac{{ub + lb}}{2} + \frac{{ub + lb}}{{2k}} - \frac{X}{k}$

(16)

When k = 1, formula (16) can be abbreviated as the traditional opposition-based learning strategy, by adjusting the value of the scaling factor k, the position of generating the opposition solution in the D-dimensional space is random, the spatial search scope is further expanded, and the population diversity is increased.

3.4. Implementation of the MPDO algorithm

Foraging and burrowing are essential activities for the survival of prairie dogs, during which natural enemies will pursue them. According to the laws of natural survival, animals will gradually evolve while being hunted by natural enemies. In order to avoid the pursuit of natural enemies, prairie dogs have evolved a complex language system that allows them to emit different sound frequencies to respond when facing different natural enemies. According to the strength of the audio signal, prairie dogs will selectively stay away from or close to the food during the foraging process. When attacked by natural enemies, the faster audio signal can help prairie dogs escape to the effective area, while the slower audio signal can effectively remind the prairie dogs to stay away from natural enemies. Therefore, chaotic tent initialization evenly distributes the prairie dog population and increases population diversity. Then opposition-based learning will be carried out to expand the search space. The audio signal factors will enable prairie dogs to find better food resources or avoid pursuing natural enemies.

MPDO algorithm pseudo-code is shown in Algorithm 2.

Algorithm 2. The Modified Prairie Dog Optimization Algorithm Pseudo-Code
Using the formula (14) for population initialization
Calculate fitness value
While t ≤ T
Implement lens opposition-base learning strategy through formula (16)
Calculate the audio signal factor A using formula (10)
Calculate the distance d using formula (11)
If t < T / 4
Update position using formula (3)
Else if T / 4 ≤ t < T / 2
Update position using formula (5)
Else if T / 2 ≤ t < (3 × T) / 4
Update position using formula (6)
Else if (3 × T) / 4 ≤ t
Update position using formula (8)
End
Calculate the area using formula (12)
If A < 1
Use formula (13) to update the position of prairie dogs
Else
Use formula (13) to update the position of prairie dogs
End
t = t + 1
End

The flowchart of the MPDO algorithm is shown in Figure 5.

Figure 5. MPDO algorithm flowchart.

DownLoad: Full-Size Img PowerPoint

3.5. Time complexity analysis

Time complexity is an important indicator for evaluating an algorithm and directly reflects operational efficiency. Assuming the population size is N, the search space dimension is dim, the number of iterations is T, the time required for frequency wave strategy position update is f, the time required for lens opposition-based learning strategy position update is f, the evaluated time of the experimental function is t₂, the total running time of the algorithm is t. According to the calculation principle of time complexity, the following calculation formula (17) is given.

$\begin{array}{c} O(t) = O(\begin{array}{*{20}{c}} {population}&{initialization} \end{array}) + O(\begin{array}{*{20}{c}} {strategy}&{\begin{array}{*{20}{c}} {position}&{update} \end{array}} \end{array}) \hfill \\ \begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} {}&{}&{}&{} \end{array}}&{}&{ + O(\begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} {evaluate}&{experimental} \end{array}}&{function)} \end{array}}&{} \end{array} \hfill \end{array}$

(17)

During the algorithm operation, due to the short calculation time of the parameters, it can usually be ignored. The time complexity of calculating the parameters is not given in the above formula.

The time required for each stage of the PDO algorithm is defined as follows:

1) The time required for population initialization is O (N × dim × T);

2) The time required to evaluate the experimental function is t₂.

Therefore, the time complexity of the PDO algorithm is expressed as the formula (18).

$O(t) = O((N \times dim \times T) + {t_2})$

(18)

The time required for each stage of the MPDO algorithm is defined as:

1) The time required for tent chaos to initialize the population is O (N × dim × T);

2) The time required for the frequency wave strategy position update is O (N × dim × T) × f);

3) The time required for the position update of the lens opposition-based learning strategy is O (N × dim × T) × f);

4) The time required to evaluate the experimental function is t₂.

The time complexity of the MPDO algorithm is expressed as the formula (19).

$O(t) = O((N \times \dim \times T) \times (1 + 2f) + {t_2})$

(19)

Due to (N × dim × T) > > (1+2f), therefore the time complexity of the PDO algorithm and MPDO algorithm was replaced by formula (20). In summary, the time complexity of the MPDO algorithm is consistent with that of the PDO algorithm. The modifications made to this article's PDO algorithm do not increase time complexity.

$O(t) = O((N \times \dim \times T) \times C + {t_2})$

(20)

4. Experimental results and analysis

This experimental environment uses Windows 11 computer with a 64-bit operating system, an 11th Gen Inter (R) Core (TM) i7-11700 processor with a main frequency of 2.50 GHz, a memory of 16 GB, and a programming language implemented in MATLAB version R2021a.

In order to verify the optimization performance of the MPDO algorithm, it was applied to 23 benchmark functions and IEEE CEC2014 benchmark functions for testing. The PDO algorithm ^[25], the WOA ^[33], the sea-horse optimizer (SHO) ^[34], the remora optimization algorithm (ROA) ^[35], the sine cosine algorithm (SCA) ^[36], the sand cat swarm optimization (SCSO) ^[37] and the grey wolf optimizer (GWO) ^[38] are selected to compare with MPDO algorithm. According to the best value (Min), mean value (Mean) and standard deviation (Std) obtained by each algorithm, the superiority of MPDO algorithm is analyzed. Then the advantages and disadvantages of MPDO algorithm in convergence graph are analyzed. Finally, the differences between MPDO algorithm and other algorithms are analyzed by Wilcoxon rank sum test. Table 2 provides the parameter settings for these eight algorithms.

Table 2. Parameter settings for comparison algorithms.

Algorithm	Parameters	Value
MPDO	A	[0, 2]
	Ρ	0.1
	Δ	0.005
PDO	Ρ	0.1
	Δ	0.005
WOA	Coefficient Vector A	[–1, 1]
	Coefficient Vector C	[0, 2]
	Spiral parameters b	1
	Spiral parameters l	[–1, 1]
SHO	U	0.05
	V	0.05
	L	0.05
ROA	C	0.1
SCA	a	2
SCSO	SM	2
	Roulette wheel selection	[0,360]
GWO	A	[–2, 2]
	C	[0, 2]

| Show Table

DownLoad: CSV

4.1. 23 benchmark function testing experiments

The 23 benchmark test functions include seven Uni-modal benchmark functions, six multi-modal benchmark functions, and ten fixed-dimensional multi-modal benchmark functions. In this experiment, the population size is set to 30, the dimension is set to 30 and 500, and the maximum number of iterations is set to 500. The MPDO and the other seven algorithms were run 30 times each to obtain the best fitness value, average fitness value, and standard deviation.

4.1.1. Statistical analysis of 23 function experimental data and convergence curve

Tables 3–5 show the optimal values, mean values, and standard deviations of 8 different algorithms in 23 functions at 30 and 500 dimensions. From the data in Table 3, both MPDO and PDO obtained the theoretical optimal values of F1–F4, while ROA obtained the theoretical optimal values of F1, F3–F5. In F6, MPDO obtained a relatively stable theoretical optimal value. MPDO obtains the theoretical optimal value of F7. The relative optimal values of the F8 are WOA and ROA. Although MPDO did not obtain the theoretical optimal value, optimization results are significantly better than PDO optimization results. MPDO obtained stable relative optimal values in F9–F13, PDO, ROA, and SCSO obtained stable optimal values in F9–F11 WOA, and SHO obtained stable optimal values in F9 and F11. In addition, WOA also obtained optimal relative values in F10, and GWO obtained optimal relative values in F11. Due to the relatively simple fixed dimensional multi-modal benchmark functions F14–F23, eight algorithms in F14, F16–F19 obtained theoretical optimal values, while MPDO and SCSO obtained the optimal relative values in F15. Only SCA did not obtain theoretical optimal values for F20 and F23; SHO and SCA did not obtain optimal values for F22. F21 and F22 were similar, but PDO did not obtain theoretical optimal values in F21. Overall, the optimization performance of MPDO in uni-modal benchmark functions, multi-modal benchmark functions, and fixed dimensional multi-modal benchmark functions are superior to that of PDO and the other seven algorithms, indicating that MPDO using frequency wave strategy has better optimization performance.

Table 3. Statistical results of F1–F13 standard Benchmark functions (dim = 30).

F	Metric	MPDO	PDO	WOA	SHO	ROA	SCA	SCSO	GWO
F1	Min	0	0	4.44×10^-83	4.68×10^-147	0	8.60×10^-2	4.00×10^-132	4.22×10^-29
	Mean	0	0	3.80×10^-74	1.45×10^-140	2.50×10^-313	13.5	6.54×10^-111	2.37×10^-27
	Std	0	0	1.50×10^-73	6.29×10^-140	0	28.5	3.43×10^-110	2.89×10^-27
F2	Min	0	0	1.93×10^-57	2.42×10^-81	6.01×10^-184	4.91×10^-4	1.29×10^-65	2.54×10^-17
	Mean	0	0	1.76×10^-51	8.83×10^-78	1.28×10^-159	2.45×10^-2	1.42×10^-60	1.21×10^-16
	Std	0	0	4.39×10^-51	3.50×10^-77	6.95×10^-159	6.35×10^-2	5.20×10^-60	1.06×10^-16
F3	Min	0	0	1.28×10⁴	5.35×10^-106	0	1.56×10³	3.47×10^-110	5.80×10^-9
	Mean	0	0	4.41×10⁴	1.81×10^-99	2.31×10^-284	8.64×10³	1.92×10^-99	3.15×10^-5
	Std	0	0	1.56×10⁴	6.44×10^-99	0	5.60×10³	8.14×10^-99	1.29×10^-4
F4	Min	0	0	1.44×10^-1	9.99×10^-60	4.17×10^-181	16.0	1.67×10^-57	7.48×10^-8
	Mean	0	0	45.6	2.36×10^-56	1.09×10^-160	3.68×10¹	3.44×10^-51	9.85×10^-7
	Std	0	0	26.7	1.00×10^-55	3.23×10^-160	13.0	1.21×10^-50	1.32×10^-6
F5	Min	28.3	2.97×10^-1	27.1	27.2	2.66×10^-1	92.0	26.2	26.2
	Mean	28.7	16.6	27.9	28.1	25.3	5.72×10⁴	27.9	27.1
	Std	8.54×10^-2	13.6	4.13×10^-1	4.70×10^-1	6.66	1.29×10⁵	9.37×10^-1	7.13×10^-1
F6	Min	4.23×10^-7	6.25×10^-1	8.06×10^-2	1.92	2.39×10^-2	4.32	7.23×10^-1	6.25×10^-5
	Mean	1.48×10^-4	2.98	3.16×10^-1	3.16	9.12×10^-2	21.6	1.94×10	7.96×10^-1
	Std	1.72×10^-4	1.58	2.09×10^-1	6.08×10^-1	5.79×10^-2	26.2	6.22×10^-1	4.19×10^-1
F7	Min	1.54×10^-7	2.05×10^-6	1.67×10^-4	7.27×10^-6	3.63×10^-6	9.11×10^-3	1.67×10^-6	5.56×10^-4
	Mean	5.42×10^-5	9.78×10^-5	5.77×10^-3	1.02×10^-4	1.92×10^-4	1.59×10^-1	1.67×10^-4	1.88×10^-3
	Std	5.96×10^-5	9.75×10^-5	5.64×10^-3	1.22×10^-4	2.50×10^-4	1.60×10^-1	2.09×10^-4	1.28×10^-3
F8	Min	–6.92×10³	–4.36×10³	–1.26×10⁴	–7.30×10³	–1.26×10⁴	–4.27×10³	–8.57×10³	–7.30×10³
	Mean	–5.88×10³	–3.73×10³	–1.05×10⁴	–6.08×10³	–1.24×10⁴	–3.71×10³	–6.83×10³	–6.07×10³
	Std	4.27×10²	2.91×10²	1.77×10³	6.89×10²	4.33×10²	2.39×10²	9.75×10²	7.89×10²
F9	Min	0	0	0	0	0	8.99×10^-2	0	5.68×10^-14
	Mean	0	0	0	0	0	41.7	0	2.41
	Std	0	0	0	0	0	31.6	0	3.62
F10	Min	8.88×10^-16	8.88×10^-16	8.88×10^-16	4.44×10^-15	8.88×10^-16	6.29×10^-2	8.88×10^-16	7.19×10^-14
	Mean	8.88×10^-16	8.88×10^-16	4.32×10^-15	4.44×10^-15	8.88×10^-16	13.1	8.88×10^-16	1.04×10^-13
	Std	0	0	2.38×10^-15	0	0	9.35	0	1.84×10^-14
F11	Min	0	0	0	0	0	2.59×10^-1	0	0
	Mean	0	0	0	0	0	1.12	0	4.21×10^-3
	Std	0	0	0	0	0	8.24×10^-1	0	8.06×10^-3
F12	Min	5.45×10^-8	4.92×10^-2	5.16×10^-3	9.71×10^-2	2.07×10^-3	7.42×10^-1	3.15×10^-2	6.52×10^-3
	Mean	1.67×10^-6	5.24×10^-1	2.33×10^-2	2.87×10^-1	7.63×10^-3	3.96×10³	1.10×10^-1	4.33×10^-2
	Std	2.34×10^-6	5.62×10^-1	1.85×10^-2	1.06×10^-1	4.37×10^-3	1.52×10⁴	6.40×10^-2	2.19×10^-2
F13	Min	3.55×10^-7	1.95	1.03×10^-1	1.27	2.55×10^-2	3.07	1.45	1.67×10^-1
	Mean	7.44×10^-4	2.96	4.77×10^-1	2.10	2.46×10^-1	1.88×10⁴	2.34	6.82×10^-1
	Std	2.79×10^-3	1.93×10^-1	1.94×10^-1	3.69×10^-1	1.44×10^-1	5.74×10⁴	4.19×10^-1	2.55×10^-1

| Show Table

DownLoad: CSV

Table 4. Statistical results of F1–F13 standard Benchmark functions (dim = 500).

F	Metric	MPDO	PDO	WOA	SHO	ROA	SCA	SCSO	GWO
F1	Min	0	0	3.02×10^-82	1.75×10^-113	0	5.37×10⁴	1.23×10^-108	9.73×10^-4
	Mean	0	0	1.12×10^-71	5.46×10^-109	9.82×10^-314	1.81×10⁵	6.66×10^-97	1.39×10^-3
	Std	0	0	5.31×10^-71	2.31×10^-108	0	7.16×10⁴	3.36×10^-96	3.33×10^-4
F2	Min	0	0	5.69×10^-57	1.26×10^-61	2.23×10^-184	23.7	5.97×10^-56	7.84×10^-3
	Mean	0	0	9.25×10^-48	2.33×10^-59	5.25×10^-158	1.17×10²	3.17×10^-51	1.07×10^-2
	Std	0	0	2.99×10^-47	9.79×10^-59	2.86×10^-157	72.6	1.44×10^-50	1.73×10^-3
F3	Min	0	0	1.48×10⁷	2.19×10^-82	3.83×10^-299	4.35×10⁶	8.28×10^-96	1.39×10⁵
	Mean	0	0	2.93×10⁷	3.90×10^-73	8.99×10^-267	6.85×10⁶	1.91×10^-82	3.17×10⁵
	Std	0	0	1.12×10⁷	1.71×10^-72	0	1.50×10⁶	9.97×10^-82	7.70×10⁴
F4	Min	0	0	52.9	1.05×10^-48	1.88×10^-177	98.6	3.15×10^-53	57.4
	Mean	0	0	80.5	2.83×10^-46	9.95×10^-159	99.0	1.30×10^-45	66.7
	Std	0	0	13.6	4.36×10^-46	4.22×10^-158	2.19×10^-1	4.80×10^-45	4.48
F5	Min	4.94×10²	4.99×10²	4.95×10²	4.98×10²	4.94×10²	7.89×10⁸	4.98×10²	4.98×10²
	Mean	4.94×10²	4.99×10²	4.96×10²	4.99×10²	4.95×10²	1.84×10⁹	4.98×10²	4.98×10²
	Std	5.05×10^-3	6.02×10^-3	4.85×10^-1	1.50×10^-1	2.34×10^-1	4.91×10⁸	1.62×10^-1	2.69×10^-1
F6	Min	1.09×10^-5	46.0	10.1	1.16×10²	6.86×10^-1	8.36×10⁴	93.2	87.4
	Mean	2.87×10^-3	1.02×10²	30.9	1.17×10²	14.9	1.75×10⁵	1.05×10²	91.2
	Std	4.00×10^-3	30.2	8.95	6.92×10^-1	6.69	6.55×10⁴	4.36	2.16
F7	Min	4.17×10^-7	4.25×10^-6	7.73×10^-5	3.56×10^-5	4.15×10^-7	7.61×10³	2.00×10^-5	3.06×10^-2
	Mean	6.15×10^-5	9.80×10^-5	3.62×10^-3	1.25×10^-4	2.11×10^-4	1.50×10⁴	1.98×10^-4	4.46×10^-2
	Std	5.85×10^-5	8.39×10^-5	2.63×10^-3	6.97×10^-5	2.13×10^-4	4.28×10³	1.91×10^-4	1.05×10^-2
F8	Min	–8.89×10⁴	–2.50×10⁴	–2.09×10⁵	–2.58×10⁴	–2.09×10⁵	–1.75×10⁴	–6.82×10⁴	–7.11×10⁴
	Mean	–8.58×10⁴	–2.22×10⁴	–1.67×10⁵	–2.21×10⁴	–2.03×10⁵	–1.54×10⁴	–6.01×10⁴	–5.64×10⁴
	Std	1.68×10³	1.86×10³	2.86×10⁴	2.06×10³	1.34×10⁴	1.00×10³	4.83×10³	9.02×10³
F9	Min	0	0	0	0	0	4.78×10²	0	45.6
	Mean	0	0	0	0	0	1.32×10³	0	77.8
	Std	0	0	0	0	0	6.93×10²	0	29.1
F10	Min	8.88×10^-16	8.88×10^-16	8.88×10^-16	4.44×10^-15	8.88×10^-16	12.4	8.88×10^-16	1.46×10^-3
	Mean	8.88×10^-16	8.88×10^-16	4.80×10^-15	4.68×10^-15	8.88×10^-16	20.3	8.88×10^-16	1.89×10^-3
	Std	0	0	2.35×10^-15	9.01×10^-16	0	1.91	0	2.89×10^-4
F11	Min	0	0	0	0	0	4.20×10²	0	1.05×10^-4
	Mean	0	0	0	0	0	1.84×10³	0	1.86×10^-2
	Std	0	0	0	0	0	7.25×10²	0	3.96×10^-2
F12	Min	8.88×10^-8	5.91×10^-2	2.60×10^-2	1.01	7.21×10^-3	3.18×10⁹	6.31×10^-1	6.54×10^-1
	Mean	3.03×10^-6	7.24×10^-1	8.70×10^-2	1.05	3.80×10^-2	5.63×10⁹	7.59×10^-1	7.36×10^-1
	Std	4.45×10^-6	4.67×10^-1	4.27×10^-2	1.77×10^-2	2.43×10^-2	1.18×10⁹	6.88×10^-2	3.33×10^-2
F13	Min	1.55×10^-5	50.0	6.77	49.4	1.59	4.65×10⁹	49.6	48.1
	Mean	5.43×10^-4	50.0	18.4	49.6	7.55	1.03×10¹⁰	49.8	50.8
	Std	4.75×10^-4	4.47×10^-4	6.93	1.07×10^-1	3.19	2.07×10⁹	8.74×10^-2	1.52

| Show Table

DownLoad: CSV

Table 5. Statistical results of F14–F23 standard Benchmark functions.

F	Metric	MPDO	PDO	WOA	SHO	ROA	SCA	SCSO	GWO
F14	Min	9.98×10^-1	9.98×10^-1	9.98×10^-1	9.98×10^-1	9.98×10^-1	9.98×10^-1	9.98×10^-1	9.98×10^-1
	Mean	3.65	4.72	3.16	6.20	4.39	1.73	3.81	4.32
	Std	3.28	3.62	3.23	5.07	4.60	9.69×10^-1	3.81	4.34
F15	Min	3.07×10^-4	5.65×10^-4	3.08×10^-4	3.08×10^-4	3.08×10^-4	4.11×10^-4	3.07×10^-4	3.08×10^-4
	Mean	6.17×10^-4	1.70×10^-3	7.75×10^-4	1.06×10^-3	4.77×10^-4	1.05×10^-3	4.14×10^-4	3.14×10^-3
	Std	2.09×10^-4	1.05×10^-3	5.27×10^-4	3.73×10^-3	1.98×10^-4	3.47×10^-4	2.61×10^-4	6.87×10^-3
F16	Min	-1.03	-1.03	-1.03	-1.03	-1.03	-1.03	-1.03	-1.03
	Mean	-1.03	-1.03	-1.03	-1.03	-1.03	-1.03	-1.03	-1.03
	Std	4.55×10^-16	3.35×10^-3	3.38×10^-10	6.26×10^-7	2.37×10^-6	3.53×10^-5	1.04×10^-9	3.04×10^-8
F17	Min	3.98×10^-1	3.98×10^-1	3.98×10^-1	3.98×10^-1	3.98×10^-1	3.98×10^-1	3.98×10^-1	3.98×10^-1
	Mean	3.98×10^-1	3.98×10^-1	3.98×10^-1	3.98×10^-1	3.98×10^-1	3.99×10^-1	3.98×10^-1	3.98×10^-1
	Std	3.24×10^-16	1.97×10^-4	5.85×10^-6	3.18×10^-5	8.95×10^-5	1.07×10^-3	3.27×10^-8	8.47×10^-7
F18	Min	3.00	3.00	3.00	3.00	3.00	3.00	3.00	3.00
	Mean	3.00	3.00	3.00	5.70	3.00	3.00	3.00	3.00
	Std	1.51×10^-5	6.42×10^-13	1.41×10^-3	14.8	5.14×10^-4	5.60×10^-5	7.41×10^-6	4.85×10^-5
F19	Min	–3.86	–3.86	–3.86	–3.86	–3.86	–3.86	–3.86	–3.86
	Mean	–3.86	–3.86	–3.86	–3.86	–3.86	–3.85	–3.86	–3.86
	Std	2.39×10^-15	6.69×10^-3	5.01×10^-3	3.05×10^-3	3.02×10^-3	1.15×10^-2	3.31×10^-3	4.66×10^-3
F20	Min	–3.32	–3.32	–3.32	–3.32	–3.32	–3.14	–3.32	–3.32
	Mean	–3.11	–3.01	–3.20	–2.95	–3.23	–2.86	–3.17	–3.24
	Std	3.86×10^-1	4.09×10^-1	2.19×10^-1	4.27×10^-1	9.94×10^-2	3.66×10^-1	1.80×10^-1	8.85×10^-2
F21	Min	–10.2	–10.1	–10.2	–10.1	–10.2	–4.91	–10.2	–10.2
	Mean	–6.42	–4.88	–7.27	–5.78	–10.1	–1.97	–5.19	–8.97
	Std	2.29	2.90	3.01	2.88	3.35×10^–2	1.46	1.97	2.17
F22	Min	–10.4	–10.4	–10.4	–10.3	–10.4	–6.55	–10.4	–10.4
	Mean	–8.63	–5.02	–7.42	–5.46	–10.4	–3.38	–6.48	–10.4
	Std	2.55	3.44	3.10	1.89	1.98×10^-2	2.03	2.68	1.13×10^-3
F23	Min	–10.5	–10.5	–10.5	–10.5	–10.5	–8.77	–10.5	–10.5
	Mean	–7.29	–3.99	–6.92	–6.01	–10.5	–4.11	–6.22	–10.5
	Std	2.70	2.59	3.32	2.61	1.94×10^-2	2.07	2.82	1.29×10^-3

| Show Table

DownLoad: CSV

To fully illustrate the optimization effect of MPDO, Figures 6–8 show the convergence ability of 8 algorithms in 23 functions in 30 and 500 dimensions. From the convergence curve, MPDO has good convergence ability in F1–F4 and quickly finds the function's optimal value. In F5, the MPDO algorithm is very similar to the optimal values found by other algorithms. In F10, both MPDO and ROA obtained good relative optimal values. In F6, F7, F12 and F13, the MPDO algorithm can effectively find better convergence values. In F9 and F11, the MPDO algorithm has good convergence speed and quickly finds the optimal value. Due to the relatively simple F14–F23 function, eight algorithms have good optimization results. In F16–F19, each algorithm quickly finds the optimal value. In F14, F15, F20–F23, the MPDO algorithm found the optimal value. Based on the above analysis, the MPDO algorithm has better optimization ability than the PDO algorithm and has good results compared to the other seven algorithms.

Figure 6. Convergence curves of various algorithms in the F1-F13 function (dim = 30).

DownLoad: Full-Size Img PowerPoint

Figure 7. Convergence curves of various algorithms in the F1–F13 function (dim = 500).

DownLoad: Full-Size Img PowerPoint

Figure 8. Convergence curves of various algorithms in F14–F23 functions.

DownLoad: Full-Size Img PowerPoint

4.1.2. Analysis of Wilcoxon rank sum test results

Wilcoxon rank sum test is a non-parametric test method that uses means to test whether there are differences between algorithms. After analysis of the 23 function data and convergence curve, we can only estimate that the MPDO algorithm has good optimization ability preliminarily. The Wilcoxon rank sum test compares the MPDO algorithm with seven different algorithms to test the differences between the MPDO algorithm and other algorithms. Table 6 shows that the results of the MPDO algorithm and the PDO algorithm in the F1–F4 function are 1, indicating that the values obtained by the two algorithms are consistent. The results of the ROA in F1 are greater than 5%, indicating that the difference between the ROA and the MPDO algorithm is small, and they have relatively close values. In the F9–F11 function, many results with 1 indicate that these algorithms are consistent with the MPDO algorithm and obtain the same value. The F14–F23 function is relatively simple, so many algorithms have smaller differences than the MPDO algorithm. In addition, the results of most of the data in the table are less than 5%, indicating significant differences between the MPDO algorithm and other algorithms in most cases.

Table 6. Experimental results of the Wilcoxon rank-sum test on the 23 standard benchmark functions.

F	dim	MPDO VS PDO	MPDO VS WOA	MPDO VS SHO	MPDO VS ROA	MPDO VS SCA	MPDO VS SCSO	MPDO VS GWO
F	dim	MPDO VS PDO	MPDO VS WOA	MPDO VS SHO	MPDO VS ROA	MPDO VS SCA	MPDO VS SCSO	MPDO VS GWO	F1	30	1.00	1.73×10^-6	1.73×10^-6	5.00×10^-1	1.73×10^-6	1.73×10^-6	1.73×10^-6
	500	1.00	1.73×10^-6	1.73×10^-6	2.50×10^-1	1.73×10^-6	1.73×10^-6	1.73×10^-6
F2	30	1.00	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
	500	1.00	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F3	30	1.00	1.73×10^-6	1.73×10^-6	2.56×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
	500	1.00	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F4	30	1.00	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
	500	1.00	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F5	30	4.72×10^-2	3.18×10^-6	1.80×10^-5	1.73×10^-6	1.73×10^-6	3.38×10^-3	1.92×10^-6
	500	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F6	30	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	2.13×10^-6
	500	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F7	30	6.87×10^-2	1.73×10^-6	6.56×10^-2	3.16×10^-3	1.73×10^-6	1.40×10^-2	1.73×10^-6
	500	1.47×10^-1	1.92×10^-6	1.83×10^-3	3.88×10^-4	1.73×10^-6	3.59×10^-4	1.73×10^-6
F8	30	1.73×10^-6	1.73×10^-6	2.21×10^-1	1.73×10^-6	1.73×10^-6	7.71×10^-4	1.92×10^-1
	500	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F9	30	1.00	1.00	1.00	1.00	1.73×10^-6	1.00	1.68×10^-6
	500	1.00	1.00	1.00	1.00	1.73×10^-6	1.00	1.73×10^-6
F10	30	1.00	9.85×10^-6	4.32×10^-8	1.00	1.73×10^-6	1.00	1.67×10^-6
	500	1.00	5.06×10^-6	1.01×10^-7	1.00	1.73×10^-6	1.00	1.73×10^-6
F11	30	1.00	1.00	1.00	1.00	1.73×10^-6	1.00	1.56×10^-2
	500	1.00	1.00	1.00	1.00	1.73×10^-6	1.00	1.73×10^-6
F12	30	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
	500	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F13	30	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
	500	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F14	30	2.06×10^-1	4.78×10^-1	2.85×10^-2	8.88×10^-1	5.67×10^-3	8.77×10^-1	6.58×10^-1
	500	2.07×10^-2	5.86×10^-1	3.16×10^-3	3.71×10^-1	6.88×10^-1	6.73×10^-1	1.71×10^-1
F15	30	4.29×10^-6	5.17×10^-1	9.63×10^-4	4.39×10^-3	6.34×10^-6	8.31×10^-4	2.80×10^-1
	500	1.24×10^-5	9.59×10^-1	3.88×10^-4	8.73×10^-3	2.61×10^-4	4.07×10^-5	7.81×10^-1
F16	30	8.86×10^-5	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
	500	2.93×10^-4	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F17	30	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
	500	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F18	30	1.73×10^-6	1.53×10^-1	8.92×10^-5	2.60×10^-5	8.97×10^-2	8.22×10^-3	4.07×10^-2
	500	1.73×10^-6	4.41×10^-1	1.64×10^-5	3.68×10^-2	1.04×10^-2	4.68×10^-3	2.06×10^-1
F19	30	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
	500	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
F20	30	5.98×10^-2	5.17×10^-1	1.40×10^-2	2.62×10^-1	1.20×10^-3	7.50×10^-1	5.71×10^-2
	500	9.43×10^-1	1.57×10^-2	6.44×10^-1	1.48×10^-4	8.97×10^-2	4.68×10^-3	1.25×10^-4
F21	30	1.74×10^-4	8.61×10^-1	3.33×10^-2	5.31×10^-5	1.73×10^-6	3.93×10^-1	1.48×10^-4
	500	1.29×10^-3	7.50×10^-1	1.85×10^-2	3.61×10^-3	2.88×10^-6	2.37×10^-1	7.86×10^-2
F22	30	9.32×10^-6	6.04×10^-3	1.64×10^-5	6.44×10^-1	5.22×10^-6	1.59×10^-3	6.44×10^-1
	500	1.36×10^-5	2.80×10^-1	1.24×10^-5	1.48×10^-3	6.98×10^-6	1.71×10^-1	3.61×10^-3
F23	30	6.89×10^-5	1.85×10^-1	4.39×10^-3	1.48×10^-3	2.22×10^-4	3.60×10^-1	1.48×10^-3
	500	4.68×10^-3	2.80×10^-1	1.13×10^-5	1.48×10^-3	5.31×10^-5	3.50×10^-2	1.75×10^-2

| Show Table

DownLoad: CSV

Based on the analysis of the comprehensive data table, convergence curve, and Wilcoxon rank sum test results, the MPDO algorithm has good optimization performance among 23 benchmark test functions. Compared with the PDO algorithm, the optimization ability of the MPDO algorithm is significantly improved. Compared with other algorithms, the MPDO algorithm also has good advantages.

4.2. IEEE CEC2014 test function experiment

The IEEE CEC2014 test set has a total of 30 single objective test functions and is one of the most widely used. Therefore, we selected IEEE CEC2014 to verify the optimization performance of the MPDO algorithm, set the population size N = 30, and the maximum number of iterations T = 500.

Table 7 shows the optimal values, mean values, and standard deviations obtained by the MPDO algorithm in the IEEE CEC2014 test function. From the data in the Table 7, which eight algorithms have found the optimal solution in CEC12, CEC13, CEC14, CEC16 and CEC26. Only the PDO algorithm has not found the optimal value in CEC19. Although the MPDO algorithm did not obtain the optimal value in some CEC test functions, there is a small gap compared to the GWO algorithm that obtained the optimal solution. From the overall data, the optimization ability of the MPDO algorithm is stronger than the other seven algorithms and has good performance compared to the PDO algorithm.

Table 7. Statistical results of IEEE CEC2014 test functions.

F	Metric	MPDO	PDO	WOA	SHO	ROA	SCA	SCSO	GWO
CEC1	Min	1.17×10⁶	6.76×10⁸	1.04×10⁸	1.31×10⁸	9.28×10⁷	2.99×10⁸	7.40×10⁷	2.99×10⁷
	Mean	4.21×10⁶	1.21×10⁹	2.33×10⁸	3.96×10⁸	3.02×10⁸	5.01×10⁸	2.05×10⁸	1.03×10⁸
	Std	2.71×10⁶	3.41×10⁸	8.41×10⁷	1.40×10⁸	9.83×10⁷	1.40×10⁸	9.43×10⁷	6.28×10⁷
CEC2	Min	1.73×10³	5.39×10¹⁰	2.40×10⁹	1.76×10¹⁰	9.59×10⁹	1.90×10¹⁰	1.34×10⁹	3.02×10⁸
	Mean	1.55×10⁴	6.81×10¹⁰	7.54×10⁹	3.34×10¹⁰	3.10×10¹⁰	2.92×10¹⁰	9.79×10⁹	2.81×10⁹
	Std	9.73×10³	8.84×10⁹	3.54×10⁹	8.87×10⁹	1.17×10¹⁰	4.29×10⁹	5.63×10⁹	2.83×10⁹
CEC3	Min	5.85×10²	6.54×10⁴	6.75×10⁴	2.92×10⁴	4.90×10⁴	4.91×10⁴	4.21×10⁴	3.44×10⁴
	Mean	1.33×10⁴	1.25×10⁵	1.43×10⁵	4.91×10⁴	6.80×10⁴	7.71×10⁴	5.50×10⁴	5.26×10⁴
	Std	9.34×10³	4.54×10⁴	7.63×10⁴	1.03×10⁴	8.10×10³	1.64×10⁴	8.85×10³	1.21×10⁴
CEC4	Min	4.68×10²	4.56×10³	7.72×10²	1.07×10³	9.64×10²	1.55×10³	6.53×10²	5.57×10²
	Mean	5.34×10²	1.02×10⁴	1.35×10³	2.99×10³	2.68×10³	2.84×10³	1.09×10³	7.28×10²
	Std	3.76×10¹	3.41×10³	3.65×10²	1.27×10³	1.40×10³	9.19×10²	3.86×10²	1.81×10²
CEC5	Min	5.20×10²	5.21×10²	5.21×10²	5.20×10²	5.21×10²	5.21×10²	5.20×10²	5.21×10²
	Mean	5.21×10²	5.21×10²	5.21×10²	5.21×10²	5.21×10²	5.21×10²	5.21×10²	5.21×10²
	Std	4.59×10^-1	8.74×10^-2	9.63×10^-2	1.14×10^-1	8.98×10^-2	4.68×10^-2	1.43×10^-1	6.08×10^-2
CEC6	Min	6.30×10²	6.39×10²	6.32×10²	6.26×10²	6.27×10²	6.32×10²	6.26×10²	6.10×10²
	Mean	6.38×10²	6.43×10²	6.39×10²	6.31×10²	6.35×10²	6.38×10²	6.31×10²	6.17×10²
	Std	3.99	2.04	3.10	2.25	3.14	2.32	3.52	3.01
CEC7	Min	7.00×10²	1.21×10³	7.24×10²	8.19×10²	7.48×10²	8.71×10²	7.15×10²	7.04×10²
	Mean	7.00×10²	1.38×10³	7.49×10²	9.96×10²	9.13×10	9.50×10²	7.92×10²	7.27×10²
	Std	4.21×10^-2	78.8	20.5	77.7	88.0	48.0	51.8	20.9
CEC8	Min	8.93×10²	1.10×10³	9.88×10²	9.39×10²	1.01×10³	1.05×10³	8.93×10²	8.54×10²
	Mean	9.85×10²	1.19×10³	1.04×10³	9.78×10²	1.04×10³	1.09×10³	9.96×10²	9.05×10²
	Std	56.7	47.4	46.3	17.0	20.7	24.1	37.4	21.9
CEC9	Min	1.03×10³	1.18×10³	1.12×10³	1.08×10³	1.09×10³	1.16×10³	1.05×10³	9.77×10²
	Mean	1.12×10³	1.26×10³	1.20×10³	1.13×10³	1.16×10³	1.21×10³	1.12×10³	1.03×10³
	Std	37.3	67.8	68.8	25.5	28.7	24.6	30.2	42.3
CEC10	Min	3.29×10³	7.42×10³	4.64×10³	3.19×10³	4.60×10³	6.88×10³	3.93×10³	2.47×10³
	Mean	4.62×10³	8.75×10³	6.35×10³	4.58×10³	6.21×10³	7.95×10³	5.60×10³	3.55×10³
	Std	8.80×10²	5.62×10²	6.56×10²	5.54×10²	5.82×10²	4.76×10²	7.82×10²	5.47×10²
CEC11	Min	1.66×10³	2.29×10³	1.47×10³	1.37×10³	1.48×10³	2.18×10³	1.46×10³	1.16×10³
	Mean	2.37×10³	2.84×10³	2.31×10³	1.81×10³	2.20×10³	2.61×10³	2.04×10³	1.73×10³
	Std	3.92×10²	2.76×10²	3.31×10²	2.27×10²	4.02×10²	2.26×10²	2.97×10²	2.78×10²
CEC12	Min	1.20×10³	1.20×10³	1.20×10³	1.20×10³	1.20×10³	1.20×10³	1.20×10³	1.20×10³
	Mean	1.20×10³	1.20×10³	1.20×10³	1.20×10³	1.20×10³	1.20×10³	1.20×10³	1.20×10³
	Std	3.32×10^-1	5.65×10^-1	3.23×10^-1	2.16×10^-1	3.25×10^-1	2.96×10^-1	2.73×10^-1	7.02×10^-1
CEC13	Min	1.30×10³	1.30×10³	1.30×10³	1.30×10³	1.30×10³	1.30×10³	1.30×10³	1.30×10³
	Mean	1.30×10³	1.30×10³	1.30×10³	1.30×10³	1.30×10³	1.30×10³	1.30×10³	1.30×10³
	Std	2.47×10^-1	8.76×10^-1	2.01×10^-1	1.49×10^-1	1.83×10^-1	1.37×10^-1	1.88×10^-1	7.31×10^-2
CEC14	Min	1.40×10³	1.40×10³	1.40×10³	1.40×10³	1.40×10³	1.40×10³	1.40×10³	1.40×10³
	Mean	1.40×10³	1.41×10³	1.40×10³	1.40×10³	1.40×10³	1.40×10³	1.40×10³	1.40×10³
	Std	2.09×10^-1	8.16	2.03×10^-1	2.04	4.14	3.77×10^-1	2.15×10^-1	1.72×10^-1
CEC15	Min	1.50×10³	1.57×10³	1.50×10³	1.50×10³	1.50×10³	1.51×10³	1.50×10³	1.50×10³
	Mean	1.51×10³	4.01×10³	1.51×10³	1.51×10³	1.60×10³	1.51×10³	1.50×10³	1.50×10³
	Std	5.58	3.61×10³	6.54	8.19	4.03×10²	2.76	1.91	1.11
CEC16	Min	1.60×10³	1.60×10³	1.60×10³	1.60×10³	1.60×10³	1.60×10³	1.60×10³	1.60×10³
	Mean	1.60×10³	1.60×10³	1.60×10³	1.60×10³	1.60×10³	1.60×10³	1.60×10³	1.60×10³
	Std	3.40×10^-1	2.22×10^-1	2.73×10^-1	3.01×10^-1	3.25×10^-1	1.97×10^-1	4.11×10^-1	3.85×10^-1
CEC17	Min	4.75×10³	2.95×10⁴	6.57×10³	6.65×10³	3.00×10³	7.68×10³	2.37×10³	3.06×10³
	Mean	1.00×10⁵	5.36×10⁵	2.43×10⁵	1.96×10⁵	6.06×10⁴	5.58×10⁴	7.22×10⁴	1.44×10⁵
	Std	1.05×10⁵	1.99×10⁵	4.88×10⁵	1.51×10⁵	1.01×10⁵	9.28×10⁴	1.51×10⁵	2.22×10⁵
CEC18	Min	1.86×10³	7.73×10³	2.47×10³	6.11×10³	2.16×10³	5.21×10³	2.01×10³	1.99×10³
	Mean	1.21×10⁴	2.14×10⁵	1.71×10⁴	1.07×10⁴	8.84×10³	3.18×10⁴	9.93×10³	1.05×10⁴
	Std	1.25×10⁴	4.18×10⁵	1.36×10⁴	2.89×10³	5.03×10³	3.19×10⁴	4.24×10³	7.92×10³
CEC19	Min	1.90×10³	1.91×10³	1.90×10³	1.90×10³	1.90×10³	1.90×10³	1.90×10³	1.90×10³
	Mean	1.91×10³	1.92×10³	1.91×10³	1.90×10³	1.91×10³	1.91×10³	1.90×10³	1.90×10³
	Std	1.39	15.9	1.53	1.26	1.63	8.96×10^-1	1.22	9.38×10^-1
CEC20	Min	2.06×10³	2.47×10³	2.35×10³	2.41×10³	2.09×10³	2.32×10³	2.69×10³	2.21×10³
	Mean	8.85×10³	4.67×10⁵	1.23×10⁴	7.98×10³	1.17×10⁴	9.49×10³	7.89×10³	9.14×10³
	Std	7.55×10³	1.44×10⁶	7.00×10³	3.13×10³	4.68×10³	7.35×10³	3.35×10³	5.25×10³
CEC21	Min	2.50×10³	3.08×10⁴	6.10×10³	3.62×10³	3.23×10³	3.81×10³	3.66×10³	2.83×10³
	Mean	1.61×10⁴	1.17×10⁶	2.49×10⁵	1.05×10⁴	1.30×10⁴	1.90×10⁴	1.11×10⁴	8.97×10³
	Std	2.46×10⁴	1.34×10⁶	4.83×10⁵	3.55×10³	1.01×10⁴	1.39×10⁴	6.25×10³	6.20×10³
CEC22	Min	2.22×10³	2.28×10³	2.23×10³	2.22×10³	2.23×10³	2.25×10³	2.23×10³	2.22×10³
	Mean	2.46×10³	2.48×10³	2.30×10³	2.29×10³	2.29×10³	2.28×10³	2.31×10³	2.30×10³
	Std	1.13×10²	1.09×10²	78.2	60.3	71.5	15.5	63.5	59.9
CEC23	Min	2.50×10³	2.50×10³	2.50×10³	2.50×10³	2.50×10³	2.64×10³	2.50×10³	2.63×10³
	Mean	2.50×10³	2.50×10³	2.64×10³	2.63×10³	2.50×10³	2.65×10³	2.50×10³	2.63×10³
	Std	0	0	27.0	25.4	0	8.22	0	2.91
CEC24	Min	2.54×10³	2.57×10³	2.53×10³	2.52×10³	2.54×10³	2.54×10³	2.52×10³	2.51×10³
	Mean	2.59×10³	2.60×10³	2.58×10³	2.57×10³	2.59×10³	2.56×10³	2.59×10³	2.55×10³
	Std	15.8	7.76	25.1	30.7	18.4	11.8	22.4	36.3
CEC25	Min	2.66×10³	2.69×10³	2.70×10³	2.68×10³	2.68×10³	2.68×10³	2.67×10³	2.67×10³
	Mean	2.69×10³	2.70×10³	2.70×10³	2.70×10³	2.70×10³	2.70×10³	2.70×10³	2.70×10³
	Std	11.9	1.81	2.02	4.88	4.54	6.02	5.81	5.20
CEC26	Min	2.70×10³	2.70×10³	2.70×10³	2.70×10³	2.70×10³	2.70×10³	2.70×10³	2.70×10³
	Mean	2.71×10³	2.71×10³	2.71×10³	2.70×10³	2.70×10³	2.70×10³	2.70×10³	2.70×10³
	Std	25.2	17.6	25.3	1.04×10^-1	6.51×10^-1	1.59×10^-1	9.05×10^-2	18.2
CEC27	Min	2.90×10³	2.90×10³	2.71×10³	2.71×10³	2.71×10³	2.72×10³	2.71×10³	2.70×10³
	Mean	2.90×10³	2.90×10³	3.10×10³	3.04×10³	2.89×10³	3.07×10³	2.88×10³	3.02×10³
	Std	0	0	1.44×10²	1.49×10²	47.2	1.17×10²	58.5	1.33×10²
CEC28	Min	3.00×10³	3.00×10³	3.00×10³	3.29×10³	3.00×10³	3.24×10³	3.00×10³	3.16×10³
	Mean	3.00×10³	3.00×10³	3.40×10³	3.45×10³	3.00×10³	3.29×10³	3.00×10³	3.26×10³
	Std	0	0	1.58×10²	1.25×10²	0	59.5	0	1.00×10²
CEC29	Min	3.10×10³	3.10×10³	3.26×10³	3.17×10³	3.10×10³	5.01×10³	3.10×10³	3.16×10³
	Mean	3.43×10³	3.10×10³	3.57×10⁵	7.19×10⁵	1.77×10⁵	2.41×10⁴	7.13×10⁴	5.15×10⁵
	Std	3.48×10²	0	8.62×10⁵	1.52×10⁶	5.26×10⁵	1.95×10⁴	3.58×10⁵	1.15×10⁶
CEC30	Min	3.20×10³	3.20×10³	4.14×10³	4.54×10³	3.56×10³	4.27×10³	3.66×10³	3.51×10³
	Mean	3.88×10³	3.20×10³	5.77×10³	5.51×10³	5.22×10³	4.93×10³	4.75×10³	4.45×10³
	Std	6.85×10²	0	1.15×10³	1.50×10³	1.22×10³	5.20×10²	6.57×10²	7.93×10²

| Show Table

DownLoad: CSV

Figures 9 and 10 shows the convergence curves of 8 algorithms in the IEEE CEC2014 test function. In the uni-modal function, it can be seen that the MPDO algorithm can find the optimal value better. In simple multi-modal functions, the MPDO algorithm did not find the optimal value in CEC6. In CEC8, CEC9 and CEC10, the MPDO and GWO algorithms are in a state of stagnation. In CEC16, the relative optimal obtained by MPDO is only weaker than that obtained by SHO. While in other functions, the MPDO algorithm has good convergence performance. Mixed and composite functions test the overall performance of algorithms. The MPDO algorithm showed good optimization performance in mixed functions. Although the MPDO algorithm showed weak convergence in the CEC24 function, it showed good optimization performance in other composite functions. Overall, the MPDO algorithm has good optimization performance compared to other algorithms.

Figure 9. Convergence curves of various algorithms in the IEEE CEC2014 function (CEC 1–CEC 15).

DownLoad: Full-Size Img PowerPoint

Figure 10. Convergence curves of various algorithms in the IEEE CEC2014 function (CEC 16–CEC 30).

DownLoad: Full-Size Img PowerPoint

Through 30 independent runs, Table 8 obtains the Wilcoxon rank sum test data of the MPDO algorithm and the other seven algorithms in the IEEE CEC2014 test function. From Table 8, due to the simplicity of mixed and composite functions, CEC17-CEC28 has some results greater than 5%, but most are still less than 5%. The data from CEC8-CEC15 shows that only two results of each function are greater than 5%, while the rest are less than 5%. This indicates a significant difference between the MPDO and the other seven algorithms in these functions. In addition, in CEC5, only one data result is greater than 5%. In CEC6, two data results are greater than 5%. These data indicate that the MPDO algorithm differs significantly from other Wilcoxon rank sum test algorithms.

Table 8. Experimental results of the Wilcoxon rank−sum test on the IEEE CEC2014 test functions.

F	MPDO VS PDO	MPDO VS WOA	MPDO VS SHO	MPDO VS ROA	MPDO VS SCA	MPDO VS SCSO	MPDO VS GWO
F	MPDO VS PDO	MPDO VS WOA	MPDO VS SHO	MPDO VS ROA	MPDO VS SCA	MPDO VS SCSO	MPDO VS GWO	CEC1	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
CEC2	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
CEC3	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
CEC4	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
CEC5	3.88×10^-4	1.29×10^-3	1.48×10^-2	4.53×10^-4	8.47×10^-6	1.47×10^-1	1.24×10^-5
CEC6	3.11×10^-5	3.39×10^-1	2.88×10^-6	5.32×10^-3	8.45×10^-1	1.80×10^-5	1.73×10^-6
CEC7	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6	1.73×10^-6
CEC8	1.73×10^-6	3.59×10^-4	6.88×10^-1	8.19×10^-5	2.35×10^-6	4.17×10^-1	6.98×10^-6
CEC9	1.73×10^-6	1.13×10^-5	5.72×10^-1	3.32×10^-4	1.92×10^-6	6.29×10^-1	2.60×10^-6
CEC10	1.73×10^-6	2.88×10^-6	9.92×10^-1	3.18×10^-6	1.73×10^-6	3.06×10^-4	4.45×10^-5
CEC11	2.16×10^-5	8.45×10^-1	1.36×10^-5	1.85×10^-1	8.73×10^-3	2.58×10^-3	3.88×10^-6
CEC12	2.88×10^-6	3.59×10^-4	1.36×10^-1	3.00×10^-2	2.88×10^-6	4.05×10^-1	3.00×10^-2
CEC13	1.73×10^-6	2.29×10^-1	7.19×10^-1	6.58×10^-1	1.29×10^-3	4.72×10^-2	6.34×10^-6
CEC14	1.73×10^-6	1.96×10^-2	8.94×10^-4	9.78×10^-2	1.92×10^-6	3.82×10^-1	1.11×10^-1
CEC15	1.73×10^-6	5.32×10^-3	8.77×10^-1	5.45×10^-2	2.58×10^-3	4.20×10^-4	4.29×10^-6
CEC16	5.29×10^-4	2.56×10^-2	1.02×10^-5	3.52×10^-6	1.57×10^-2	6.89×10^-5	1.73×10^-6
CEC17	2.88×10^-6	2.62×10^-1	8.73×10^-3	8.59×10^-2	3.16×10^-2	6.27×10^-2	7.97×10^-1
CEC18	3.38×10^-3	1.41×10^-1	9.59×10^-1	5.17×10^-1	1.96×10^-3	6.14×10^-1	7.50×10^-1
CEC19	1.73×10^-6	1.04×10^-2	1.89×10^-4	7.19×10^-1	1.59×10^-3	6.89×10^-5	2.88×10^-6
CEC20	3.41×10^-5	8.22×10^-2	7.97×10^-1	1.06×10^-1	7.04×10^-1	5.72×10^-1	8.13×10^-1
CEC21	2.60×10^-6	1.80×10^-5	6.73×10^-1	7.34×10^-1	7.19×10^-2	8.29×10^-1	1.36×10^-1
CEC22	3.49×10^-1	3.11×10^-5	1.24×10^-5	3.52×10^-6	4.29×10^-6	2.37×10^-5	1.13×10^-5
CEC23	1.00	2.56×10^-6	2.56×10^-6	1.00	1.73×10^-6	1.00	1.73×10^-6
CEC24	4.79×10^-2	5.45×10^-2	7.73×10^-3	5.42×10^-1	4.29×10^-6	8.14×10^-2	5.31×10^-5
CEC25	5.36×10^-4	2.35×10^-5	6.36×10^-3	2.23×10^-3	1.36×10^-4	1.48×10^-3	4.53×10^-4
CEC26	3.06×10^-4	2.45×10^-1	1.11×10^-2	5.30×10^-1	1.32×10^-2	6.64×10^-4	6.89×10^-5
CEC27	1.00	3.18×10^-6	7.69×10^-6	5.00×10^-1	3.18×10^-6	2.50×10^-1	1.96×10^-3
CEC28	1.00	2.56×10^-6	1.73×10^-6	1.00	1.73×10^-6	1.00	1.73×10^-6
CEC29	1.96×10^-4	1.97×10^-5	2.07×10^-2	2.60×10^-6	1.73×10^-6	3.15×10^-5	2.22×10^-4
CEC30	5.96×10^-5	2.13×10^-6	4.73×10^-6	5.79×10^-5	6.34×10^-6	4.86×10^-5	3.61×10^-3

| Show Table

DownLoad: CSV

5. Constrained engineering design problems

In Part 4, we tested the MPDO algorithm on 23 benchmark and IEEE CEC2014 functions. In order to test the practical effectiveness of the MPDO algorithm in engineering problems, in Part 5, we selected six engineering design problems: Car Crash-worthiness Design, Welded Beam Design, Speed Reducer Design, Cantilever Beam Design, Pressure Vessel Design, Multiple Disc Clutch Brake.

5.1. Car crash-worthiness design problem

The design of car crash-worthiness is a minimum value problem, which includes 11 variables and ten constraint conditions. Figure 11 shows the finite element model of the problem. The decision variables for this problem are the internal thickness of the B-pillar, the thickness of the B-pillar reinforcement, the thickness of the floor slab, the thickness of the crossbeam, the thickness of the door beam, the thickness of the door strip line reinforcement, the thickness of the longitudinal roof beam, the internal material of the B-pillar, the internal material of the floor slab, the height of the obstacle and the impact position of the obstacle. Abdominal load, upper viscosity standard, middle viscosity standard, low viscosity standard, upper rib deflection, middle rib deflection, lower rib deflection pubic symphysis force, B-pillar midpoint speed, and B-pillar front door speed are the constraints of this problem

Figure 11. Car crash-worthiness design model.

DownLoad: Full-Size Img PowerPoint

The mathematical formula for car crash-worthiness design is as follows:

Minimize:

$f(\overrightarrow x ) = {\text{Weight}},$

(21)

Subject to:

${g_1}(\overrightarrow x ) = {F_a}({\rm{load}}\ {\rm{in}}\ {\rm{abdomen}}) \leqslant 1\ kN,$

(22)

${g_2}(\overrightarrow x ) = V \times Cu\ ({\text{dummy}}\ {\text{upper}}\ {\text{chest}}) \leqslant {0.32\ }m/s,$

(23)

${g_3}(\overrightarrow x ) = V \times Cm\ ({\text{dummy}}\ {\text{middle}}\ {\text{chest}}) \leqslant {0.32\ }m/s,$

(24)

${g_4}(\overrightarrow x ) = V \times Cl\ ({\text{dummy}}\ {\text{lower}}\ {\text{chest}}) \leqslant {0.32\ }m/s,$

(25)

${g_5}(\overrightarrow x ) = {\Delta _{{\text{ur}}}}\ ({\text{upper}}\ {\text{rib}}\ {\text{deflection}}) \leqslant {32\ }mm,$

(26)

${g_6}(\overrightarrow x ) = {\Delta _{{\text{mr}}}}\ ({\text{middle}}\ {\text{rib}}\ {\text{deflection}}) \leqslant {32\ }mm,$

(27)

${g_7}(\overrightarrow x ) = {\Delta _{{\text{lr}}}}\ ({\text{lower}}\ {\text{rib}}\ {\text{deflection}}) \leqslant {32\ }mm,$

(28)

${g_8}(\overrightarrow x ) = {F\ }{({\text{Public}}\ {\text{force}})_p} \leqslant 4\ kN,$

(29)

$\begin{array}{l} {g_9}(\overrightarrow x ) = {V_{{\text{MBP}}}}({\rm{Velocity}}\ {\rm{of}}\ V - \hfill \\ {\text{Pillar}}\ {\rm{at}}\ {\rm{middle}}\ {\rm{point}}) \leqslant {9.9\ }{\rm{mm}}/{\rm{ms}}, \hfill \end{array}$

(30)

$\begin{array}{l} {g_{10}}(\overrightarrow x ) = {V_{{\text{FD}}}}({\rm{Velocity}}\ {\rm{of}}\ {\rm{front}}\ {\rm{door}}\ {\rm{at}}\ V - \hfill \\ {\text{Pillar}}) \leqslant {15.7\ }{\rm{mm}}/{\rm{ms}}, \hfill \end{array}$

(31)

Variable range:

$0.5\le {x}_{1}-{x}_{7}\le 1.5\text{,}{x}_{8}, {x}_{9}\in (0.192, 0.345)\text{,} - 30 \leqslant {x_{10}}, {x_{11}} \leqslant 30,$

(32)

The experimental data for the car crash-worthiness design problem is shown in Table 9. The data in Table 9 shows that the optimal weight obtained by the MPDO algorithm is 23.19869131, which is the best solution for the optimal weights of six algorithms. This indicates that the MPDO algorithm can more efficiently solve the problem of car crash-worthiness design.

Table 9. Experimental results of the car crash-worthiness design problem.

Algorithm	MPDO	MALO ^[39]	MSROA ^[40]	SOA ^[41]	GTO ^[42]	MPA ^[43]
x1	0.500000802	0.5	0.5	0.50063	0.5	0.5
x2	1.242709892	1.2281	1.2284047	1.25921	1.2607	1.22823
x3	0.5	0.5	0.5	0.5	0.5	0.5
x4	1.18070453	1.2126	1.2125762	1.26308	1.1495	1.2049
x5	0.500004599	0.5	0.5	0.9377	0.6205	0.5
x6	1.128124272	1.308	0.9827072	1.11573	0.886	1.2393
x7	0.500000896	0.5	0.5	0.5	0.5	0.5
x8	0.345	0.3449	0.345	0.334889	0.34485	0.34498
x9	0.193007238	0.2804	0.345	0.252275	0.344608	0.192
x10	3.036846819	0.4242	0.2051698	4.3435	6.202292	0.44035
x11	1.13771349	4.6565	2.4627542	16.2208	7.3429	1.78504
Best Weight	23.19869131	23.2294	23.230900	24.42114	23.4084	23.19982

| Show Table

DownLoad: CSV

5.2. Welded beam design problem

The purpose of the welded beam design problem is to minimize the total cost of the welded beam, and the welded beam model is shown in Figure 12. The four decision variables for this problem are weld width h, connecting beam length l, beam height t, and connecting beam thickness b. In addition, there are seven constraint conditions.

Figure 12. Welded beam model.

DownLoad: Full-Size Img PowerPoint

The mathematical formula for the design problem of welded beams is as follows:

Consider:

$x = [{x}_{1} {x}_{2} {x}_{3} {x}_{4}] = [h\text{ }l\text{ }t\text{ }b]$

(33)

Objective function:

$f(x) = 1.10471x_1^2{x_2} + 0.04811{x_3}{x_4}(14.0 + {x_2})$

(34)

Subject to:

${g_1}\left( {\vec x} \right) = \tau \left( {\vec x} \right) - {\tau _{\max }} \leqslant 0$

(35)

${g_2}\left( {\vec x} \right) = \sigma \left( {\vec x} \right) - {\sigma _{\max }} \leqslant 0$

(36)

${g_3}\left( {\vec x} \right) = \delta \left( {\vec x} \right) - {\delta _{\max }} \leqslant 0$

(37)

${g_4}\left( {\vec x} \right) = {x_1} - {x_4} \leqslant 0$

(38)

${g_5}\left( {\vec x} \right) = P - {P_c}\left( {\vec x} \right) \leqslant 0$

(39)

${g_6}\left( {\vec x} \right) = 0.125 - {x_1} \leqslant 0$

(40)

${g_7}\left( {\vec x} \right) = 1.10471x_1^2 + 0.04811{x_3}{x_4}\left( {14.0 + {x_2}} \right) - 0.5 \leqslant 0$

(41)

Where:

$\tau \left(\overrightarrow{x}\right) = \sqrt{{\left({\tau }^{\text{'}}\right)}^{2}+2{\tau }^{\text{'}}{\tau }^{"}\frac{{x}_{2}}{2R}+\left({\tau }^{"}\right)}, {\tau }^{\text{'}} = \frac{P}{\sqrt{2{x}_{1}{x}_{2}}}, {\tau }^{"} = \frac{MR}{J},$

(42)

$M = P\left( {L + \frac{{{x_2}}}{2}} \right), R = \sqrt {\frac{{x_2^2}}{4} + {{\left( {\frac{{{x_1} + {x_3}}}{2}} \right)}^2}} , \sigma \left( {\vec x} \right) = \frac{{6PL}}{{{x_4}x_3^2}},$

(43)

$J = 2\left\{ {\sqrt {2{x_1}{x_2}} \left[ {\frac{{x_x^2}}{4} + {{\left( {\frac{{{x_1} + {x_3}}}{2}} \right)}^2}} \right]} \right\}, \delta \left( {\vec x} \right) = \frac{{6P{L^3}}}{{E{x_4}x_3^2}},$

(44)

${P_c}\left( {\vec x} \right) = \frac{{\sqrt[{4.013E}]{{\frac{{x_3^2x_4^6}}{0}}}}}{{{L^2}}}, \left( {1 - \frac{{{x_3}}}{{2L}}\sqrt {\frac{E}{{4G}}} } \right), \left( {1 - \frac{{{x_3}}}{{2L}}\sqrt {\frac{E}{{4G}}} } \right),$

(45)

$P = 6000lb, L = 14\;{\kern 1pt} in, {\delta _{\max }} = 0.25\begin{array}{*{20}{c}} \; \end{array}{\text{in}}, E = 30 \times {10^6}{\kern 1pt} {\kern 1pt} {\kern 1pt} psi,$

(46)

${\tau _{\max }} = 13600{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} psi, and{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\sigma _{\max }} = 30000{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} psi$

(47)

Variable range:

$0.1 \leqslant {x_i} \leqslant 2, i = 1, 4;0.1 \leqslant {x_i} \leqslant 10, i = 2.3$

(48)

The experimental results for the design issues of welded beams are shown in Table 10. The weight obtained by the MPDO algorithm is 1.708762277, the optimal solution compared to other algorithms. Under this weight, the thickness of the connecting beam b is 0.205418434, the height of the beam t is 9.099486427, the length of the connecting beam l is 3.315146754, and the weld width h is 0.201371958. From this, we have seen that the MPDO algorithm can effectively solve the problem of welded beam design.

Table 10. Experimental results of the welded beam design problem.

Algorithm	h	l	t	b	Best Weight
MPDO	0.201371958	3.315146754	9.099486427	0.205418434	1.708762277
TSA ^[44]	0.244157	6.223066	8.29555	0.244405	2.38241101
RO ^[45]	0.203687	3.528467	9.004233	0.207241	1.735344
IHS ^[46]	0.20573	3.47049	9.03662	0.2057	1.7248
CPSO ^[47]	0.202369	3.544214	9.04821	0.205723	1.73148
MFO ^[48]	0.2057	3.4703	9.0364	0.2057	1.72452
ROA ^[35]	0.200077	3.365754	9.011182	0.206893	1.706447

| Show Table

DownLoad: CSV

5.3. Speed reducer design problem

The design model of the speed reducer is shown in Figure 13. The design of the speed reducer satisfies seven decision variables: the width of the tooth surface x₁, the number of teeth on the gear module x₂, the number of teeth on the pinion x₃, the length of the first shaft x₄ between bearings, the length of the second shaft x₅ between bearings, the diameter of the first shaft x₆ and the diameter of the second shaft x₇. It is a minimum value problem aimed at finding the minimum mass of the speed reducer, with four constraint conditions: the bending stress of the gear teeth, the covering stress, the lateral deflection of the shaft, and the stress inside the shaft.

Figure 13. Speed reducer model.

DownLoad: Full-Size Img PowerPoint

The mathematical formula for the speed reducer design problem is as follows:

Consider:

$x = [{x_1}{\text{ }}{x_2}{\text{ }}{x_3}{\text{ }}{x_4}{\text{ }}{x_5}{\text{ }}{x_6}{\text{ }}{x_7}]$

(49)

Objective function:

$\begin{array}{l} f(\vec x) = 07854 \times {x_1} \times {x_2}^2 \times (3.3333 \times {x_3}^2 + 14.9334 \times {x_3} - \hfill \\ 43.0934) - 1.508 \times {x_1} \times ({x_6}^2 + {x_7}^2) + 7.4777 \times {x_6}^3 + {x_7}^3 + \hfill \\ 0.7854 \times {x_4} \times {x_6}^2 + {x_5} \times {x_7}^2 \hfill \end{array}$

(50)

Subject to:

${g_1}(\vec x) = \frac{{27}}{{{x_1} \times {x_2}^2 \times {x_3}}} - 1 \leqslant 0$

(51)

${g_2}(\vec x) = \frac{{397.5}}{{{x_1} \times {x_2}^2 \times {x_3}^2}} - 1 \leqslant 0$

(52)

${g_3}(\vec x) = \frac{{1.93 \times {x_4}^3}}{{{x_2} \times {x_3} \times {x_6}^4}} - 1 \leqslant 0$

(53)

${g_4}(\vec x) = \frac{{1.93 \times {x_5}^3}}{{{x_2} \times {x_3} \times {x_7}^4}} - 1 \leqslant 0$

(54)

${g_5}(\vec x) = \frac{1}{{110 \times {x_6}^3}} \times \sqrt {{{(\frac{{745 \times {x_4}}}{{{x_2} \times {x_3}}})}^2} + 16.9 \times {{10}^6}} - 1 \leqslant 0$

(55)

${g_6}(\vec x) = \frac{1}{{85 \times {x_7}^3}} \times \sqrt {{{(\frac{{745 \times {x_5}}}{{{x_2} \times {x_3}}})}^2} + 16.9 \times {{10}^6}} - 1 \leqslant 0$

(56)

${g_7}(\vec x) = \frac{{{x_2} \times {x_3}}}{{40}} - 1 \leqslant 0$

(57)

${g_8}(\vec x) = \frac{{5 \times {x_2}}}{{{x_1}}} - 1 \leqslant 0$

(58)

${g_9}(\vec x) = \frac{{{x_1}}}{{12 \times {x_2}}} - 1 \leqslant 0$

(59)

${g_{10}}(\vec x) = \frac{{1.5 \times {x_6} + 1.9}}{{{x_4}}} - 1 \leqslant 0$

(60)

${g_{11}}(\vec x) = \frac{{1.1 \times {x_7} + 1.9}}{{{x_5}}} - 1 \leqslant 0$

(61)

Variable range:

$\begin{array}{l} 2.6 \leqslant {x_1} \leqslant 3.6, 0.7 \leqslant {x_2} \leqslant 0.8, 17 \leqslant {x_3} \leqslant 28, 7.3 \leqslant {x_4} \leqslant 8.3, \hfill \\ 7.3 \leqslant {x_5} \leqslant 8.3, 2.9 \leqslant {x_6} \leqslant 3.9, 5 \leqslant {x_7} \leqslant 5.5 \hfill \end{array}$

(62)

Table 11 presents the test results of the reducer design problem. When x₁ is 3.497599089, x₂ is 0.7, x₃ is 17, x₄ is 7.3, x₅ is 7.8, x₆ is 3.350055813, and x₇ is 5.285531993, the optimal weight obtained by the MPDO algorithm is 2995.437365, which achieves better results compared to other algorithms. Therefore, MPDO is an effective algorithm for solving this problem.

Table 11. Experimental results of the speed reducer design problem.

Algorithm	Optimal Values for Variables							Optimal Weight
Algorithm	x₁	x₂	x₃	x₄	x₅	x₆	x₇	Optimal Weight
MPDO	3.497599	0.7	17	7.3	7.8	3.35005581	5.28553199	2995.4374
hHHO-SCA ^[49]	3.506119	0.7	17	7.3	7.99141	3.452569	5.286749	3029.8731
MSCSO ^[50]	3.497592	0.7	17	7.3	7.8	3.350043	5.285504	2995.438
AOA ^[51]	3.6	0.7	17	7.3	8.3	3.48321691	5.29818568	3089.0737
RSA ^[52]	3.50279	0.7	17	7.3	7.74715	3.35067	5.28675	2996.5157
MDA ^[53]	3.5	0.7	17	7.3	7.67039	3.54242	5.2481	3019.5833

| Show Table

DownLoad: CSV

5.4. Cantilever beam design problem

Cantilever beam design is a minimization problem aimed at reducing the weight of the cantilever beam. The decision variable for this problem includes five hollow block heights with constant thickness. Figure 14 shows the cantilever beam design model.

Figure 14. Cantilever beam model.

DownLoad: Full-Size Img PowerPoint

The mathematical formula for the design problem of cantilever beams is as follows:

Consider:

$x = [{x_1}{\text{ }}{x_2}{\text{ }}{x_3}{\text{ }}{x_4}{\text{ }}{x_5}]$

(63)

Objective function:

$f(x) = 0.0624({x_1} + {x_2} + {x_3} + {x_4} + {x_5})$

(64)

Subject to:

$g(x) = \frac{{61}}{{x_1^3}} + \frac{{37}}{{x_2^3}} + \frac{{19}}{{x_3^3}} + \frac{7}{{x_4^3}} + \frac{1}{{x_5^3}} - 1 \leqslant 0$

(65)

Variable range:

$0.01 \leqslant {x_i} \leqslant 100(i = 1, 2, \cdots 5)$

(66)

According to the cantilever beam model, the height of five hollow blocks with constant thickness continuously decreases. The results of the MPDO algorithm xi (I = 1, 2, ·····, 5) in Table 12 conform to the design of decreasing in sequence, and the optimal weight obtained is 1.340052195, which is an effective solution to this problem.

Table 12. Experimental results of the cantilever beam design problem.

Algorithm	Optimal Values for Variables					Optimum Weight
Algorithm	x₁	x₂	x₃	x₄	x₅	Optimum Weight
MPDO	5.9909046	5.34666433	4.49228394	3.47344894	2.17189358	1.3400522
ERHHO ^[54]	6.0509	5.2639	4.514	3.4605	2.1878	1.3402
BWO ^[55]	6.2094	6.2094	6.2094	6.2094	6.2094	1.9373625
OOA ^[56]	5.0000635	5.00006346	5.00006346	5.00006346	5.00006346	1.5600198
WOA ^[33]	5.1261	5.6188	5.0952	3.9329	2.3219	1.3787315
SCA ^[36]	5.1096	5.9911	5.015	3.7095	3.2744	1.4414387

| Show Table

DownLoad: CSV

5.5. Pressure vessel design problem

The design of pressure vessels minimizes the total cost of cylindrical pressure vessels to satisfy pressure requirements. There are four variables to address this issue: vascular wall thickness T_S, head wall thickness T_h, inner diameter R and body length L, and four constraint conditions. The specific mathematical model of the pressure vessel design problem is shown in Figure 15.

Figure 15. Pressure vessel model.

DownLoad: Full-Size Img PowerPoint

The mathematical formula for pressure vessel design problems is as follows:

Consider:

$\vec x = \left[ {{x_1}{\kern 1pt} {\kern 1pt} {\kern 1pt} {x_2}{\kern 1pt} {\kern 1pt} {\kern 1pt} {x_3}{\kern 1pt} {\kern 1pt} {\kern 1pt} {x_4}} \right] = \left[ {{T_s}{\kern 1pt} {\kern 1pt} {\kern 1pt} {T_h}{\kern 1pt} {\kern 1pt} {\kern 1pt} R{\kern 1pt} {\kern 1pt} {\text{ }}L} \right]$

(67)

Objective function:

$f\left( {\vec x} \right) = 0.6224{x_1}{x_2}{x_3} + 1.7781{x_2}x_3^2 + 3.1661x_1^2{x_4} + 19.84x_1^2{x_3}$

(68)

Subject to:

${g_1}(\overrightarrow x ) = - {x_1} + 0.0193{x_3} \leqslant 0$

(69)

${g_2}(\overrightarrow x ) = - {x_3} + 0.00954{x_3} \leqslant 0$

(70)

${g_3}(\overrightarrow x ) = - \pi x_3^2{x_4} + \frac{4}{3}\pi x_{_3}^3 + 1296000 \leqslant 0$

(71)

${g_4}(\overrightarrow x ) = - {x_4} - 240 \leqslant 0$

(72)

Variable range:

$0 \leqslant {x_1} \leqslant 99, 0 \leqslant {x_2} \leqslant 99, 10 \leqslant {x_3} \leqslant 200, 10 \leqslant {x_4} \leqslant 200$

(73)

The experimental results of pressure vessel design issues are shown in Table 13. The MPDO algorithm yields a T_S of 0.747477958, T_h of 0.37238725, R of 40.56802084, and L of 196.5707208, resulting in a minimum cost of 5744.455052 for pressure vessel design. Five algorithms generated cost values greater than 6000 among the compared algorithms, while six generated cost values less than 6000.

Table 13. Experimental results of the pressure vessel design problem.

Algorithm	T_s	T_h	R	L	Best Cost
MPDO	0.747477958	0.37238725	40.56802084	196.5707208	5744.455052
EROA ^[57]	0.84343	0.400762	44.786	145.9578	5935.7301
HPSO ^[58]	0.8125	0.4375	42.0984	176.6366	6059.7143
AO ^[59]	1.054	0.182806	59.6219	39.805	5949.2258
MSROA ^[29]	0.773374321	0.374874166	41.83662957	180.1871401	5807.849903
MGTOA ^[60]	0.754364	0.366375	40.42809	198.5652	5752.402458
WOA ^[33]	0.8125	0.4375	42.09827	176.639	6059.741
GA ^[20]	0.8125	0.4375	42.0974	176.6541	6059.94634
CS ^[61]	0.8125	0.4375	42.09845	176.6366	6059.714335
SMA ^[62]	0.7931	0.3932	40.6711	196.2178	5994.1857
BA ^[63]	0.8125	0.4375	42.0984	176.6366	6059.7143
ES ^[64]	0.8125	0.4375	42.098087	176.640518	6059.7456

| Show Table

DownLoad: CSV

5.6. Multiple disc clutch brake problem

The main goal of a multi-disc clutch brake is to find the minimum mass of the multi-disc brake. This problem has five decision variables and eight constraint conditions. Five decision variables include inner radius r_i, outer radius r_o, brake disc thickness t, driving force F, and surface friction number Z. Figure 16 shows a specific model of a multi-disc clutch brake.

Figure 16. Multi-disc clutch brake model.

DownLoad: Full-Size Img PowerPoint

The mathematical formula for the multi-disc clutch brake problem is as follows:

Consider:

$x = \left[ {{x_1}{\kern 1pt} {\kern 1pt} {\kern 1pt} {x_2}{\kern 1pt} {\kern 1pt} {\kern 1pt} {x_3}{\kern 1pt} {\kern 1pt} {\kern 1pt} {x_4}{\kern 1pt} {\kern 1pt} {x_5}} \right] = \left[ {{r_i}{\kern 1pt} {\kern 1pt} {\kern 1pt} {r_o}{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} t{\kern 1pt} {\kern 1pt} F{\kern 1pt} {\kern 1pt} Z} \right]$

(74)

Objective function:

$f\left( x \right) = {\rm I}{\rm I}\left( {r_o^2 - r_i^2} \right)t\left( {Z + 1} \right)\rho {\text{ (}}\rho = {\text{0}}{\text{.0000078)}}$

(75)

Subject to:

${g_1}\left( x \right) = {r_o} - {r_i} - \Delta r \geqslant 0$

(76)

${g_2}\left( x \right) = {l_{max}} - \left( {Z + 1} \right)\left( {t + \delta } \right) \geqslant 0$

(77)

${g_3}\left( x \right) = {P_{max}} - {P_{rz}} \geqslant 0$

(78)

${g_4}\left( x \right) = {P_{max}}{\nu _{sr{\kern 1pt} {\kern 1pt} {\kern 1pt} max}} - {P_{rz}}{\upsilon _{sr}} \geqslant 0$

(79)

${g_5}\left( x \right) = {\nu _{sr{\kern 1pt} {\kern 1pt} {\kern 1pt} max}} - {\upsilon _{sr}} \geqslant 0$

(80)

${g_6}\left( x \right) = {T_{max}} - T \geqslant 0$

(81)

${g_7}\left( x \right) = {M_h} - s{M_s} \geqslant 0$

(82)

${g_8}\left( x \right) = T \geqslant 0$

(83)

Variable range:

$\begin{array}{l} 60 \leqslant {x_1} \leqslant 80, 90 \leqslant {x_2} \leqslant 110, 1 \leqslant {x_3} \leqslant 3, \hfill \\ 600 \leqslant {x_4} \leqslant 1000, 2 \leqslant {x_5} \leqslant 9 \hfill \end{array}$

(84)

Other parameters:

${M_h} = \frac{2}{3}\mu FZ\frac{{r_o^3 - r_i^2}}{{r_o^2 - r_i^3}}, {P_{rz}} = \frac{F}{{{\rm I}{\rm I}\left( {r_o^2 - r_i^2} \right)}},$

(85)

${\upsilon _{rz}} = \frac{{2{\rm I}{\rm I}\left( {r_o^3 - r_i^3} \right)}}{{90\left( {r_o^2 - r_i^2} \right)}}, T = \frac{{{I_z}{\rm I}{\rm I}{\kern 1pt} {\kern 1pt} {\kern 1pt} n}}{{30\left( {{M_h} + {M_f}} \right)}}$

(86)

$\Delta r = 20mm, {I_z} = 55kgm{m^2}, {P_{\max }} = 1MPa, {F_{\max }} = 1000N,$

(87)

${T_{\max }} = 15s, \mu = 0.5, s = 1.5, {M_s} = 40Nm, {M_f} = 3Nm,$

(88)

$n = 250rpm, {\upsilon _{sr{\kern 1pt} {\kern 1pt} {\kern 1pt} \max }} = 10{m \mathord{\left/ {\vphantom {m {s, }}} \right. } {s, }}{l_{\max }} = 30mm$

(89)

Table 14 shows the test results of the multi-disc clutch brake problem. The MPDO algorithm obtains an inner radius r_i of 70, an outer radius r_o of 90, a brake disc thickness t of 1, a driving force F of 600, a surface friction number Z of 2, and an optimal weight of 0.235242458, which is the best solution compared to other algorithms.

Table 14. Experimental results of the multiple disc clutch brake problem.

Algorithm	Optimal Values for Variables					Optimum Weight
Algorithm	x₁	x₂	x₃	x₄	x₅	Optimum Weight
MPDO	70	90	1	600	2	0.235242458
WCA ^[65]	70	90	1	910	3	0.313656
CMVO ^[66]	70	90	1	910	3	0.313656
SCA ^[36]	69.516	90	1	1000	2	0.24019
MFO ^[48]	70	90	1	910	3	0.313656
RSA ^[52]	70.0347	90.0349	1	801.7285	2.974	0.31176
OOA ^[56]	60	90	1	600	2	0.330809706

| Show Table

DownLoad: CSV

6. Conclusions and future work

We propose a frequency wave strategy based on prairie dogs' special sound transmission mode. The position of prairie dogs changed by simulating different signals emitted when encountering different food sources and natural enemies. In order to balance the exploration and exploitation of the algorithm, the strong and weak audio signal received by prairie dogs in the foraging stage were used to expand or narrow the scope of searching for food, and the fast and slow audio signal received in the avoiding natural enemies stage were used to avoid or stay from nature enemies. This enables the algorithm to effectively find better optimization value in the later evaluation stage, enhancing the optimization ability of the algorithm. In order to enhance the global exploration ability of the algorithm, a chaotic tent map and lens opposition-based learning strategy are added to the evaluation process of the algorithm.

In order to verify the optimization performance of the MPDO algorithm, 23 benchmark test functions and IEEE CEC2014 test functions were used to evaluate the MPDO algorithm. Experimental data and convergence curves were analyzed by comparing them with seven algorithms. The final results showed that the MPDO algorithm has good optimization performance. In order to verify the practicality of the MPDO algorithm in engineering application problems, six constrained engineering design problems were tested at the end of the article. The comparison results with other algorithms proved that the MPDO algorithm is an effective strategy for solving practical application problems. Structural health monitoring (SHM) has been aiming at improving the damage detection capability of SHM systems, reducing the load of large engineering structure, such as bridges, and improving structures' operation and service life. Therefore, in future work, we hope the MPDO algorithm is applied to the SHM field and achieves good results. In addition, we also hope to apply MPDO to the clustering problem, image segmentation and processing problem, and feature selection problem of machine learning.

Use of AI tools declaration

The authors declare that they have not used Artificial Intelligence (AI) tools in the creation of this article.

Acknowledgments

The authors would like to thank the support of Digital Fujian Research Institute for Industrial Energy Big Data, Fujian Province University Key Lab for Industry Big Data Analysis and Application, Fujian Key Lab of Agriculture IOT Application, IOT Application Engineering Research Center of Fujian Province Colleges and Universities, Sanming City 5G Innovation Laboratory, Fujian University students innovation and entrepreneurship training program (S202311311060), Ministry of Education supply and demand docking employment education project (20230104862), and also the anonymous reviewers and the editor for their careful reviews and constructive suggestions to help us improve the quality of this paper.

Conflict of interest

The authors declare that there is no conflict of interest.

References

[1]	J. Nowaková, M. Pokorný, Intelligent controller design by the artificial intelligence methods, Sensors, 20 (2020), 4454. https://doi.org/10.3390/s20164454 doi: 10.3390/s20164454
[2]	M. Pawlicki, R. Kozik, M. Choras, A survey on neural networks for (cyber-) security and (cyber-) security of neural networks, Neurocomputing, 500 (2022), 1075–1087. https://doi.org/10.1016/j.neucom.2022.06.002 doi: 10.1016/j.neucom.2022.06.002
[3]	H. Xu, M. Guo, N. Nedjah, J. Zhang, P. Li, Vehicle and Pedestrian Detection Algorithm Based on Lightweight YOLOv3-Promote and Semi-Precision Acceleration, IEEE Trans. Intell. Transp. Syst., 23 (2022), 19760–19771. https://doi.org/10.1109/TITS.2021.3137253 doi: 10.1109/TITS.2021.3137253
[4]	B. Furht, A. Escalante, Handbook of Cloud Computing, Springer, 2010. https://doi.org/10.1007/978-1-4419-6524-0
[5]	G. Fenza, V. Loia, G. Nota, Patterns for visual management in industry 4.0, Sensors, 21 (2021), 6440. https://doi.org/10.3390/s21196440 doi: 10.3390/s21196440
[6]	M. Hasal, J. Nowaková, K. A. Saghair, H. M. Dahwa Abdulla, Václav Snásel, Lidia Ogiela, Chatbots: Security, privacy, data protection, and social aspects. Concurr. Comput. Pract. Exp., 33 (2021). https://doi.org/10.1002/cpe.6426
[7]	N. Capuano, G. Fenza, V. Loia, C. Stanzione, Explainable artificial intelligence in cybersecurity: {A} survey. IEEE Access, 10 (2022), 93575–93600. https://doi.org/10.1109/ACCESS.2022.3204171
[8]	M. Choras, M. Wozniak, The double-edged sword of AI: ethical adversarial attacks to counter artificial intelligence for crime, AI Ethics, 3 (2022), 631–634. https://doi.org/10.1007/s43681-021-00113-9
[9]	V. Snásel, J. Nowaková, F. Xhafa, L. Barolli, Geometrical and topological approaches to big data, Future Gener. Comput. Syst., 67 (2017), 286–296. https://doi.org/10.1016/j.future.2016.06.005 doi: 10.1016/j.future.2016.06.005
[10]	H. Hou, J. Yu, R. Hao, Cloud storage auditing with deduplication supporting different security levels according to data popularity, J. Network Comput. Appl., 134 (2019), 26–39. https://doi.org/10.1016/j.jnca.2019.02.015 doi: 10.1016/j.jnca.2019.02.015
[11]	G. Asharov, G. Segev, I. Shahaf, Tight tradeoffs in searchable symmetric encryption, LNCS, Springer, Heidelberg, 2018, 407–436. https://doi.org/10.1007/978-3-319-96884-1_14
[12]	R. Cheng, J. Yan, C. Guan, F. Zhang, K. Ren, Verifiable searchable symmetric encryption from indistinguishability obfuscation. In Feng Bao, Steven Miller, Jianying Zhou, Gail-Joon Ahn, ASIACCS 15, ACM Press, 2015, 621–626. https://doi.org/10.1145/2714576.2714623
[13]	R. Curtmola, J. A. Garay, S. Kamara, R. Ostrovsky, Searchable symmetric encryption: improved definitions and efficient constructions, In Ari Juels, Rebecca N. Wright, Sabrina De Capitani di Vimercati, ACM CCS 06, ACM Press, 2006, 79–88. https://doi.org/10.1145/1180405.1180417
[14]	S. Kamara, C. Papamanthou, T. Roeder, Dynamic searchable symmetric encryption. In Ting Yu, George Danezis, Virgil D. Gligor, ACM CCS 12, ACM Press, October 2012, 965–976. https://doi.org/10.1145/2382196.2382298
[15]	K. Lee, S. G. Choi, D. H. Lee, J. H. Park, M. Yung, Self-updatable encryption: Time constrained access control with hidden attributes and better efficiency, In Kazue Sako, Palash Sarkar, ASIACRYPT 2013, Part I, volume 8269 of LNCS, Springer, Heidelberg, 2013, 235–254. https://doi.org/10.1007/978-3-642-32009-5_13
[16]	A. Sahai, H. Seyalioglu, B. Waters, Dynamic credentials and ciphertext delegation for attribute-based encryption, In Reihaneh Safavi-Naini, Ran Canetti, CRYPTO 2012, volume 7417 of LNCS, Springer, Heidelberg, 2012, 199–217. https://doi.org/10.1007/978-3-642-32009-5_13
[17]	M. Bellare, S. Keelveedhi, T. Ristenpart, Message-locked encryption and secure deduplication, In Thomas Johansson, Phong Q. Nguyen, EUROCRYPT 2013, volume 7881 of LNCS, Springer, Heidelberg, 2013, 296–312. https://doi.org/10.1007/978-3-642-38348-9_18
[18]	M. Bellare, S. Keelveedhi, Interactive message-locked encryption and secure deduplication. In Jonathan Katz, PKC 2015, volume 9020 of LNCS, Springer, Heidelberg, 2015, 516–538. https://doi.org/10.1007/978-3-662-46447-2_23
[19]	G. Ateniese, K. Fu, M. Green, S. Hohenberger, Improved proxy re-encryption schemes with applications to secure distributed storage, In NDSS 2005, The Internet Society, February 2005.
[20]	G. Ateniese, R. C. Burns, R. Curtmola, J. Herring, L. Kissner, Z. N. J. Peterson, et al., Provable data possession at untrusted stores, In Peng Ning, Sabrina De Capitani di Vimercati, Paul F. Syverson, ACM CCS 07, ACM Press, 2007, 598–609. https://doi.org/10.1145/1315245.1315318
[21]	C. C. Erway, A. Kupccu, C. Papamanthou, R. Tamassia, Dynamic provable data possession, In Ehab Al-Shaer, Somesh Jha, Angelos D. Keromytis, ACM CCS 09, ACM Press, 2009, 213–222. https://doi.org/10.1145/1653662.1653688
[22]	A. Juels, B. S. Kaliski Jr., Pors: Proofs of retrievability for large files. In Peng Ning, Sabrina De Capitani di Vimercati, Paul F. Syverson, ACM CCS 07, ACM Press, 2007, 584–597. https://doi.org/10.1145/1315245.1315317
[23]	E. Shi, E. Stefanov, C. Papamanthou, Practical dynamic proofs of retrievability, In Ahmad-Reza Sadeghi, Virgil D. Gligor, Moti Yung, ACM CCS 13, ACM Press, 2013, 325–336. https://doi.org/10.1145/2508859.2516669
[24]	H. Shacham, B. Waters, Compact proofs of retrievability, In Josef Pieprzyk, ASIACRYPT 2008, volume 5350 of LNCS, Springer, Heidelberg, 2008, 90–107. https://doi.org/10.1007/978-3-540-89255-7_7
[25]	Q. Wang, C. Wang, J. Li, K. Ren, W. Lou, Enabling public verifiability and data dynamics for storage security in cloud computing, In ESORICS, volume 5789 of Lecture Notes in Computer Science, Springer, 2009, 355–370. https://doi.org/10.1007/978-3-642-04444-1_22
[26]	Q. Wang, C. Wang, K. Ren, W. Lou, J. Li, Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans. Parallel Distrib. Syst., 22(5): 847–859, 2011. https://doi.org/10.1109/TPDS.2010.183
[27]	Y. Yu, L. Xue, M. H. Au, W. Susilo, J. Ni, Y. Zhang, et al., Cloud data integrity checking with an identity-based auditing mechanism from RSA, Future Generation Comp. Syst., 62 (2016), 85–91. https://doi.org/10.1016/j.future.2016.02.003 doi: 10.1016/j.future.2016.02.003
[28]	Y. Yu, M. H. Au, G. Ateniese, X. Huang, W. Susilo, Y. Dai, et al., Identity-based remote data integrity checking with perfect data privacy preserving for cloud storage, IEEE Trans. Inf. Forens. Secur., 12 (2017), 767–778. 2017. https://doi.org/10.1109/TIFS.2016.2615853
[29]	Y. Yu, Y. Li, B. Yang, W. Susilo, G. Yang, J. Bai, Attribute-based cloud data integrity auditing for secure outsourced storage, IEEE Trans. Emerg. Top. Comput., 8 (2020), 377–390. https://doi.org/10.1109/TETC.2017.2759329
[30]	Y. Huang, Y. Yu, H. Li, Y. Li, A. Tian, Blockchain-based continuous data integrity checking protocol with zero-knowledge privacy protection, Digit. Commun. Networks, 8 (2022), 604–613. https://doi.org/10.1016/j.dcan.2022.04.017 doi: 10.1016/j.dcan.2022.04.017
[31]	J. Zhang, B. Wang, X. A. Wang, H. Wang, S. Xiao, New group user based privacy preserving cloud auditing protocol. Future Gener. Comput. Syst., 106 (2020), 585–594. https://doi.org/10.1016/j.future.2020.01.029
[32]	J. Zhang, B. Wang, M. R. Ogiela, X. A. Wang, A. K. Sangaiah, New public auditing protocol based on homomorphic tags for secure cloud storage, Concurr. Comput. Pract. Exp., 32 (2020). https://doi.org/10.1002/cpe.5600

Reader Comments

Your name:*

Email:*
© 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

Mathematical Biosciences and Engineering

3.9

Metrics

Article views(1613) PDF downloads(78) Cited by(0)

Preview PDF

Download XML

Export Citation

Article outline

Show full outline

Figures and Tables

Figures(5)

Mathematical Biosciences and Engineering

Improved cloud storage auditing scheme with deduplication

Related Papers:

Abstract

1. Introduction

2. PDO

2.1. Population initialization

2.2. Exploration stage

2.3. Exploitation stage

2.4. Implementation of PDO algorithm

3. MPDO

3.1. Frequency wave strategy

3.2. Tent chaotic initialization

3.3. Lens opposition-based learning strategy

3.4. Implementation of the MPDO algorithm

3.5. Time complexity analysis

4. Experimental results and analysis

4.1. 23 benchmark function testing experiments

4.1.1. Statistical analysis of 23 function experimental data and convergence curve

4.1.2. Analysis of Wilcoxon rank sum test results

4.2. IEEE CEC2014 test function experiment

5. Constrained engineering design problems

5.1. Car crash-worthiness design problem

5.2. Welded beam design problem

5.3. Speed reducer design problem

5.4. Cantilever beam design problem

5.5. Pressure vessel design problem

5.6. Multiple disc clutch brake problem

6. Conclusions and future work

Use of AI tools declaration

Acknowledgments

Conflict of interest

References

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Figures and Tables

Other Articles By Authors

Catalog

Mathematical Biosciences and Engineering

Improved cloud storage auditing scheme with deduplication

Related Papers:

Abstract

1. Introduction

2. PDO

2.1. Population initialization

2.2. Exploration stage

2.3. Exploitation stage

2.4. Implementation of PDO algorithm

3. MPDO

3.1. Frequency wave strategy

3.2. Tent chaotic initialization

3.3. Lens opposition-based learning strategy

3.4. Implementation of the MPDO algorithm

3.5. Time complexity analysis

4. Experimental results and analysis

4.1. 23 benchmark function testing experiments

4.1.1. Statistical analysis of 23 function experimental data and convergence curve

4.1.2. Analysis of Wilcoxon rank sum test results

4.2. IEEE CEC2014 test function experiment

5. Constrained engineering design problems

5.1. Car crash-worthiness design problem

5.2. Welded beam design problem

5.3. Speed reducer design problem

5.4. Cantilever beam design problem

5.5. Pressure vessel design problem

5.6. Multiple disc clutch brake problem

6. Conclusions and future work

Use of AI tools declaration

Acknowledgments

Conflict of interest

References

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Figures and Tables

Other Articles By Authors

Related pages

Tools

Export File

Citation

Format

Content

Catalog