The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Path Relinking Scheme for the Max-Cut Problem
|
|
Author(s): Volodymyr P. Shylo (V. M. Glushkov Institute of Cybernetics (IC), Ukraine)and Oleg V. Shylo (University of Tennessee, USA)
Copyright: 2015
Pages: 11
Source title:
Emerging Research on Swarm Intelligence and Algorithm Optimization
Source Author(s)/Editor(s): Yuhui Shi (Southern University of Science and Technology (SUSTech), China)
DOI: 10.4018/978-1-4666-6328-2.ch011
Purchase
|
Abstract
In this chapter, a path relinking method for the maximum cut problem is investigated. The authors consider an implementation of the path-relinking, where it is utilized as a subroutine for another meta-heuristic search procedure. Particularly, the authors focus on the global equilibrium search method to provide a set of high quality solutions, the set that is used within the path relinking method. The computational experiment on a set of standard benchmark problems is provided to study the proposed approach. The authors show that when the size of the solution set that is passed to the path relinking procedure is too large, the resulting running times follow the restart distribution, which guarantees that an underlying algorithm can be accelerated by removing all of the accumulated data (set P) and re-initiating its execution after a certain number of elite solutions is obtained.
Related Content
|
Pawan Kumar, Mukul Bhatnagar, Sanjay Taneja.
© 2024.
26 pages.
|
|
Kapil Kumar Aggarwal, Atul Sharma, Rumit Kaur, Girish Lakhera.
© 2024.
19 pages.
|
|
Mohammad Kashif, Puneet Kumar, Sachin Ghai, Satish Kumar.
© 2024.
15 pages.
|
|
Manjit Kour.
© 2024.
13 pages.
|
|
Sanjay Taneja, Reepu.
© 2024.
19 pages.
|
|
Jaspreet Kaur, Ercan Ozen.
© 2024.
28 pages.
|
|
Hayet Kaddachi, Naceur Benzina.
© 2024.
25 pages.
|
|
|