IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

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

Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search
View Sample PDF
Author(s): Volodymyr P. Shylo (Institute of Cybernetics NAS of Ukraine, Ukraine) and Oleg V. Shylo (University of Pittsburgh, USA)
Copyright: 2013
Pages: 10
Source title: Recent Algorithms and Applications in Swarm Intelligence Research
Source Author(s)/Editor(s): Yuhui Shi (Southern University of Science and Technology (SUSTech), China)
DOI: 10.4018/978-1-4666-2479-5.ch003

Purchase

View Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search on the publisher's website for pricing and purchasing information.

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.

Related Content

Rafael Martí, Juan-José Pantrigo, Abraham Duarte, Vicente Campos, Fred Glover. © 2013. 21 pages.
Peng-Yeng Yin, Fred Glover, Manuel Laguna, Jia-Xian Zhu. © 2013. 20 pages.
Volodymyr P. Shylo, Oleg V. Shylo. © 2013. 10 pages.
Tabitha James, Cesar Rego. © 2013. 19 pages.
Gary G. Yen, Wen-Fung Leong. © 2013. 25 pages.
Shi Cheng, Yuhui Shi, Quande Qin. © 2013. 29 pages.
Xin-She Yang. © 2013. 12 pages.
Body Bottom