Search

Supply Chain Management (SCM) applications represent real-world optimization tasks that require handling using appropriate optimization techniques. Metaheuristic algorithms are powerful optimization tools that are effective for solving complex optimization problems such as SCM. In this article, a new metaheuristic algorithm named Potter Optimization Algorithm (POA) is introduced to deal with optimization problems, especially in SCM applications. POA is mathematically modelled by the inspiration of the human process of pottery in two phases of exploration and exploitation. The exploration phase is designed based on mathematical modeling of making extensive changes to the clay (or other pottery materials) according to the given pattern. The exploitation phase is designed based on mathematical modelling of making precise and limited changes on the made pottery with the aim of creating more similarity to the given pattern. The effectiveness of the proposed POA approach to address real-world applications in SCM has been evaluated on sustainable lot size optimization. The optimization results show that POA has been able to provide effective solutions for sustainable lot size optimization case studies by managing exploration, exploitation, and balancing them during the search process at both global and local levels. In addition, the results obtained from the implementation of POA have been compared with the performance of twelve well-known metaheuristic algorithms. The analysis of the optimization results shows that POA has 100% superior performance compared to competing algorithms by providing better results in all ten case studies. [ABSTRACT FROM AUTHOR]

The parameters of a Photovoltaic (PV) model are pivotal in gauging its efficiency under varying sunlight irradiances, temperatures, and different load scenarios. Determining these PV model parameters poses a complex non-linear optimization challenge. This study is based on a new metaheuristic optimization algorithm called the Pelican Optimization Algorithm (POA) to discern the unknown parameters of the PV model. The suggested POA algorithm underwent testing using a monocrystalline panel, encompassing its single-diode configuration. The objective function is designed to minimize the root of the mean squared errors between the predicted and actual current values, adhering to specific parameter constraints. Various statistical error metrics were utilized to emphasize the performance of the proposed algorithm. A comparative analysis with other well-established algorithms was conducted, indicating that POA stands out as highly competitive since it showcases superior efficiency in parameter identification compared to its counterparts. [ABSTRACT FROM AUTHOR]

A new bio-inspired metaheuristic algorithm named the Pufferfish Optimization Algorithm (POA), that imitates the natural behavior of pufferfish in nature, is introduced in this paper. The fundamental inspiration of POA is adapted from the defense mechanism of pufferfish against predators. In this defense mechanism, by filling its elastic stomach with water, the pufferfish becomes a spherical ball with pointed spines, and as a result, the hungry predator escapes from this threat. The POA theory is stated and then mathematically modeled in two phases: (i) exploration based on the simulation of a predator's attack on a pufferfish and (ii) exploitation based on the simulation of a predator's escape from spiny spherical pufferfish. The performance of POA is evaluated in handling the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that POA has achieved an effective solution with the appropriate ability in exploration, exploitation, and the balance between them during the search process. The quality of POA in the optimization process is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that POA provides superior performance by achieving better results in most of the benchmark functions in order to solve the CEC 2017 test suite compared to competitor algorithms. Also, the effectiveness of POA to handle optimization tasks in real-world applications is evaluated on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems. Simulation results show that POA provides effective performance in handling real-world applications by achieving better solutions compared to competitor algorithms. [ABSTRACT FROM AUTHOR]

The Pelican Optimization Algorithm (POA) is a meta-heuristic algorithm that emulates the behavior and hunting strategy of pelicans. This paper presents three modifications that enhance the algorithmic traversal of POA by incorporating ten chaotic mapping factors. These modifications aim to improve the efficiency and accuracy of the traversal process. Firstly, the pelican optimization algorithm with chaotic mapping factors added to population generation but random prey generation (COPOA); secondly, the pelican optimization algorithm with chaotic mapping factors applied to prey generation but random population generation (OCPOA); finally, the pelican optimization algorithm with the same chaotic mapping factor, different sequences generated by different random initial values are mapped to the population and prey generation (CCPOA). The results of simulations on 12 benchmark test functions demonstrate that the algorithm (COPOA) adding the chaotic mapping factor to the population generation alone has higher generalizability, convergence speed and finding accuracy compared with the standard POA algorithm. Among these modifications, the Sine-COPOA method performed the best in ten chaotic mapping factor comparison tests. Furthermore, a comparison is made between the Sine-COPOA and typical intelligent optimization algorithms to assess its competence in optimization. The results show that Sine-COPOA performs better in most of the 12 benchmark test functions. Finally, the engineering design problems (pressure vessel problem and 10-bar truss design) are optimized. The experimental results demonstrate that Sine-COPOA effectively solves both function optimization and engineering optimization problems. [ABSTRACT FROM AUTHOR]

This work offers a new stochastic optimization i.e., a metaheuristic algorithm combining both direction-based search and neighbourhood search called as walk-spread algorithm (WSA). These two types of searches become the inspiration for its name where the term walk represents the direction-based search while the term spread represents the neighbourhood search. There are two direction-based searches performed in every iteration where each search produces a single child. Meanwhile, there are two neighbourhood searches performed in every iteration where each search produces several children. The global best unit becomes the first reference while two shuffled units become the second reference in performing the direction-based search. Meanwhile, the local search space of the first neighbourhood search is wide while the second one is narrow. The 23 classic functions are chosen as the assessment of WSA where WSA is confronted with the five latest metaheuristics: mixed leader-based optimization (MLBO), golden search optimization (GSO), pelican optimization algorithm (POA), zebra optimization algorithm (ZOA), and attack-leave optimization (ALO). The assessment result shows that the offered WSA achieves the acceptable result so fast. Moreover, WSA is also superior to these five confronters by outperforming MLBO, GSO, POA, ZOA, and ALO in 23, 23, 22, 21, and 21 functions respectively. [ABSTRACT FROM AUTHOR]

A new swarm intelligence-based metaheuristic optimizer, namely Partial Leader Optimizer (PLO), is presented. PLO contains several autonomous agents that represent the solution. The best solution represents collective intelligence, i.e., the leader. PLO has distinct mechanics in finding the acceptable solution during the given iteration. Every agent moves to a specified target in every iteration. Two options can be chosen to determine the target. First, the target is calculated by pushing the virtual best solution away from the corresponding agent. Second, the target is randomly chosen within the solution space. This target selection is conducted stochastically based on the threshold that is set manually before the iteration. Then, several candidates are generated between the target and the agent's current location. The distance between adjacent candidates is the same. The agent moves to the best candidate and updates the best solution. Simulation is implemented to observe and analyze the PLO's performance. The well-known 23 benchmark functions are used as the optimization problems. In this simulation, PLO is benchmarked with marine predator algorithm (MPA), particle swarm optimization (PSO), average subtraction-based optimizer (ASBO), slime mold algorithm (SMA), and pelican optimization algorithm (POA). The result shows that PLO is competitive compared to these algorithms, especially in solving fixeddimension multimodal functions. PLO is better than PSO, MPA, SMA, ASBO, and POA in optimizing 22, 19, 18, 9, and 20 functions out of 23, respectively. [ABSTRACT FROM AUTHOR]

Optimization is an important and fundamental challenge to solve optimization problems in different scientific disciplines. In this paper, a new stochastic nature-inspired optimization algorithm called Pelican Optimization Algorithm (POA) is introduced. The main idea in designing the proposed POA is simulation of the natural behavior of pelicans during hunting. In POA, search agents are pelicans that search for food sources. The mathematical model of the POA is presented for use in solving optimization issues. The performance of POA is evaluated on twenty-three objective functions of different unimodal and multimodal types. The optimization results of unimodal functions show the high exploitation ability of POA to approach the optimal solution while the optimization results of multimodal functions indicate the high ability of POA exploration to find the main optimal area of the search space. Moreover, four engineering design issues are employed for estimating the efficacy of the POA in optimizing real-world applications. The findings of POA are compared with eight well-known metaheuristic algorithms to assess its competence in optimization. The simulation results and their analysis show that POA has a better and more competitive performance via striking a proportional balance between exploration and exploitation compared to eight competitor algorithms in providing optimal solutions for optimization problems. [ABSTRACT FROM AUTHOR]