A New Tabu Search Approach to the 0–1 Equicut Problem

Given an undirected graph, the 0–1 equicut problem consists of finding a partition of the vertex set into two subsets of equal size, such that the number of edges going from one subset to the other is minimized. A classical heuristics for this problem was presented 25 years ago, whereas simulated annealing, genetic algorithms, tabu search and a greedy randomized procedure have been developed in the last 5 years. In this paper we present a new tabu search algorithm and show, thorough extensive computational experiments, that in most cases it beats the other methods.

[1]  Antonio Sassano,et al.  The equipartition polytope. II: Valid inequalities and facets , 1990, Math. Program..

[2]  Giovanni Rinaldi,et al.  A branch-and-cut algorithm for the equicut problem , 1997, Math. Program..

[3]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[5]  Antonio Sassano,et al.  The equipartition polytope. I: Formulations, dimension and basic facets , 1990, Math. Program..

[6]  Erik Rolland,et al.  New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation , 1994, Comput. Oper. Res..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Fred W. Glover,et al.  Tabu search for graph partitioning , 1996, Ann. Oper. Res..

[11]  Martin Grötschel,et al.  An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..

[12]  Mauro Dell'Amico,et al.  Shop Problems With Two Machines and Time Lags , 1996, Oper. Res..

[13]  Scott Kirkpatrick,et al.  Optimization by simulated annealing: Quantitative studies , 1984 .

[14]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[15]  Erik Rolland,et al.  Heuristic solution Procedures for the Graph Partitioning Problem , 1992, Computer Science and Operations Research.

[16]  I ScottKirkpatrick Optimization by Simulated Annealing: Quantitative Studies , 1984 .

[17]  C. Reeves Modern heuristic techniques for combinatorial problems , 1993 .

[18]  Manuel Laguna,et al.  A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem , 1994, Oper. Res..