Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search

Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search

Volodymyr P. Shylo (Institute of Cybernetics NAS of Ukraine, Ukraine) and Oleg V. Shylo (University of Pittsburgh, USA)
Copyright: © 2011 |Pages: 10
DOI: 10.4018/jsir.2011040103
OnDemand PDF Download:
No Current Special Offers


In this paper, the potential of the path relinking method for the maximum cut problem is investigated. This method is embedded within global equilibrium search to utilize the set of high quality solutions provided by the latter. The computational experiment on a set of standard benchmark problems is provided to study the proposed approach. The empirical experiments reveal that the large sizes of the elite set lead to restart distribution of the running times, i.e., the algorithm can be accelerated by simply removing all of the accumulated data (set P) and re-initiating its execution after a certain number of elite solutions is obtained.
Article Preview


Assuming that the weights are non-negative, the maximum cut problem can be formulated by the following mixed-integer program (Kahruman, Kolotoglu, Butenko, & Hicks, 2007):

The optimal solution vector x defines a graph partition jsir.2011040103.m09 (if jsir.2011040103.m10 then jsir.2011040103.m11, otherwise jsir.2011040103.m12) that has the maximum cut value. Let jsir.2011040103.m13 denote a cost of a cut corresponding to the solution vector x.

Local search based methods require an initial solution jsir.2011040103.m14 to start the chain of local improvements until the local optimum is obtained. GES provides an intelligent mechanism of generating initial solutions for local search based methods. Its metaheuristic framework proved to be extremely efficient for a variety of combinatorial problems (Pardalos, Prokopyev, Shylo, & Shylo, 2008; Shylo, Prokopyev, & Shylo, 2008).

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 13: 4 Issues (2022): Forthcoming, Available for Pre-Order
Volume 12: 4 Issues (2021): 2 Released, 2 Forthcoming
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing