Results 1 to 10 of about 513,907 (192)
Survey of Lévy Flight-Based Metaheuristics for Optimization
Lévy flight is a random walk mechanism which can make large jumps at local locations with a high probability. The probability density distribution of Lévy flight was characterized by sharp peaks, asymmetry, and trailing.
Juan Li +4 more
doaj +1 more source
Modified Levy Flight Optimization for a Maximum Power Point Tracking Algorithm under Partial Shading
This paper presents a novel modified Levy flight optimization for a photovoltaic PV solar energy system. Conventionally, the Perturb and Observe (P&O) algorithm has been widely deployed in most applications due to its simplicity and ease of ...
Chanuri Charin +3 more
doaj +1 more source
The evolutionary maintenance of Lévy flight foraging.
Lévy flight is a type of random walk that characterizes the behaviour of many natural phenomena studied across a multiplicity of academic disciplines; within biology specifically, the behaviour of fish, birds, insects, mollusks, bacteria, plants, slime ...
Winston Campeau +2 more
doaj +1 more source
In this paper, we proposed a tunicate swarm algorithm based on Tent-Lévy flight (TLTSA) to avoid converging prematurely or failing to escape from a local optimal solution.
Yi Cui, Ronghua Shi, Jian Dong
doaj +1 more source
Swarm Crawler Robots Using Lévy Flight for Targets Exploration in Large Environments
This study tackles the task of swarm robotics, where robots explore the environment to detect targets. When a robot detects a target, the robot must be connected with a base station via intermediate relay robots for wireless communication.
Yoshiaki Katada +4 more
doaj +1 more source
A Novel Ant Colony Optimization Algorithm With Levy Flight
Ant Colony Optimization (ACO) is a widely applied meta-heuristic algorithm. Little researches focused on the candidate selection mechanism, which was developed based on the simple uniform distribution.
Yahui Liu, Buyang Cao
doaj +1 more source
Improved Particle Swarm Optimization for Laser Cutting Path Planning
This research focuses on the long empty cutting path problem during the laser cutting process by employing an improved proximity method to establish the starting point set in complex closed graphics.
Pengju Qu, Feilong Du
doaj +1 more source
Improved sine cosine algorithm for large-scale optimization problems
Aiming at the shortcomings of the sine cosine algorithm (SCA) in solving the large-scale optimization problems, such as low accuracy, slow convergence speed, and being easy to fall into the dimension disaster, we propose an sine cosine algorithm with ...
ZHANG Chao, YANG Yi
doaj +1 more source
Multi-Robot Searching Algorithm Using Levy Flight and Artificial Potential Field
An efficient search algorithm is very crucial in robotic area, especially for exploration missions, where the target availability is unknown and the condition of the environment is highly unpredictable. In a very large environment, it is not sufficient to scan an area or volume by a single robot, multiple robots should be involved to perform the ...
Sutantyo D.K. +3 more
openaire +2 more sources
An Improved Flow Direction Algorithm for Engineering Optimization Problems
Flow Direction Algorithm (FDA) has better searching performance than some traditional optimization algorithms. To give the basic Flow Direction Algorithm more effective searching ability and avoid multiple local minima under the searching space, and ...
Yuqi Fan +4 more
doaj +1 more source

