Whale optimization algorithm, as a relatively novel swarm-based intelligence optimization algorithm, has been extensively utilized in numerous scientific and engineering fields. The intent of this work was to devise a modified WOA based on multi-strategy, named MSWOA, to address somewhat deficiencies of the original WOA, such as converging slowly, stagnating at local minima and poor stability. First, a tent map function is adopted to optimize the distribution of the initial population in problem domain. Second, new iteration-based update strategies of convergence factor and inertia weight are constructed to regulate the balance between global and local search capabilities and improve the optimization ability. Additionally, an optimal feedback strategy is presented in the search for prey stage to enhance the global search ability. Numerical experimental results based on 24 test benchmark functions reveal that the proposed MSWOA significantly improves the standard WOA in terms of solution accuracy and convergence speed, and outperforms the comparison algorithms. Furthermore, the results show that the inertia weight strategy has the greatest effect on the performance of basic WOA performance, followed by the convergence factor, and then the optimal feedback strategy.

As an efficient meta-heuristic algorithm, the whale optimization algorithm (WOA) has been extensively applied to practical problems. However, WOA still has the drawbacks of converging slowly, and jumping out from extreme points especially for large scale optimization problems. To overcome these defects, a modified whale optimization algorithm integrated with a crisscross optimization algorithm (MWOA-CS) is proposed. In MWOA-CS, each dimension of the optimization problem updates its position by randomly performing improved WOA or crisscross optimization algorithm during the entire iterative process. The improved WOA adopts the new nonlinear convergence factor and nonlinear inertia weight to tune the ability of exploitation and exploration. To analyze the performance of MWOA-CS, a series of numerical experiments were performed on 30 test benchmark functions with dimension ranging from 300 to 1000. The experimental results revealed that the presented MWOA-CS provided better convergence speed and accuracy, and meanwhile, displayed a significantly more effective and robust performance than the original WOA and other state of the art meta-heuristic algorithms for solving large scale global optimization problems.

The transportation-based supply chain model can be formulated as the constrained nonlinear programming problems. When solving such problems, the classic optimization algorithms are often limited to local minimums, causing the difficulty to find the global optimal solution. Aiming at this problem, a filled function method with a single parameter is given to cross the local minimum. Based on the characteristics of the filled function, a new filled function algorithm that can obtain the global optimal solution is designed. Numerical experiments verify the feasibility and effectiveness of the algorithm. Finally, the filled function algorithm is applied to the solution of supply chain problems, and the numerical results show that the algorithm can also address decision-making problems of supply chain transportation effectively.

This paper aims to discover a global optima for non-smooth optimal issues by designing a novel filled function, which, regarded as a bridge delivering one minimizer to another minimizer, contains only one parameter for easy adjustment. Theoretically, the natures of the considered filled function are conducted as well as a new algorithm is presented. Finally, certain experimental calculations are presented to illustrate the performance of the constructed algorithm.

This paper introduces a new filled function method based on the dimensionality reduction technique for the global minimization problem. By utilizing the so called α - dense curves, we first transform the original function of n-variables into a single variable function, and then minimize the transformed function with the filled function method. The constructed filled function contains just one parameter which can be adjusted readily during the iterative process. The theoretical properties of the filled function are discussed, and the filled function algorithm is given. At last, a few numerical experiments are included.