A parallel adaptive tabu search approach for traveling salesman problems

Proceedings of 2005 IEEE International Conference on Natural Language Processing and Knowledge Engineering, IEEE NLP-KE'05

Volumn 2005, Issue , 2005, Pages 796-801

  He, Yi ^a,b   Qiu, Yuhui ^a   Liu, Guangyuan ^a   Lei, Kaiyou ^b  

^a SOUTHWEST UNIVERSITY   (China)

^b CHONGQING NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DIVERSIFICATION; META-HEURISTIC ALGORITHMS; PARALLEL ADAPTIVE TABU SEARCH; POLYNOMIAL TIME ALGORITHM;

COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

ADAPTIVE ALGORITHMS;

EID: 33847249915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NLPKE.2005.1598845     Document Type: Conference Paper

References (18)

1. Christos H. Papadimitriou, The Euclidean Traveling Salesman Problem is NP-complete, Theoretical Computer Science, 4(3): 237-244, 1977.
2. Moon, Chiung; Kim, Jongsoo; Choi, Gyunghyun; Seo, Yoonho,An efficient genetic algorithm for the traveling salesman problem with precedence constraints, European Journal of Operational Research, 140(3): 606-617, 2002.
3. Renaud, Jacques; Boctor, Fayez F., An efficient composite heuristic for the symmetric generalized traveling salesman problem, European Journal of Operational Research, 108(3): 571-584, 1998.
4. M.Martin-Valdivia, A.Ruiz-Sepulveda, F.Triguero-Ruiz, Improving local minima of Hopfield networks with augmented Lagrange multipliers for large scale TSPs, Neural Networks, 13(10): 283-285,2000.
5. Pedro M.Talavon and Javier Yoñez, Parameter setting of the Hopfield network applied to TSP, Neural Networks, 15(3): 363-373, 2002.
6. Leyuan Shi, Sigurdur Olafsson and Ning Sun, New parallel randomized algorithms for the traveling salesman problem, Computers & Operation Research, 26 (4): 371-394, 1999.
7. Glover F. and Laguna M., Tabu Search, Boston, Kluwer Academic Publishers, 1997.
8. F. Glover, M. Laguna, Tabu search, in: C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1992, pp. 70-150.
9. Cheng-Fa Tsai, Chun-Wei Tsai, A new approach for solving large traveling salesman problem using evolutionary ant rules, Neural Networks, 2002. IJCNN'02. Proceedings of the 2002 International Joint Conference on, Vol.2, pp.1540 - 1545, May, 12-17, 2002.
10. Habib Youssef, Sadiq M. Sait and Hakim Adiche, Evolutionary algorithms, simulated annealing and tabu search: a comparative study, Engineering Applications of Artificial Intelligence,2001, 14(2): 167-181.
11. E.G. Talbi, Z. Hafidi, J-M. Geib, A parallel adaptive tabu search approach, Parallel Computing, 24 (14): 2003-2019, 1998.
12. A.Bortfeldt, H. Gehring, D.Mack, A parallel tabu search algorithm for solving the container loading problem, Parallel Computing, 29 (5):641 -662, 2003.
13. Hiroyuki Mori and Yoshihiro Ogita, A Parallel Tabu Search Based Approach to Optimal Network Reconfigurations for Service Restoration in Distribution Systems, Proceedings of the 2002 IEEE International Conference on Control Applications, Sept.18-20, 2002, pp814-819. Glasgow, Scotland, U.K.
14. A. Augugliaro, L. Dusonchet, E.R. Sanseverino, An Evolutionary Parallel Tabu Search approach for distribution systems reinforcement planning, Advanced Engineering Informatics, 2002, 16(3): 205-215.
15. Claude-Nicolas Fiechter, A parallel tabu search algorithm for large traveling salesman problems, Discrete Applied Mathematics, 1994, 51(3): 243-267.
16. L. Davis, Applying adaptive algorithms to epistatic domains, Proceedings of the 9th international Joint Conference on Artificial Intelligence, pages 162-164, 1985.
17. Gerhard R. TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/ software/TSPLIB95/, 2001.
18. Jeremy Kepner, Parallel Programming with MatlabMPI, http://www.ll.mit. edu/MatlabMPI/.