id: 05952642
dt: j
an: 05952642
au: Luo, Jianping; Li, Xia
ti: An improved shuffled frog leaping algorithm for solving TSP.
so: J. Shenzhen Univ., Sci. Eng. 27, No. 2, 173-179 (2010).
py: 2010
pu: Shenzhen University, Shenzhen
la: ZH
cc: 
ut: shuffled frog leaping algorithm; extremal optimization; simulated annealing
ci: 
li: 
ab: Summary: A new shuffled frog leaping algorithm (SFLA) is proposed for
    solving the travelling salesman problem (TSP) based on the technique of
    exchanging order. The data structure of moving distance and position of
    frog and the local information exchange strategy for the SFLA are
    redefined. In order to improve the local search ability, the power law
    extremal optimization ($τ$-EO) is incorporated into the SFLA. The
    fitness for the component of a solution is carefully designed.
    Simulated annealing (SA) and the 2-opt move technique are used to
    generate neighboring solutions in the improved $τ$-EO. In the
    shuffling process of the SFLA, a diversity control scheme is presented
    for the local best solution in each ethnic group. Experimental results
    show that the performance of the proposed algorithm to solve TSP is
    satisfactory.
rv: