Tabu search algorithm based on insertion method

Proceedings of 2003 International Conference on Neural Networks and Signal Processing, ICNNSP'03

Volumn 1, Issue , 2003, Pages 420-423

  Fang, Yonghui ^a   Liu, Guangyuan ^a   He, Yi ^b   Qiu, Yuhui ^a  

^a SOUTHWEST UNIVERSITY   (China)

^b CHONGQING NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; INSERTION METHODS; LOCAL OPTIMA; NP-HARD PROBLEM; SALESMAN PROBLEM; SEARCH ALGORITHMS; SOLUTION SPACE; TABU SEARCH ALGORITHMS;

COMBINATORIAL OPTIMIZATION; LEARNING ALGORITHMS; NEURAL NETWORKS; SIGNAL PROCESSING;

TABU SEARCH;

EID: 54949122993     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNNSP.2003.1279298     Document Type: Conference Paper

References (9)

1. F. Glover, "Tabu Search: part I", ORSA Jounal on Computing, 1, pp. 190-206, 1989.
2. F. Glover, "Tabu Search: part II", ORSA Journal on Computing, 2, pp.4-32, 1990.
3. Ling Wang, Intelligent Optimization Algorithm with Application, Tinghua publishing company, Beijing, pp.67-68, 2001,
4. D. Rosenkrantz, R. Stearns, and P. Lewis, "An Analysis of Several Heuristics for the Traveling Salesman Problem", SLAM Journal of Computing, 6, pp. 563-581, 1997.
5. V, Bafna, B. Kalyanasundaram, and K. Pruhs, "Not all insertion methods yield constant approximate tours in the Euclidean plane", Theoret. Comput. Sci., 125, pp.345-353, 1994.
6. Y. Azar, "Lower bounds for insertion methods for TSP", Combinatorics, Probability and Computing, 3, pp.285-292, 1994.
7. Gerhard. Reinelt, TSPLIB, http://www.iwr.uni-heidlberg.de/groups/comopt/ software/TSPLIB95/, 2001-02-02.
8. Fan Jin, Junbo Fan, Yongdong Tan, neural network and neural computer theory application, Southwest traffic university publishing company, Chengdu, 1991.
9. Wenxun Xing, Jingxin Xie, Modernistic optimize compute algorithm, Tinghua publishing company, Beijing, pp. 62, 1999.