A Solution for TSP Based on Artificial Fish Algorithm
暂无分享,去创建一个
[1] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[2] Luca Maria Gambardella,et al. A Study of Some Properties of Ant-Q , 1996, PPSN.
[3] Abraham P. Punnen,et al. Approximate local search in combinatorial optimization , 2004, SODA '04.
[4] John E. Mitchell,et al. Polynomial Interior Point Cutting Plane Methods , 2003, Optim. Methods Softw..
[5] Zbigniew Michalewicz,et al. Inver-over Operator for the TSP , 1998, PPSN.
[6] Manfred W. Padberg,et al. Classical Cuts for Mixed-Integer Programming and Branch-and-Cut , 2005, Ann. Oper. Res..
[7] Russell C. Eberhart,et al. A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.
[8] Weixiong Zhang,et al. Cut-and-solve: An iterative search strategy for combinatorial optimization problems , 2006, Artif. Intell..
[9] Cheng-Fa Tsai,et al. A new hybrid heuristic approach for solving large traveling salesman problem , 2004, Inf. Sci..
[10] John E. Hunt,et al. Learning using an artificial immune system , 1996 .
[11] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.