Discrete Cuckoo Search with Local Search for Max-cut Problem

. 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.

For max-cut problem, Laguna et al. [26] designed a hybrid version of cross entropy method, while Lin [27] proposed a discrete dynamic convexized method.Festa et al. [28] investigated several heuristics derived from greedy randomized adaptive search procedure and variable neighborhood search.In 2007, Wang [29] proposed a hybrid algorithm combining with chaotic discrete Hopfield neural network and genetic particle swarm optimization, while in 2011, Wang [30] designed another combination with tabu Hopfield neural network and estimation of distribution algorithm.Inspired by this work, Lin [31] designed an integrated method combined with particle swarm optimization and estimation of distribution algorithm, and a local search strategy is employed to improve the accuracy.Shylo [32] also employed global equilibrium search algorithms and tabu search to improve the accuracy.
In this paper, we propose a new heuristic algorithm to combining the cuckoo search algorithm and local search strategy, and apply it to solve max-cut problem.The rest of this paper is organized as follows: In Section 2, the details of our proposed hybrid algorithm are presented, as well as the simulation results are reported in Section 3.

Discrete Cuckoo Search Algorithm
Cuckoo search algorithm was proposed in 2009 [33], up to now, many variants are proposed to improve the performance [34][35][36].However, max-cut problem is a combination problem, and a discrete cuckoo search algorithm is designed to solve it.
In this discrete version, the position movement will use the following strategies [37]: Strategy 2: where where The most difference among three strategy is the sigma function () sig step , and jump path step is a random number with Levy distribution, to provide a deep insight, the Eq. ( 3), Eq.( 5) and Eq.( 7) are plotted in Fig. 1-Fig.3.

Local Search Strategy
For any partition 12 ( , ) VV , if the vertex j is moved from the current partition to an- other subset, the gain index j g is defined as follows: , Move the vertices of 1 sel , which are selected sequentially from sorted result.
Evaluate the fitness End End

Proposed Hybrid Algorithm
Our modification is a hybrid meta-heuristic method combining a discrete cuckoo search algorithm and local search strategy.The discrete cuckoo search is employed to find the approximate satisfied solution, while the local optimal solution is used to further improve the performance for the obtained approximate satisfied solution.Furthermore, to avoid the premature convergence, a mutation strategy is also employed to avoid the premature convergence.The pseudocode of our hybrid algorithm is listed in Algorithm 3.For each cuckoo, the mutation operation will randomly take 0.1% vertices to flip.We find that the algorithm will be improved after adding the mutation operation.Where (Stop condition is not verified) the local strategy (refer to Alg.2) is employed to improve the quality of the solution; If a particle x in a group is not improved in two consec- utive searches, a mutation strategy is employed to avoid the premature convergence; End End

Performance Evolution
To test the performance of our proposed hybrid algorithm, G-set graph benchmarks are employed, and compared with the following algorithms: • Hybridizing the cross-entropy method (HCE, in briefly) [26] The program is implemented with MATLAB.In this set of instances, the number of vertex range from 800 to 3000. the control factor r p is 0.3, the probability a p are both set to 0.5, the total generation is 500.
For chosen benchmarks, each instance will run 50 times, Table 1 provides the optimal value achieved by the three algorithms and our proposed algorithm.The last line noted as " / / " w t l is the comparison results between our proposed DCSLS and its competitors."w/t/l" represents our algorithm wins in w functions, ties in t functions, and loses in l functions.It means DCSLS is better than HCE for six functions, while only worse than HCE for three functions.DCSLS are superior than DHNN-EDA and LNA for six functions too, while DHNN-EDA and LNA only better than DCSLS with two and three functions, respectively.In one word, DCSLS achieves the best performance when compared with HCE, DHNN-EDA and LNA.To provide a deep comparison, two non-parametric statistics tests: Friedman test and Wilcoxon test, are employed to show the differences among these four algorithms.In Tab.2, the ranking value is: DCSLS<HCE<DHNN-EDA<LNA, DCSLS maintains the lowest ranking, it means the performance of DCSLS is more better.Tab.3 implies there is significantly difference between DCSLS and DHNN-EDA.

Conclusion
In this paper, a new hybrid algorithm combining with discrete cuckoo search and local search strategy is designed.The cuckoo update manner of discrete cuckoo search is the same as [37], while the local search strategy is designed.Simulation results show our modification achieves the best performance when compared with other three algorithms.

Algorithm 3
Cuckoo search with Local search Begin For the graph, population pop , and record the best solution gbest ; Find the approximate satisfied solution by the discrete cuckoo search (refer to Alg.1);

9 1
Update the nest position for each cuckoo by strategy 1; With this manner, the following local search strategy is introduced: j g  means the vertex j should be moved with a lower objective function.

Table 1 :
Comparison of the results

.
This research is supported by the Natural Science Foundation of Shanxi Province under No. 201601D011045.