An Effective Dynamic Path Planning Approach for Mobile Robots Based on Ant Colony Fusion Dynamic Windows

To further improve the path planning of the mobile robot in complex dynamic environments, this paper proposes an enhanced hybrid algorithm by considering the excellent search capability of the ant colony optimization (ACO) for global paths and the advantages of the dynamic window approach (DWA) for local obstacle avoidance. Firstly, we establish a new dynamic environment model based on the motion characteristics of the obstacles. Secondly, we improve the traditional ACO from the pheromone update and heuristic function and then design a strategy to solve the deadlock problem. Considering the actual path requirements of the robot, a new path smoothing method is present. Finally, the robot modeled by DWA obtains navigation information from the global path, and we enhance its trajectory tracking capability and dynamic obstacle avoidance capability by improving the evaluation function. The simulation and experimental results show that our algorithm improves the robot's navigation capability, search capability, and dynamic obstacle avoidance capability in unknown and complex dynamic environments.

Engineering Design Optimization Using an Advanced Hybrid Algorithm

An advanced hybrid algorithm (haDEPSO) proposed in this paper for engineering design optimization problems. It integrated with suggested advanced differential evolution (aDE) and particle swarm optimization (aPSO). In aDE introduced a novel mutation, crossover and selection strategy, to avoiding premature convergence. And aPSO consists of novel gradually varying parameters, to escape stagnation. So, convergence characteristic of aDE and aPSO provides different approximation to the solution space. Thus, haDEPSO achieve better solutions due to integrating merits of aDE and aPSO. Also, in haDEPSO individual population is merged with other in a pre-defined manner, to balance between global and local search capability. Proposed hybrid haDEPSO as well as its integrating component aDE and aPSO has been applied to five engineering design optimization problems. Numerical, statistical and graphical experiments (best, worst, mean and standard deviation plus convergence analysis) confirm the superiority of the proposed algorithms over many state-of-the-art algorithms.

Engineering Design Optimization Using an Advanced Hybrid Algorithm

An advanced hybrid algorithm (haDEPSO) proposed in this paper for engineering design optimization problems. It integrated with suggested advanced differential evolution (aDE) and particle swarm optimization (aPSO). In aDE introduced a novel mutation, crossover and selection strategy, to avoiding premature convergence. And aPSO consists of novel gradually varying parameters, to escape stagnation. So, convergence characteristic of aDE and aPSO provides different approximation to the solution space. Thus, haDEPSO achieve better solutions due to integrating merits of aDE and aPSO. Also, in haDEPSO individual population is merged with other in a pre-defined manner, to balance between global and local search capability. Proposed hybrid haDEPSO as well as its integrating component aDE and aPSO has been applied to five engineering design optimization problems. Numerical, statistical and graphical experiments (best, worst, mean and standard deviation plus convergence analysis) confirm the superiority of the proposed algorithms over many state-of-the-art algorithms.

A VMD–CISSA–LSSVM Based Electricity Load Forecasting Model

Accurate power load forecasting has an important impact on power systems. In order to improve the load forecasting accuracy, a new load forecasting model, VMD–CISSA–LSSVM, is proposed. The model combines the variational modal decomposition (VMD) data preprocessing method, the sparrow search algorithm (SSA) and the least squares support vector machine (LSSVM) model. A multi-strategy improved chaotic sparrow search algorithm (CISSA) is proposed to address the shortcomings of the SSA algorithm, which is prone to local optima and a slow convergence. The initial population is generated using an improved tent chaotic mapping to enhance the quality of the initial individuals and population diversity. Second, a random following strategy is used to optimize the position update process of the followers in the sparrow search algorithm, balancing the local exploitation performance and global search capability of the algorithm. Finally, the Levy flight strategy is used to expand the search range and local search capability. The results of the benchmark test function show that the CISSA algorithm has a better search accuracy and convergence performance. The volatility of the original load sequence is reduced by using VMD. The optimal parameters of the LSSVM are optimized by the CISSA. The simulation test results demonstrate that the VMD–CISSA–LSSVM model has the highest prediction accuracy and stabler prediction results.

An improved Wolf pack algorithm for optimization problems: Design and evaluation

Wolf Pack Algorithm (WPA) is a swarm intelligence algorithm that simulates the food searching process of wolves. It is widely used in various engineering optimization problems due to its global convergence and computational robustness. However, the algorithm has some weaknesses such as low convergence speed and easily falling into local optimum. To tackle the problems, we introduce an improved approach called OGL-WPA in this work, based on the employments of Opposition-based learning and Genetic algorithm with Levy’s flight. Specifically, in OGL-WPA, the population of wolves is initialized by opposition-based learning to maintain the diversity of the initial population during global search. Meanwhile, the leader wolf is selected by genetic algorithm to avoid falling into local optimum and the round-up behavior is optimized by Levy’s flight to coordinate the global exploration and local development capabilities. We present the detailed design of our algorithm and compare it with some other nature-inspired metaheuristic algorithms using various classical test functions. The experimental results show that the proposed algorithm has better global and local search capability, especially in the presence of multi-peak and high-dimensional functions.

Manta ray foraging and Gaussian mutation-based elephant herding optimization for global optimization

The elephant herding optimization (EHO) algorithm is a novel metaheuristic optimizer inspired by the clan renewal and separation behaviors of elephant populations. Although it has few parameters and is easy to implement, it suffers from a lack of exploitation, leading to slow convergence. This paper proposes an improved EHO algorithm called manta ray foraging and Gaussian mutation-based EHO for global optimization (MGEHO). The clan updating operator in the original EHO algorithm is replaced by the somersault foraging strategy of manta rays, which aims to optimally adjust patriarch positions. Additionally, a dynamic convergence factor is set to balance exploration and exploitation. The gaussian mutation is adopted to enhance the population diversity, enabling MGEHO to maintain a strong local search capability. To evaluate the performances of different algorithms, 33 classical benchmark functions are chosen to verify the superiority of MGEHO. Also, the enhanced paradigm is compared with other advanced metaheuristic algorithms on 32 benchmark functions from IEEE CEC2014 and CEC2017. Furthermore, a scalability test, convergence analysis, statistical analysis, diversity analysis, and running time analysis demonstrate the effectiveness of MGEHO from various aspects. The results illustrate that MGEHO is superior to other algorithms in terms of solution accuracy and stability. Finally, MGEHO is applied to solve three real engineering problems. The comparison results show that this method is a powerful auxiliary tool for handling complex problems.

Innovative search, capability reconfiguration and firm innovation performance in the process of technological leapfrogging

Purpose The purpose of this paper is to investigate three issues: how does an innovative search (local search and boundary-spanning search) impact firm innovation performance of latecomers; how does capability reconfiguration (capability evolution and capability substitution) mediates the relationship between innovative search and firm innovation performance; and how does the technological leapfrogging process (initial stage, following stage, synchronization stage and leading stage) moderate the relationship between capability reconfiguration and firm innovation performance. Design/methodology/approach A “resource-capability-performance” theoretical framework was developed to explore the relationships between local/boundary-spanning search, capability reconfiguration and firm innovation performance. The data were collected by sending out surveys to managers and employees in various industries in mainland China. These hypotheses were tested using structural equation models and hierarchical regressions. Findings The results showed that: innovative search has a direct causal relationship to capability reconfiguration; local search and boundary-spanning search are conducive to improve the innovation performance of latecomers; the impact of local search and boundary-spanning search on innovation performance is realized through the completion of mediating role of capability reconfiguration; there are differences in the path of local search and boundary-spanning search affecting the capability reconfiguration of enterprise innovation performance; and the relationship between innovative search, capability reconfiguration and enterprise innovation performance evolves with the enterprise in different stages of technological leapfrogging. Originality/value This study explores the relationship and the path of innovative search to firm innovation performance and analyzes the path difference between local search and boundary-spinning search, which enriches the research of organizational search and enterprise innovation. This paper reveals the whole path of innovative search affecting innovation performance, discusses the important role of capability reconfiguration and makes incremental contributions to dynamic capability theory. It studies the evolution of innovative search on innovation performance under the background of technological leapfrogging, which provides a new perspective for the study of organizational search and capability-based theory.

Incentive-based demand response in grid-connected microgrid using quasi-opposed grey wolf optimizer

The paradigm shifts in the electrical industry from demand-driven generation to supply-driven generation due to the incorporation of renewable generating sources is a growing research field. Implementing demand response in present-day distribution schemes is anattractive approach often adopted by microgrid (MiG) operator.This paper incorporates an incentivebased demand response (IBDR) method in a grid-connected microgrid (MiG) comprising of conventional generators (CGs), wind turbines (WTs), and solar PV units. The main aim is to collectively minimize the fossil fuel cost of CGs, lower the transaction cost of portable power from the grid, and maximize theMiG operator's profitafter implementing demand response. This multi-objective problem combining optimal economic load dispatch of MiG with an efficient demand-side response is solved using a proposed Quasi-opposed Grey Wolf Optimizer (QOGWO) algorithm. The effect of the proposed algorithm on demand-side management (DSM) is analyzed for two cases, (i) varying the value of power interruptibility (ii) varying the maximum limit of curtained power. Performance of QOGWO is compared with original GWO and a variant of GWO, Intelligent Grey Wolf Optimizer (IGWO). Results show the superior global search capability and complex constrained handling capability of QOGWO.

Multifactorial Particle Swarm Optimization Enhanced by Hybridization With Firefly Algorithm

In recent years, evolutionary multitasking has received attention in the evolutionary computation community. As an evolutionary multifactorial optimization method, multifactorial evolutionary algorithm (MFEA) is proposed to realize evolutionary multitasking. One concept called the skill factor is introduced to assign a preferred task for each individual in MFEA. Then, based on the skill factor, there are some multifactorial optimization solvers including swarm intelligence that have been developed. In this paper, a PSO-FA hybrid model with a model selection mechanism triggered by updating the personal best memory is applied to multifactorial optimization. The skill factor reassignment is introduced in this model to enhance the search capability of the hybrid swarm model. Then numerical experiments are carried out by using nine benchmark problems based on typical multitask situations and by comparing with a simple multifactorial PSO to show the effectiveness of the proposed method.

Improved Salp Swarm Algorithm with Simulated Annealing for Solving Engineering Optimization Problems

Swarm-based algorithm can successfully avoid the local optimal constraints, thus achieving a smooth balance between exploration and exploitation. Salp swarm algorithm(SSA), as a swarm-based algorithm on account of the predation behavior of the salp, can solve complex daily life optimization problems in nature. SSA also has the problems of local stagnation and slow convergence rate. This paper introduces an improved salp swarm algorithm, which improve the SSA by using the chaotic sequence initialization strategy and symmetric adaptive population division. Moreover, a simulated annealing mechanism based on symmetric perturbation is introduced to enhance the local jumping ability of the algorithm. The improved algorithm is referred to SASSA. The CEC standard benchmark functions are used to evaluate the efficiency of the SASSA and the results demonstrate that the SASSA has better global search capability. SASSA is also applied to solve engineering optimization problems. The experimental results demonstrate that the exploratory and exploitative proclivities of the proposed algorithm and its convergence patterns are vividly improved.