Abstract
The Max-Cut Problem involves dividing a set of n vertices in a weighted graph \(G = (V, E)\) into two subsets \((S, \bar{S})\) in such a way that the sum of the weights between the subsets is maximized. This research introduces two heuristic methods that combine Genetic Algorithm, Tabu Search, and a set of optimality cuts, which are also proven in this work. To the best of our knowledge, we are the first to utilize these inequalities in conjunction with the genetic algorithm methodology to solve the Max-Cut problem. Computational experiments using a benchmark set of 54 instances, ranging from 800 to 3000 vertices, demonstrate that the incorporation of optimality cuts is a crucial factor for our methodologies to compete effectively with six state-of-the-art approaches for the Max-Cut problem and our genetic algorithm that incorporated optimality cuts in the population generation was able to improve the state-of-the-art value for the G51 instance and find the same solutions as the literature in 31 other instances.
This work is partially supported by Universal CNPq [422912/2021-2].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agrawal, R., Rajagopalan, S., Srikant, R., Xu, Y.: Mining newsgroups using networks arising from social behavior. In: Proceedings of the 12th international conference on World Wide Web, pp. 529–535 (2003)
Alidaee, B., Sloan, H., Wang, H.: Simple and fast novel diversification approach for the UBQP based on sequential improvement local search. Comput. Ind. Eng. 111, 164–175 (2017)
Barahona, F.: The max-cut problem on graphs not contractible to K5. Oper. Res. Lett. 2(3), 107–111 (1983)
Barahona, F., Grötschel, M., Jünger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493–513 (1988)
Bramoullé, Y.: Anti-coordination and social interactions. Games Econom. Behav. 58(1), 30–49 (2007)
Burer, S., Monteiro, R., Zhang, Y.: Rank-two relaxation heuristic for max-cut and other binary quadratic problems. SIAM J. Optim. 12(2), 503–521 (2001/2002)
Chui, K.T., Gupta, B.B., Vasant, P.: A genetic algorithm optimized RNN-LSTM model for remaining useful life prediction of turbofan engine. Electronics 10(3), 285 (2021)
De Simone, C., Diehl, M., Jünger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm. J. Stat. Phys. 80(12), 487–496 (1995)
De Simone, C., Rinaldi, G.: A cutting plane algorithm for the max-cut problem. Optim. Methods Softw. 3(13), 195–214 (1994)
Dunning, I., Gupta, S., Silberholz, J.: What works best when? A systematic evaluation of heuristics for Max-Cut and QUBO. INFORMS J. Comput. 30(3), 608–624 (2018)
Facchetti, G., Iacono, G., Altafini, C.: Computing global structural balance in large-scale signed social networks. Proc. Natl. Acad. Sci. 108(52), 20953–20958 (2011)
Galinier, P., Boujbel, Z., Fernandes, M.: An efficient memetic algorithm for the graph partitioning problem. Annals OR 191, 1–22 (2011)
Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673–696 (2000)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85–103. Springer, Cham (1972). https://doi.org/10.1007/978-1-4684-2001-2_9
Kim, S.H., Kim, Y.H., Moon, B.R.: A hybrid genetic algorithm for the MAX CUT problem. In: Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation, pp. 416–423. Morgan Kaufmann Publishers Inc. (2001)
Kim, Y.H., Yoon, Y., Geem, Z.W.: A comparison study of harmony search and genetic algorithm for the MAX-CUT problem. Swarm Evol. Comput. 44, 130–135 (2019)
Kochenberger, G.A., Hao, J.K., Lü, Z., Wang, H., Glover, F.: Solving large scale Max Cut problems via tabu search. J. Heuristics 19(4), 565–571 (2013)
Kolli, N., Narayanaswamy, B.: Influence maximization from cascade information traces in complex networks in the absence of network structure. IEEE Trans. Comput. Soc. Syst. 6(6), 1147–1155 (2019)
Krislock, N., Malick, J., Rouoin, F.: Improved semidefinite bounding procedure for solving Max-Cut problems to optimality. Math. Program. 143(1–2), 61–86 (2014)
Ma, F., Hao, J.K.: A multiple search operator heuristic for the max-k-cut problem. Ann. Oper. Res. 248(1–2), 365–403 (2017)
Martí, R., Duarte, A., Laguna, M.: Advanced scatter search for the Max-Cut problem. INFORMS J. Comput. 21(1), 26–38 (2009)
Mirjalili, S.: Genetic algorithm. In: Evolutionary Algorithms and Neural Networks. SCI, vol. 780, pp. 43–55. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-93025-1_4
Myklebust, T.G.: Solving maximum cut problems by simulated annealing. arXiv preprint (2015)
Pandey, A., Banerjee, S.: Test suite optimization using firefly and genetic algorithm. Int. J. Softw. Sci. Comput. Intell. (IJSSCI) 11(1), 31–46 (2019)
Rendl, F., Rinaldi, G., Wiegele, A.: A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 295–309. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72792-7_23
Sun, L., Cheng, X., Liang, Y.: Solving job shop scheduling problem using genetic algorithm with penalty function. Int. J. Intell. Inf. Process. 1(2), 65–77 (2010)
Wu, Q., Hao, J.-K.: A memetic approach for the Max-Cut problem. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7492, pp. 297–306. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32964-7_30
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Soares, P.L.B., Araújo, C.V.D. (2023). Genetic Algorithms with Optimality Cuts to the Max-Cut Problem. In: Naldi, M.C., Bianchi, R.A.C. (eds) Intelligent Systems. BRACIS 2023. Lecture Notes in Computer Science(), vol 14197. Springer, Cham. https://doi.org/10.1007/978-3-031-45392-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-45392-2_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-45391-5
Online ISBN: 978-3-031-45392-2
eBook Packages: Computer ScienceComputer Science (R0)