Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

A Parallel Branch-and-Bound Method for the Traveling Salesman Problem and Its Implementation on a Network of PCs

  • Shigei, Noritaka (Department of Electrical and Electronics Engineering, Kagoshima University) ;
  • Okumura, Mitsunari (Department of Computer Science, Shimane University) ;
  • Miyajima, Hiromi (Department of Electrical and Electronics Engineering, Kagoshima University)
  • Published : 2002.07.01
Download PDF
⟨ Previous Next ⟩

Abstract

This study presents a parallel branch-and-bound (PBAB) method for traveling salesman problem (TSP). The PBAB method adopts intermediate form of central control and distributed control in terms of the lightness of the master process's role. Compared with fully distributed control, the control scheme involves less concentration of communication on the master. Moreover, in order to reduce the influence of communication, the worker is composed of a computation thread and a communication thread. The multithreadness realizes the almost blocking free communications on the master. We implement the proposed PBAB method on a network of PCs, which consists of one master and up to 16 workers. We experiment five TSP instances. The results shows that the efficiency increases with the problem size.

Keywords