The simulation results indicate that IWPA has specific advantages over similar algorithms regarding feasibility, convergence, and stability. Keywords. Improved ...
This proposal is based on a basic WPA concept. In this algorithm, it retains the division-work cooperative search characteristics of WPA, adds negative feedback ...
Aug 26, 2021 · 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.
People also ask
Which algorithm is best for travelling salesman problems?
What is the wolf pack algorithm?
What is the brute force algorithm for solving the traveling salesman problem?
What is the answer to the traveling salesman problem?
Based on designing of reverse operator integer coding, the artificial wolves' position and intelligent behaviors are redesigned.
Experimental results show that the I-GWO algorithm competes with established optimal methods for solving the TSP, suggesting its potential for different TSP.
... Traveling Salesman Problem (TSP). By comparing WPS-MBO with original MBO and Genetic Algorithm, the results show that WPS-MBO has better convergence performance ...
The classical GWO is redesigned in this paper by incorporating the swap, shift and symmetry transformation operators to solve permutation-coded travelling ...
2017. TLDR. The results show that use improved wolf pack algorithm to solve vehicle routing problem with multiple fuzzy time windows has the advantages of ...
Aug 26, 2021 · It is widely used in various engineering optimization problems due to its global convergence and computational robustness.
Missing: Solving Traveling Salesman
This paper presents a novel discrete GWO algorithm (D-GWO) to solve complex discrete travelling salesman problem (TSP).