Advanced Scatter Search for the Max-Cut Problem

The max-cut problem consists of finding a partition of the nodes of a weighted graph into two subsets such that the sum of the weights on the arcs connecting the two subsets is maximized. This is an NP-hard problem that can also be formulated as an integer quadratic program. Several solution methods have been developed since the 1970s and applied to a variety of fields, particularly in engineering and layout design. We propose a heuristic method based on the scatter-search methodology for finding approximate solutions to this optimization problem. Our solution procedure incorporates some innovative features within the scatter-search framework: (1) the solution of the maximum diversity problem to increase diversity in the reference set, (2) a dynamic adjustment of a key parameter within the search, and (3) the adaptive selection of a combination method. We perform extensive computational experiments to first study the effect of changes in critical scatter-search elements and then to compare the efficiency of our proposal with previous solution procedures.

[1]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[2]  Hanno Lefmann,et al.  A Combinatorial Design Approach to MAXCUT , 1996, STACS.

[3]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[4]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[5]  Panos M. Pardalos,et al.  Randomized heuristics for the Max-Cut problem , 2002, Optim. Methods Softw..

[6]  Marcus Peinado,et al.  Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut , 1997, J. Parallel Distributed Comput..

[7]  Fred W. Glover,et al.  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..

[8]  Abraham Duarte,et al.  Tabu search and GRASP for the maximum diversity problem , 2007, Eur. J. Oper. Res..

[9]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[10]  John E. Mitchell,et al.  A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem , 2006, Comput. Optim. Appl..

[11]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[12]  Yin Zhang,et al.  Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs , 2002, SIAM J. Optim..

[13]  David Hung-Chang Du,et al.  Efficient Algorithms for Layer Assignment Problem , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[15]  S. Poljak,et al.  A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem , 1982, Canadian Journal of Mathematics.

[16]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[17]  Shankar M. Venkatesan,et al.  Approximation and Intractability Results for the Maximum Cut Problem and its Variants , 1991, IEEE Trans. Computers.

[18]  Franz Rendl,et al.  A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..

[19]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[20]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[21]  Yoji Kajitani,et al.  A graph- theoretic via minimization algorithm for two layer printed circuit boards , 1983 .