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

Volodymyr P. Shylo and Oleg V. Shylo
Additional contact information
Volodymyr P. Shylo: Institute of Cybernetics NAS of Ukraine, Ukraine
Oleg V. Shylo: University of Pittsburgh, USA

International Journal of Swarm Intelligence Research (IJSIR), 2011, vol. 2, issue 2, 42-51

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.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jsir.2011040103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jsir00:v:2:y:2011:i:2:p:42-51

Access Statistics for this article

International Journal of Swarm Intelligence Research (IJSIR) is currently edited by Yuhui Shi

More articles in International Journal of Swarm Intelligence Research (IJSIR) from IGI Global
Bibliographic data for series maintained by Journal Editor ().