Browse > Article

A Distributed Nearest Neighbor Heuristic with Bounding Function  

Kim, Jung-Sook (Dept.of Computer, Kimpo College)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.29, no.7, 2002 , pp. 377-383 More about this Journal
Abstract
The TSP(Traveling Salesman Problem) has been known as NP-complete, there have been various studies to find the near optimal solution. The nearest neighbor heuristic is more simple than the other algorithms which are to find the optimal solution. This paper designs and implements a new distributed nearest neighbor heuristic with bounding function for the TSP using the master/slave model of PVM(Parallel Virtual Machine). Distributed genetic algorithm obtains a near optimal solution and distributed nearest neighbor heuristic finds an optimal solution for the TSP using the near optimal value obtained by distributed genetic algorithm as the initial bounding value. Especially, we get more speedup using a new genetic operator in the genetic algorithm.
Keywords
PVM; bounding function; distributed nearest neighbor heuristic; traveling salesman problem; NP-complete; PVM; genetic algorithm; mutation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-verlag, pp. 209-237, 1995
2 G. Reinelt, The Traveling Salesman Computational Solutions for TSP Applications, Springer-Verlag, 1994
3 E. Horowitz, S. Sahni, Computer Algorithms, Computer Science, pp. 370-421, 1978
4 T.C. Sapountzis, 'The Traveling Salesman Problem,' IEEE Computing Futures, pp. 60-64, Spring, 1991
5 M. Gen, R. Cheng, Genetic Algorithms and Engineering Design, pp. 118-132, 1997
6 TSPLIB, http://www.iwr.uni-heidelberg.de/iwr/comopt/ soft/TSPLIB95/ATSPhtml
7 J. Kim, Y. Hong, 'A Distributed Hybrid Algorithm for the Traveling Salesman Problem,' IASTED, AI'99, Feb. 1999
8 A. Geist, A. Beguelin, J. Dongarra, W. Jiang, H. Manchek, V. Sunderam, 'PVM : Parallel Virtual Machine, A User's Guide and Tutorial for Networked Parallel Computing,' The MIT Press, 1992
9 D. E. Goldberg, Genetic Algorithms : in Search and Optimization, Addison-Wesley, pp. 1-125, 1989
10 C. Cotta, J.F. Aldana, A.J. Nebro, J.M. Troya, 'Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP,' Springer-Verlag, Artificial Neural Nets and genetic Algorithms, pp. 277-279, 1995