Discrete Cuckoo Search with Local Search for Max-cut Problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Discrete Cuckoo Search with Local Search for Max-cut Problem

(1) , (1) , (1)
1
Yingying Xu
  • Function : Author
  • PersonId : 1033432
Zhihua Cui
  • Function : Author
  • PersonId : 1033433
Lifang Wang
  • Function : Author
  • PersonId : 1033434

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.
Fichier principal
Vignette du fichier
978-3-319-68121-4_7_Chapter.pdf (235.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01820945 , version 1 (22-06-2018)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
51 View
60 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More