Dec 15, 2017 · To address TSP effectively, three improvements are proposed in this paper to improve FOA. First, the vision search process is reinforced in the ...
People also ask
What is the improved fruit fly optimization algorithm?
What is the best algorithm for the travelling salesman problem?
How do you optimize traveling salesman problem?
What is the optimal solution for the travelling salesman problem?
A novel strategy is used to enhance the good individuals in the fruit fly population. The proposed algorithm is evaluated on the TSP test problems. The ...
Aiming at solving these shortcomings of standard fruit fly optimization algorithm, such as easily plunging into local optimal and low convergence-rate, mutation ...
... In , an improved FOA was proposed by applying the cat mapping technique. To overcome the slow convergence, sticking in local optima, and lower optimization ...
Abstract: The traveling salesman problem (TSP), a typical non-deterministic polynomial (NP) hard problem, has been used in many engineering applications.
To address TSP effectively, three improvements are proposed in this paper to improve FOA: the vision search process is reinforced in the foraging behavior ...
In this study, a new modified FOA is proposed for solving the well-known traveling salesman problem (TSP) which is one of the most studied discrete optimization ...
This paper improves the fruit fly optimization algorithm (FOA) proposed recently and shows the feasibility and effectiveness of proposed algorithm in ...
Feb 14, 2016 · An improved fruit fly optimization algorithm based on knowledge memory (KM-FOA) is proposed for solving continuous functions problems. It is ...
Feb 16, 2020 · The improved algorithm was proved to have better robustness and intelligence through standard functions and tests for solving 0–1 knapsack ...