Since the 1970s, with the in-depth study of graph partitioning, we have found that, graph partitioning, both in the fields of academic researches and engineering applications, has its own important applications, such as the layout of the fiber-optic network in telecommunication network. Therefore, the graph partitioning problem has been widespread concerning and largely studied by the scholars at home and abroad. Tabu search, as one of the modern optimization algorithm, has been playing an invaluable effect in many fields. And by now, both graph partitioning and tabu search have been developed to a certain extent, but few people consider the integration of the two problems, coordinate optimization, so as to achieve better results. Therefore, this paper proposes a graph partitioning method based on coordination and optimization of constructive graph partitioning algorithm and tabu search algorithm and obtains a graph partitioning algorithms of good efficiency and quality. In the experimental part of the paper, optical distribution network partitioning problem is transformed into a graph partitioning model. Experimental results show that the efficiency and quality of the partitioning method are acceptable in optical distribution network division.
An Application of Tabu Search to the Graph Partitioning Problem and its Experimental Analysis
