Welcome to the InfoSci Platform
Reference Hub6
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, Oleg V. Shylo
Copyright: © 2011 |Volume: 2 |Issue: 2 |Pages: 10
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781613509326|DOI: 10.4018/jsir.2011040103
Cite Article Cite Article

MLA

Shylo, Volodymyr P., and Oleg V. Shylo. "Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search ." IJSIR vol.2, no.2 2011: pp.42-51. http://doi.org/10.4018/jsir.2011040103

APA

Shylo, V. P. & Shylo, O. V. (2011). Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search . International Journal of Swarm Intelligence Research (IJSIR), 2(2), 42-51. http://doi.org/10.4018/jsir.2011040103

Chicago

Shylo, Volodymyr P., and Oleg V. Shylo. "Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search ," International Journal of Swarm Intelligence Research (IJSIR) 2, no.2: 42-51. http://doi.org/10.4018/jsir.2011040103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.