.png){kind=icon}
Return
A tabu search based hybrid evolutionary algorithm for the max-cut problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2015.04.033.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a tabu search based hybrid evolutionary algorithm (TSHEA) for solving the max-cut problem. The proposed algorithm integrates a distance-and-quality based solution combination operator and a tabu search procedure based on neighborhood combination of one-flip and constrained exchange moves. Comparisons with leading reference algorithms from the literature disclose that the proposed algorithm discovers new best solutions for 15 out of 91 instances, while matching the best known solutions on all but 4 instances. Analysis indicates that the neighborhood combination and the solution combination operator play key roles to the effectiveness of the proposed algorithm. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Max-cut
Metaheuristics
Hybrid evolutionary algorithm
Tabu search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
ShareSave
ShareSaveGeospatial Approach on Landslide Hazard Zonation Mapping Using Multicriteria Decision Analysis: A Study on Coonoor and Ooty, Part of Kallar Watershed, The Nilgiris, Tamil Nadu.png)
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
OAAI
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information SciencesIF0
OAAIShareSaveShareSave
View more