Research of Improved Whale Optimization Algorithm Based on Variable Convergence Factor and Forced Global Search

電腦學刊 ◽  
2021 ◽  
Vol 32 (5) ◽  
pp. 148-160
Author(s):  
Cheng Zhu Cheng Zhu ◽  
Xu-Hua Pan Cheng Zhu ◽  
Qi Chen Xu-Hua Pan ◽  
Yong Zhang Qi Chen ◽  
Xin-Yi Gao Yong Zhang

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Qian Wang ◽  
Yong Tian ◽  
Lili Lin ◽  
Ratnaji Vanga ◽  
Lina Ma

Standard scheduled flight block time (SBT) setting is of great concern for Civil Aviation Administration of China (CAAC) and airlines in China. However, the standard scheduled flight block times are set in the form of on-site meetings in practice and current literature has not provided any efficient mathematical models to calculate the flight block times fairly among the airlines. The objective of this paper is to develop and solve a mathematical model for standard SBT setting with consideration of both fairness and reliability. We use whale optimization algorithm (WOA) and an improved version of the whale optimization algorithm (IWOA) to solve the SBT setting problem. A novel nonlinear update equation of convergence factor for random iterations is used in place of the original linear one in the proposed IWOA algorithm. Experimental results show that the suggested approach is effective, and IWOA performs better than WOA in the concerned problem, whose solutions are better compared to the flight block times released by CAAC. In particular, it is interesting to find that MSE, RMSE, MAE, MAPE and Theil of the reliability in 60%–70% range are always the smallest and the average fairness of airlines is better than that of 60%–75% range. The model and solving approach presented in this article have great potential to be applied by CAAC to determine the standard SBTs strategically.


2021 ◽  
Author(s):  
Ji Zhang ◽  
Kai Yang ◽  
jiesheng wang

Abstract Whale Optimization Algorithm (WOA) is a swarm intelligence algorithm inspired by whale hunting behavior. Aiming at the defect that the spiral update mechanism in WOA may exceed the search range, three different spiral searching strategies are first proposed. The agents search with a more reasonable and broader route distribution so as to improve population diversity and traversal. Secondly, an improved sine cosine operator based on the convergence factor was proposed to improve the search efficiency of WOA, where sine search is used for global exploration and cosine search is used for local exploitation. The proposed convergence factor enables search agents to adaptively balance the exploration and exploitation phases with iterations. In the simulation experiment, the effectiveness of three spiral search strategies and sine cosine operator is verified. Then, the whale optimization algorithm (WOA), salp swarm algorithm (SSA), firefly algorithm (FA), moth-flame optimization (MFO) algorithm, fireworks algorithm (FWA), sine cosine algorithm (SCA) and improved WOA are selected for comparison experiments. Finally, the improved WOA is applied to two engineering problems (three-bar truss design problem and the welded beam optimization problem). The experimental results show that compared with other optimization algorithms, the improved WOA has the advantages of high search accuracy, fast convergence speed, and avoiding falling into local optimal values.


Author(s):  
Nitin Chouhan ◽  
Uma Rathore Bhatt ◽  
Raksha Upadhyay

: Fiber Wireless Access Network is the blend of passive optical network and wireless access network. This network provides higher capacity, better flexibility, more stability and improved reliability to the users at lower cost. Network component (such as Optical Network Unit (ONU)) placement is one of the major research issues which affects the network design, performance and cost. Considering all these concerns, we implement customized Whale Optimization Algorithm (WOA) for ONU placement. Initially whale optimization algorithm is applied to get optimized position of ONUs, which is followed by reduction of number of ONUs in the network. Reduction of ONUs is done such that with fewer number of ONUs all routers present in the network can communicate. In order to ensure the performance of the network we compute the network parameters such as Packet Delivery Ratio (PDR), Total Time for Delivering the Packets in the Network (TTDPN) and percentage reduction in power consumption for the proposed algorithm. The performance of the proposed work is compared with existing algorithms (deterministic and centrally placed ONUs with predefined hops) and has been analyzed through extensive simulation. The result shows that the proposed algorithm is superior to the other algorithms in terms of minimum required ONUs and reduced power consumption in the network with almost same packet delivery ratio and total time for delivering the packets in the network. Therefore, present work is suitable for developing cost-effective FiWi network with maintained network performance.


Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2628
Author(s):  
Mengxing Huang ◽  
Qianhao Zhai ◽  
Yinjie Chen ◽  
Siling Feng ◽  
Feng Shu

Computation offloading is one of the most important problems in edge computing. Devices can transmit computation tasks to servers to be executed through computation offloading. However, not all the computation tasks can be offloaded to servers with the limitation of network conditions. Therefore, it is very important to decide quickly how many tasks should be executed on servers and how many should be executed locally. Only computation tasks that are properly offloaded can improve the Quality of Service (QoS). Some existing methods only focus on a single objection, and of the others some have high computational complexity. There still have no method that could balance the targets and complexity for universal application. In this study, a Multi-Objective Whale Optimization Algorithm (MOWOA) based on time and energy consumption is proposed to solve the optimal offloading mechanism of computation offloading in mobile edge computing. It is the first time that MOWOA has been applied in this area. For improving the quality of the solution set, crowding degrees are introduced and all solutions are sorted by crowding degrees. Additionally, an improved MOWOA (MOWOA2) by using the gravity reference point method is proposed to obtain better diversity of the solution set. Compared with some typical approaches, such as the Grid-Based Evolutionary Algorithm (GrEA), Cluster-Gradient-based Artificial Immune System Algorithm (CGbAIS), Non-dominated Sorting Genetic Algorithm III (NSGA-III), etc., the MOWOA2 performs better in terms of the quality of the final solutions.


Author(s):  
Chunzhi Wang ◽  
Min Li ◽  
Ruoxi Wang ◽  
Han Yu ◽  
Shuping Wang

AbstractAs an important part of smart city construction, traffic image denoising has been studied widely. Image denoising technique can enhance the performance of segmentation and recognition model and improve the accuracy of segmentation and recognition results. However, due to the different types of noise and the degree of noise pollution, the traditional image denoising methods generally have some problems, such as blurred edges and details, loss of image information. This paper presents an image denoising method based on BP neural network optimized by improved whale optimization algorithm. Firstly, the nonlinear convergence factor and adaptive weight coefficient are introduced into the algorithm to improve the optimization ability and convergence characteristics of the standard whale optimization algorithm. Then, the improved whale optimization algorithm is used to optimize the initial weight and threshold value of BP neural network to overcome the dependence in the construction process, and shorten the training time of the neural network. Finally, the optimized BP neural network is applied to benchmark image denoising and traffic image denoising. The experimental results show that compared with the traditional denoising methods such as Median filtering, Neighborhood average filtering and Wiener filtering, the proposed method has better performance in peak signal-to-noise ratio.


2020 ◽  
pp. 1-12
Author(s):  
Zheping Yan ◽  
Jinzhong Zhang ◽  
Jialing Tang

The accuracy and stability of relative pose estimation of an autonomous underwater vehicle (AUV) and a target depend on whether the characteristics of the underwater image can be accurately and quickly extracted. In this paper, a whale optimization algorithm (WOA) based on lateral inhibition (LI) is proposed to solve the image matching and vision-guided AUV docking problem. The proposed method is named the LI-WOA. The WOA is motivated by the behavior of humpback whales, and it mainly imitates encircling prey, bubble-net attacking and searching for prey to obtain the globally optimal solution in the search space. The WOA not only balances exploration and exploitation but also has a faster convergence speed, higher calculation accuracy and stronger robustness than other approaches. The lateral inhibition mechanism can effectively perform image enhancement and image edge extraction to improve the accuracy and stability of image matching. The LI-WOA combines the optimization efficiency of the WOA and the matching accuracy of the LI mechanism to improve convergence accuracy and the correct matching rate. To verify its effectiveness and feasibility, the WOA is compared with other algorithms by maximizing the similarity between the original image and the template image. The experimental results show that the LI-WOA has a better average value, a higher correct rate, less execution time and stronger robustness than other algorithms. The LI-WOA is an effective and stable method for solving the image matching and vision-guided AUV docking problem.


Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 48
Author(s):  
Jin Zhang ◽  
Li Hong ◽  
Qing Liu

The whale optimization algorithm is a new type of swarm intelligence bionic optimization algorithm, which has achieved good optimization results in solving continuous optimization problems. However, it has less application in discrete optimization problems. A variable neighborhood discrete whale optimization algorithm for the traveling salesman problem (TSP) is studied in this paper. The discrete code is designed first, and then the adaptive weight, Gaussian disturbance, and variable neighborhood search strategy are introduced, so that the population diversity and the global search ability of the algorithm are improved. The proposed algorithm is tested by 12 classic problems of the Traveling Salesman Problem Library (TSPLIB). Experiment results show that the proposed algorithm has better optimization performance and higher efficiency compared with other popular algorithms and relevant literature.


Sign in / Sign up

Export Citation Format

Share Document