A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem

A Clustering Scheme Based on the Binary Whale Optimization Algorithm in FANET

With the continuous development of Unmanned Aerial Vehicle (UAV) technology, UAVs are widely used in military and civilian fields. Multi-UAV networks are often referred to as flying ad hoc networks (FANET). Dividing multiple UAVs into clusters for management can reduce energy consumption, maximize network lifetime, and enhance network scalability to a certain extent, so UAV clustering is an important direction for UAV network applications. However, UAVs have the characteristics of limited energy resources and high mobility, which bring challenges to UAV cluster communication networking. Therefore, this paper proposes a clustering scheme for UAV clusters based on the binary whale optimization (BWOA) algorithm. First, the optimal number of clusters in the network is calculated based on the network bandwidth and node coverage constraints. Then, the cluster heads are selected based on the optimal number of clusters using the BWOA algorithm, and the clusters are divided based on the distance. Finally, the cluster maintenance strategy is set to achieve efficient maintenance of clusters. The experimental simulation results show that the scheme has better performance in terms of energy consumption and network lifetime compared with the BPSO and K-means-based schemes.

Modified Whale Optimization Algorithm for Multi-Type Combine Harvesters Scheduling

The optimal scheduling of multi-type combine harvesters is a crucial topic in improving the operating efficiency of combine harvesters. Due to the NP-hard property of this problem, developing appropriate optimization approaches is an intractable task. The multi-type combine harvesters scheduling problem considered in this paper deals with the question of how a given set of harvesting tasks should be assigned to each combine harvester, such that the total cost is comprehensively minimized. In this paper, a novel multi-type combine harvesters scheduling problem is first formulated as a constrained optimization problem. Then, a whale optimization algorithm (WOA) including an opposition-based learning search operator, adaptive convergence factor and heuristic mutation, namely, MWOA, is proposed and evaluated based on benchmark functions and comprehensive computational studies. Finally, the proposed intelligent approach is used to solve the multi-type combine harvesters scheduling problem. The experimental results prove the superiority of the MWOA in terms of solution quality and convergence speed both in the benchmark test and for solving the complex multi-type combine harvester scheduling problem.

Optimal Scheduling of Non-Convex Cogeneration Units Using Exponentially Varying Whale Optimization Algorithm

This paper proposes an Exponentially Varying Whale Optimization Algorithm (EVWOA) to solve the single-objective non-convex Cogeneration Units problem. This problem seeks to evaluate the optimal output of the generator unit to minimize a CHP system’s fuel costs. The nonlinear and non-convex characteristics of the objective function demands a powerful optimization technique. The traditional Whale Optimization Algorithm (WOA) is improved by incorporating four different acceleration functions to fine-tune its performance during exploration and exploitation phases. Among the four variants of the proposed WOA, the emphasis is laid on the EVWOA which uses the exponentially varying acceleration function (EVAF). The proposed EVWOA is tested on six different small-scale to large-scale systems. The results obtained for these six test systems, followed by a statistical study highlight the supremacy of EVWOA for finding the best optimal solution and the convergence traits.

Optimizing the Low-Carbon Flexible Job Shop Scheduling Problem with Discrete Whale Optimization Algorithm

The flexible job shop scheduling problem (FJSP) is a difficult discrete combinatorial optimization problem, which has been widely studied due to its theoretical and practical significance. However, previous researchers mostly emphasized on the production efficiency criteria such as completion time, workload, flow time, etc. Recently, with considerations of sustainable development, low-carbon scheduling problems have received more and more attention. In this paper, a low-carbon FJSP model is proposed to minimize the sum of completion time cost and energy consumption cost in the workshop. A new bio-inspired metaheuristic algorithm called discrete whale optimization algorithm (DWOA) is developed to solve the problem efficiently. In the proposed DWOA, an innovative encoding mechanism is employed to represent two sub-problems: Machine assignment and job sequencing. Then, a hybrid variable neighborhood search method is adapted to generate a high quality and diverse population. According to the discrete characteristics of the problem, the modified updating approaches based on the crossover operator are applied to replace the original updating method in the exploration and exploitation phase. Simultaneously, in order to balance the ability of exploration and exploitation in the process of evolution, six adjustment curves of a are used to adjust the transition between exploration and exploitation of the algorithm. Finally, some well-known benchmark instances are tested to verify the effectiveness of the proposed algorithms for the low-carbon FJSP.

A Systematic and Meta-Analysis Survey of Whale Optimization Algorithm

The whale optimization algorithm (WOA) is a nature-inspired metaheuristic optimization algorithm, which was proposed by Mirjalili and Lewis in 2016. This algorithm has shown its ability to solve many problems. Comprehensive surveys have been conducted about some other nature-inspired algorithms, such as ABC and PSO. Nonetheless, no survey search work has been conducted on WOA. Therefore, in this paper, a systematic and meta-analysis survey of WOA is conducted to help researchers to use it in different areas or hybridize it with other common algorithms. Thus, WOA is presented in depth in terms of algorithmic backgrounds, its characteristics, limitations, modifications, hybridizations, and applications. Next, WOA performances are presented to solve different problems. Then, the statistical results of WOA modifications and hybridizations are established and compared with the most common optimization algorithms and WOA. The survey's results indicate that WOA performs better than other common algorithms in terms of convergence speed and balancing between exploration and exploitation. WOA modifications and hybridizations also perform well compared to WOA. In addition, our investigation paves a way to present a new technique by hybridizing both WOA and BAT algorithms. The BAT algorithm is used for the exploration phase, whereas the WOA algorithm is used for the exploitation phase. Finally, statistical results obtained from WOA-BAT are very competitive and better than WOA in 16 benchmarks functions. WOA-BAT also outperforms well in 13 functions from CEC2005 and 7 functions from CEC2019.

Energy-Efficient Scheduling for a Job Shop Using an Improved Whale Optimization Algorithm

Under the current environmental pressure, many manufacturing enterprises are urged or forced to adopt effective energy-saving measures. However, environmental metrics, such as energy consumption and CO2 emission, are seldom considered in the traditional production scheduling problems. Recently, the energy-related scheduling problem has been paid increasingly more attention by researchers. In this paper, an energy-efficient job shop scheduling problem (EJSP) is investigated with the objective of minimizing the sum of the energy consumption cost and the completion-time cost. As the classical JSP is well known as a non-deterministic polynomial-time hard (NP-hard) problem, an improved whale optimization algorithm (IWOA) is presented to solve the energy-efficient scheduling problem. The improvement is performed using dispatching rules (DR), a nonlinear convergence factor (NCF), and a mutation operation (MO). The DR is used to enhance the initial solution quality and overcome the drawbacks of the random population. The NCF is adopted to balance the abilities of exploration and exploitation of the algorithm. The MO is employed to reduce the possibility of falling into local optimum to avoid the premature convergence. To validate the effectiveness of the proposed algorithm, extensive simulations have been performed in the experiment section. The computational data demonstrate the promising advantages of the proposed IWOA for the energy-efficient job shop scheduling problem.