Integrating Grasshopper Optimization Algorithm with Local Search for Solving Data Clustering Problems

2021 ◽  
Vol 14 (1) ◽  
pp. 783
Author(s):  
M. A. El-Shorbagy ◽  
A. Y. Ayoub
Keyword(s):  
Local Search ◽  
Optimization Algorithm ◽  
Data Clustering ◽  
Grasshopper Optimization Algorithm ◽  
Grasshopper Optimization ◽  
Clustering Problems

scholarly journals A Hybrid Grasshopper Optimization Algorithm Applied to the Open Vehicle Routing Problem

Algorithms ◽  
2020 ◽  
Vol 13 (4) ◽  
pp. 96
Author(s):  
Valeria Soto-Mendoza ◽  
Irma García-Calvillo ◽  
Efraín Ruiz-y-Ruiz ◽  
Jaime Pérez-Terrazas
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Optimization Algorithm ◽  
Vehicle Routing Problem ◽  
Benchmark Problems ◽  
Routing Problem ◽  
Total Distance ◽  
Grasshopper Optimization Algorithm ◽  
Grasshopper Optimization ◽  
Open Vehicle Routing

This paper presents a hybrid grasshopper optimization algorithm using a novel decoder and local search to solve instances of the open vehicle routing problem with capacity and distance constraints. The algorithm’s decoder first defines the number of vehicles to be used and then it partitions the clients, assigning them to the available routes. The algorithm performs a local search in three neighborhoods after decoding. When a new best solution is found, every route is locally optimized by solving a traveling salesman problem, considering the depot and clients in the route. Three sets containing a total of 30 benchmark problems from the literature were used to test the algorithm. The experiments considered two cases of the problem. In the first, the primary objective is to minimize the total number of vehicles and then the total distance to be traveled. In the second case, the total distance traveled by the vehicles is minimized. The obtained results showed the algorithm’s proficient performance. For the first case, the algorithm was able to improve or match the best-known solutions for 21 of the 30 benchmark problems. For the second case, the best-known solutions for 18 of the 30 benchmark problems were found or improved by the algorithm. Finally, a case study from a real-life problem is included.

Robust design of a robot gripper mechanism using new hybrid grasshopper optimization algorithm

2021 ◽  
Author(s):  
Betül Sultan Yildiz ◽  
Nantiwat Pholdee ◽  
Sujin Bureerat ◽  
Ali Riza Yildiz ◽  
Sadiq M. Sait
Keyword(s):  
Robust Design ◽  
Optimization Algorithm ◽  
Robot Gripper ◽  
Grasshopper Optimization Algorithm ◽  
Grasshopper Optimization

An Image Segmentation Method Based on Two-Dimensional Entropy and Chaotic Lightning Attachment Procedure Optimization Algorithm

2020 ◽  
Vol 34 (11) ◽  
pp. 2054030 ◽  
Author(s):  
Wei Liu ◽  
Shuai Yang ◽  
Zhiwei Ye ◽  
Qian Huang ◽  
Yongkun Huang
Keyword(s):  
Image Segmentation ◽  
Maximum Entropy ◽  
Optimization Algorithm ◽  
Search Algorithm ◽  
Computational Time ◽  
Two Dimensional ◽  
Threshold Segmentation ◽  
Grasshopper Optimization Algorithm ◽  
Grasshopper Optimization ◽  
Competitive Algorithms

Threshold segmentation has been widely used in recent years due to its simplicity and efficiency. The method of segmenting images by the two-dimensional maximum entropy is a species of the useful technique of threshold segmentation. However, the efficiency and stability of this technique are still not ideal and the traditional search algorithm cannot meet the needs of engineering problems. To mitigate the above problem, swarm intelligent optimization algorithms have been employed in this field for searching the optimal threshold vector. An effective technique of lightning attachment procedure optimization (LAPO) algorithm based on a two-dimensional maximum entropy criterion is offered in this paper, and besides, a chaotic strategy is embedded into LAPO to develop a new algorithm named CLAPO. In order to confirm the benefits of the method proposed in this paper, the other seven kinds of competitive algorithms, such as Ant–lion Optimizer (ALO) and Grasshopper Optimization Algorithm (GOA), are compared. Experiments are conducted on four different kinds of images and the simulation results are presented in several indexes (such as computational time, maximum fitness, average fitness, variance of fitness and other indexes) at different threshold levels for each test image. By scrutinizing the results of the experiment, the superiority of the introduced method is demonstrated, which can meet the needs of image segmentation excellently.

Sign in / Sign up

Export Citation Format

Share Document