Skip to Main content Skip to Navigation
Conference papers

Discrete Cuckoo Search with Local Search for Max-cut Problem

Abstract : Max-cut problem is a well-known NP-hard problem, in this paper, a hybrid meta-heuristic algorithm is designed to solve it. In this algorithm, the discrete cuckoo search is employed to find the approximate satisfied solution, while the local optimal solution is used to further improve the performance. To test the validity, three other algorithms are used to compare, simulation results show our modification is effective.
Document type :
Conference papers
Complete list of metadata

Cited literature [38 references]  Display  Hide  Download

https://hal.inria.fr/hal-01820945
Contributor : Hal Ifip <>
Submitted on : Friday, June 22, 2018 - 10:44:58 AM
Last modification on : Friday, June 22, 2018 - 10:51:20 AM
Long-term archiving on: : Tuesday, September 25, 2018 - 10:29:10 AM

File

978-3-319-68121-4_7_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Yingying Xu, Zhihua Cui, Lifang Wang. Discrete Cuckoo Search with Local Search for Max-cut Problem. 2nd International Conference on Intelligence Science (ICIS), Oct 2017, Shanghai, China. pp.66-74, ⟨10.1007/978-3-319-68121-4_7⟩. ⟨hal-01820945⟩

Share

Metrics

Record views

143

Files downloads

85