Abstract
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized. This NP-hard problem for non planar graphs has several application areas such as VLSI and ASICs CAD. The hierarchical social (HS) metaheuristic here proposed for solving the referred problem is tested and compared with other two metaheuristics: a greedy randomized adaptive search procedure (GRASP) and an hybrid memetic heuristic that combines a genetic algorithm (GA) and a local search. The computational results on a set of standard test problems show the suitability of the approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Burer, S., Monteiro, R.D.C., Zhang, X.: Rank-two Relaxation heuristic for the Max-Cut and other Binary Quadratic Programs. SIAM Journal of Optimization 12, 503–521 (2001)
Dolezal, O., Hofmeister, T., Lefmann, H.: A comparison of approximation algorithms for the MAXCUT-problem. Reihe CI 57/99, SFB 531, Universität Dortmund (1999)
Fernández, F., Duarte, A., Sánchez, A.: A Software Pipelining Method Based on Hierarchical Social Algorithms. In: Proceedings of MISTA Conference, Nottingham, UK, vol. 1, pp. 382–385 (2003)
Fernández, F., Duarte, A., Sánchez, A.: Hierarchical Social Algorithms: A New Metaheuristic for Solving Discrete Bilevel Optimization Problems, Technical Report ESCET/URF -DTF/ UPM. HSA1 Universidad Politécnica de Madrid (2003)
Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Randomized heuristics for the MAX-CUT problem. Optimization Methods and Software 7, 1033–1058 (2002)
Goemans, M.X., Williams, D.P.: Improved Approximation Algorithms for Max-Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM 42, 1115–1142 (1995)
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Helmberg, C., Rendl, F.: A Spectral Bundle Method for Semidefinite Programming. SIAM Journal of Computing 10, 673–696 (2000)
Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computers Computation, Prenum Press, New York (1972)
Hadlock, F.O.: Finding a Maximum Cut of a Planar Graph in Polynomial Time. SIAM Journal on Computing 4, 221–225 (1975)
Lovàsz, L.: On the Shannon Capacity of a Graph. IEEE Trans. of Information Theory, IT 25, 1–7 (1978)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)
Michalewicz, Z., Fogel, D.B.: How to Solve it: Modern Heuristics. Springer, Berlin (2000)
Moscato, P., Cotta, C.: A Gentle Introduction to Memetic Algorithms. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristic, Kluwer, Norwell (2003)
Resende, M.G., Ribeiro, C.: Greedy Adaptive Search Procedures. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristic, Kluwer, Massachusetts (2003)
Resende, M.G.: GRASP With Path Re-linking and VNS for MAXCUT. In: Proceedings of 4th MIC, Porto (July 2001)
Spears, W.M.: Evolutionary Algorithms. The Role of Mutation and Recombination. Springer, Heidelberg (1998)
Shor, N.Z.: Quadratic Optimization Problems. Soviet Journal of Computing and System Science 25, 1–11 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duarte, A., Fernández, F., Sánchez, Á., Sanz, A. (2004). A Hierarchical Social Metaheuristic for the Max-Cut Problem. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive