An Improve Firefly Algorithm and its Application

2013 ◽  
Vol 404 ◽  
pp. 533-537
Author(s):  
Ping Liu ◽  
Yue Guang Li
Keyword(s):  
Multiple Solutions ◽  
Firefly Algorithm ◽  
Traveling Salesman ◽  
Experimental Results ◽  
Experimental Result ◽  
Traveling Salesman Problems

In this paper, according to the characteristics of TSP. A Novel Firefly Algorithm was used to solve the TSP, the algorithm was experimented and the experimental results show that the new algorithm to be successful in locating multiple solutions and better accuracy. The experimental result demonstrates that the Improve firefly algorithm can get better solutions to some Traveling Salesman Problems (TSP) than the solutions given in TSPLIB.

An Improve Cuckoo Search Algorithm for Traveling Salesman Problems

2014 ◽  
Vol 651-653 ◽  
pp. 2291-2295
Author(s):  
Suo Nan Lengzhi ◽  
Yue Guang Li
Keyword(s):  
Multiple Solutions ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Traveling Salesman ◽  
Experimental Results ◽  
Traveling Salesman Problems ◽  
Position Value ◽  
Benchmark Instances ◽  
Simulation Results

In this paper, according to the characteristics of TSP. An improve Cuckoo Search Algorithm was used to solve the TSP, adopting the code rule of randomized key representation based on the smallest position value. The experimental results show that the new algorithm is successful in locating multiple solutions and has better accuracy, simulation results of benchmark instances validate the efficiency and superiority of Cuckoo Search Algorithm.

An Improve Firefly Algorithm and its Application in Nonlinear Equation Groups

2014 ◽  
Vol 1049-1050 ◽  
pp. 1670-1674
Author(s):  
Yan Feng Zhang ◽  
Yue Guang Li
Keyword(s):  
Nonlinear Equation ◽  
Nonlinear Equations ◽  
Multiple Solutions ◽  
Firefly Algorithm ◽  
Experimental Results ◽  
Experimental Result

In this paper, according to the characteristics of nonlinear equations. A Novel Firefly Algorithm was used to solve the nonlinear equations problem, the algorithm was experimented and the experimental results show that the new algorithm to be successful in locating multiple solutions and better accuracy. The experimental result demonstrates that the Improve firefly algorithm can get better solutions to nonlinear equations.

An Improve Firefly Algorithm and its Application in Permutation Flow Shop Scheduling Problem

2014 ◽  
Vol 651-653 ◽  
pp. 2125-2129
Author(s):  
Fu Lin Su ◽  
Yue Guang Li
Keyword(s):  
Multiple Solutions ◽  
Firefly Algorithm ◽  
Flow Shop ◽  
Experimental Results ◽  
Flow Shop Scheduling ◽  
Experimental Result ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop

In this paper, according to the characteristics of permutation flow shop scheduling problem. A Novel Firefly Algorithm was used to solve the permutation flow shop scheduling problem, the algorithm was experimented and the experimental results show that the new algorithm to be successful in locating multiple solutions and better accuracy. The experimental result demonstrates that the Improve firefly algorithm can get better solutions to permutation flow shop scheduling problem.

A Novel Firefly Algorithm of Solving Nonlinear Equation Group

2013 ◽  
Vol 389 ◽  
pp. 918-923 ◽  
Author(s):  
Cai Rang Zhaxi ◽  
Yue Guang Li
Keyword(s):  
Nonlinear Equation ◽  
Nonlinear Equations ◽  
Multiple Solutions ◽  
Firefly Algorithm ◽  
Discrete Space ◽  
Experimental Results ◽  
Systems Of Nonlinear Equations ◽  
The Novel ◽  
Continuous Space ◽  
Equation Group

In this paper, according to the characteristics of nonlinear equations. A Novel Firefly Algorithm was used to solve the systems of nonlinear equations, the algorithm was experimented and the experimental results show that the new algorithm to be successful in locating multiple solutions and better accuracy. Simulations and results indicate that the novel firefly algorithm has better feasibility and validity for continuous space optimization and discrete space optimization.

K-means Clustering Algorithm and Meta-heuristics for Multiple Traveling Salesman Problems

2009 ◽  
Vol 4 (2) ◽  
pp. 16-32
Author(s):  
R. Nallusamy ◽  
K. Duraiswamy ◽  
R. Dhanalaksmi ◽  
P. Parthiban
Keyword(s):  
Clustering Algorithm ◽  
Traveling Salesman ◽  
Traveling Salesman Problems

scholarly journals The Estimation of Angular Misalignments for Ultra Short Baseline Navigation Systems. Part II: Experimental Results

2013 ◽  
Vol 66 (5) ◽  
pp. 773-787 ◽  
Author(s):  
Hsin-Hung Chen
Keyword(s):  
Trial Data ◽  
Experimental Results ◽  
Experimental Result ◽  
Alignment Error ◽  
Navigation Systems ◽  
Analytical Prediction ◽  
Short Baseline ◽  
Sea Trial ◽  
Alignment Errors ◽  
Cross Track

An algorithm of alignment calibration for Ultra Short Baseline (USBL) navigation systems was presented in the companion work (Part I). In this part (Part II) of the paper, this algorithm is tested on the sea trial data collected from USBL line surveys. In particular, the solutions to two practical problems referred to as heading deviation and cross-track error in the USBL line survey are presented. A field experiment running eight line surveys was conducted to collect USBL positioning data. The numerical results for the sea trial data demonstrated that the proposed algorithm could robustly and effectively estimate the alignment errors. Comparisons of the experimental result with the analytical prediction of roll misalignment estimation in Part I is drawn, showing good agreement. The experimental results also show that an inappropriate estimation of roll alignment error will significantly degrade the quality of estimations of heading and pitch alignment errors.

Sign in / Sign up

Export Citation Format

Share Document