An angle-based crossover tabu search for the traveling salesman problem

Proceedings - Third International Conference on Natural Computation, ICNC 2007

Volumn 4, Issue , 2007, Pages 512-516

  Yang, Ning ^a   Li, Ping ^a   Mei, Baisha ^a  

^a SHANGHAI UNIVERSITY OF ELECTRIC POWER   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; HEURISTIC METHODS; LOGIC PROGRAMMING; PROBLEM SOLVING; TABU SEARCH;

DIVERSIFICATIONS STRATEGIES;

TRAVELING SALESMAN PROBLEM;

EID: 38049059849     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2007.176     Document Type: Conference Paper

References (12)

1. Glover F. Heuristic for integer programming using surrogate constraints. Decision Sciences 8:156-66 1977;
2. Glover, F., "Tabu Search Fundamentals and Uses", Graduate School of Business, University of Colorado, Boulder, 1995
3. Y. Peng, B. H. Soong, and L.P. Wang, "Broadcast scheduling in packet radio networks using a mixed tabugreedy algorithm", Electronics Letts., vol.40, no.6, pp.375-376, March, 2004.
4. Huajin Tang; Tan, K.C.; Zhang Yi: A columnar competitive model for solving combinatorial optimization problems. IEEE Trans. Neural Networks 15 (2004) 1568-1574
5. E. L. Lawler, J. K.Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons, New York, 1985
6. LAPORTE G., GENDREAU M., POTVIN JY., SEMETF. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research, 7, pp. 285-300. 2000
7. Michel Gendreau. An Introduction to Tabu Search. Centre de recherche sur les transports and Département d'informatique et de recherche opérationnelle Université de Montréal ase postale 6128, Succursale "Centre-ville" Montréal, Canada H3C 3J7 July 2002
8. Cheng Guoniang, Zhuang Zhenquan. (1999) Theory and Application of the Genetic Algorithm. Posts & Telecom Press, June 1999
9. Wang, Wan-Liang; Yao, Ming-Hai; Wu, Yun-Gao; Wu, Qi-Di .Hybrid flow-shop scheduling approach based on genetic algorithm. Journal of System Simulation, v 14, n 7, p 863, July, 2002.
10. Jacques Renaud and Fayez F. Boctor. A sweep-based algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research. Vol 140 p618-628, 2002
11. G. Reinelt. TSPLIB - A traveling salesman problem library ORSA. Journal on Computing. Vol. 3-4, 376-385. 1991. [See also http://www.iwr.uni-heildelberg.de/groups/comopt/softwar/TSPLIB95/].
12. Fogel DB. Applying Evolutionary Programming to Selected Traveling Salesman Problems, Cybernetics and Systems, Vol. 24, pp. 27-36. 1993.