Y. Xia and Z. Xu, An efficient Lagrangian smoothing heuristic for Max-Cut, Indian Journal of Pure and Applied Mathematics, vol.3, issue.2, pp.683-700, 2010.
DOI : 10.1007/s11590-008-0105-6

R. Marti, A. Duarte, and M. Laguna, Advanced Scatter Search for the Max-Cut Problem, INFORMS Journal on Computing, vol.21, issue.1, pp.26-38, 2009.
DOI : 10.1287/ijoc.1080.0275

G. G. Wang, S. Deb, X. Z. Gao, and L. Coelho, A new metaheuristic optimisation algorithm motivated by elephant herding behaviour, International Journal of Bio-Inspired Computation, vol.8, issue.6, pp.394-409, 2016.
DOI : 10.1504/IJBIC.2016.081335

M. N. Bilbao, J. D. Ser, S. Salcedo-sanz, and C. Casanova-mateo, On the application of multi-objective harmony search heuristics to the predictive deployment of firefighting aircrafts: a realistic case study, International Journal of Bio-Inspired Computation, vol.7, issue.5, pp.270-284, 2015.
DOI : 10.1504/IJBIC.2015.072257

R. Rajakumar, P. Dhavachelvan, and T. Vengattaraman, A survey on nature inspired metaheuristic algorithms with its domain specifications, International Conference on Communication and Electronics Systems, pp.550-555, 2016.
DOI : 10.1109/cesys.2016.7889811

R. Xiao, Y. Zhang, and Z. Huang, Emergent computation of complex systems: a comprehensive review, International Journal of Bio-Inspired Computation, vol.7, issue.2, pp.75-97, 2015.
DOI : 10.1504/IJBIC.2015.069292

M. Dorigo, L. M. Gambardella, M. Middendorf, and T. Stutzle, Guest editorial: special section on ant colony optimization, IEEE Transactions on Evolutionary Computation, vol.6, issue.4, pp.317-320, 2002.
DOI : 10.1109/TEVC.2002.802446
URL : http://ieeexplore.ieee.org:80/stamp/stamp.jsp?tp=&arnumber=1027743

P. Stodola and J. Mazal, Applying the ant colony optimisation algorithm to the capacitated multi-depot vehicle routing problem, Int. J. Bio-Inspired Comput, vol.8, issue.4, pp.228-233, 2016.

Y. W. Zhang, J. T. Wu, X. Guo, and G. N. Li, Optimising web service composition based on differential fruit fly optimisation algorithm, International Journal of Computing Science and Mathematics, vol.7, issue.1, pp.87-101, 2016.
DOI : 10.1504/IJCSM.2016.076036
URL : http://doi.org/10.1504/ijcsm.2016.076036

R. C. Eberhart and Y. H. Shi, Guest Editorial Special Issue on Particle Swarm Optimization, IEEE Transactions on Evolutionary Computation, vol.8, issue.3, pp.201-203, 2004.
DOI : 10.1109/TEVC.2004.830335

A. O. Adewumi and M. A. Arasomwan, On the performance of particle swarm optimisation with(out) some control parameters for global optimisation, International Journal of Bio-Inspired Computation, vol.8, issue.1, pp.14-32, 2016.
DOI : 10.1504/IJBIC.2016.074632

H. Grillo, D. Peidro, M. Alemany, and J. Mula, Application of particle swarm optimisation with backward calculation to solve a fuzzy multi-objective supply chain master planning model, International Journal of Bio-Inspired Computation, vol.7, issue.3, pp.157-169, 2015.
DOI : 10.1504/IJBIC.2015.069557
URL : https://riunet.upv.es/bitstream/10251/70306/2/Application%20of%20particle%20swarm.pdf

L. Lv, L. Y. Wu, J. Zhao, H. Wang, R. X. Wu et al., Improved multi-strategy artificial bee colony algorithm, International Journal of Computing Science and Mathematics, vol.7, issue.5, pp.467-475, 2016.
DOI : 10.1504/IJCSM.2016.080087

H. Sun, K. Wang, J. Zhao, and X. Yu, Artificial bee colony algorithm with improved special centre, International Journal of Computing Science and Mathematics, vol.7, issue.6, pp.548-553, 2016.
DOI : 10.1504/IJCSM.2016.081698

Y. Lu, R. X. Li, and S. M. Li, Artificial bee colony with bidirectional search, International Journal of Computing Science and Mathematics, vol.7, issue.6, pp.586-593, 2016.
DOI : 10.1504/IJCSM.2016.081696

G. Yu, A new multi-population-based artificial bee colony for numerical optimisation, International Journal of Computing Science and Mathematics, vol.7, issue.6, pp.509-515, 2016.
DOI : 10.1504/IJCSM.2016.081695

Z. L. Guo, S. W. Wang, X. Z. Yue, B. Y. Yin, C. S. Deng et al., Enhanced social emotional optimisation algorithm with elite multi-parent crossover, International Journal of Computing Science and Mathematics, vol.7, issue.6, pp.568-574, 2016.
DOI : 10.1504/IJCSM.2016.081694

H. Wang, W. J. Wang, and X. Y. Zhou, Firefly algorithm with neighborhood attraction, Information Sciences, vol.382, issue.383, pp.374-387, 2017.
DOI : 10.1016/j.ins.2016.12.024

H. Wang, W. J. Wang, and H. Sun, Firefly algorithm with random attraction, International Journal of Bio-Inspired Computation, vol.8, issue.1, pp.33-41, 2016.
DOI : 10.1504/IJBIC.2016.074630
URL : http://doi.org/10.1504/ijbic.2016.074630

G. Yu, An improved firefly algorithm based on probabilistic attraction, International Journal of Computing Science and Mathematics, vol.7, issue.6, pp.530-536, 2016.
DOI : 10.1504/IJCSM.2016.081701

B. Nasiri and M. R. Meybodi, History-driven firefly algorithm for optimisation in dynamic and uncertain environments, International Journal of Bio-Inspired Computation, vol.8, issue.5, pp.326-339, 2016.
DOI : 10.1504/IJBIC.2016.079575

I. Fister, I. Fister, X. S. Yang, and J. Brest, A comprehensive review of firefly algorithms, Swarm and Evolutionary Computation, vol.13, pp.34-46, 2013.
DOI : 10.1016/j.swevo.2013.06.001
URL : http://arxiv.org/pdf/1312.6609.pdf

X. S. Yang and A. H. Gandomi, Bat algorithm: a novel approach for global engineering optimization, Engineering Computations, vol.29, issue.5, pp.5-6, 2012.
DOI : 10.1007/s00158-003-0345-0
URL : http://arxiv.org/abs/1211.6663

X. Cai, X. Z. Gao, and Y. Xue, Improved bat algorithm with optimal forage strategy and random disturbance strategy, International Journal of Bio-Inspired Computation, vol.8, issue.4, pp.205-214, 2016.
DOI : 10.1504/IJBIC.2016.078666

F. Xue, Y. Cai, Y. Cao, Z. Cui, and F. Li, Optimal parameter settings for bat algorithm, International Journal of Bio-Inspired Computation, vol.7, issue.2, pp.125-128, 2015.
DOI : 10.1504/IJBIC.2015.069304

M. Laguna, A. Duarte, and R. Marti, Hybridizing the cross-entropy method: An application to the max-cut problem, Computers & Operations Research, vol.36, issue.2, pp.487-498, 2009.
DOI : 10.1016/j.cor.2007.10.001
URL : http://www.uv.es/~rmarti/paper/docs/maxcut1.pdf

G. Lin and W. Zhu, A discrete dynamic convexized method for the max-cut problem, Annals of Operations Research, vol.36, issue.1, pp.371-390, 2012.
DOI : 10.1016/j.cor.2008.12.002

P. Festa, P. M. Pardalos, M. G. Resende, and C. C. Ribeiro, Randomized heuristics for the Max-Cut problem, Optimization Methods and Software, vol.25, issue.6, pp.1033-1058, 2002.
DOI : 10.1145/355826.355828
URL : http://www.research.att.com/~mgcr/doc/gmaxcut.pdf

J. Wang, A Memetic Algorithm with Genetic Particle Swarm Optimization and Neural Network for Maximum Cut Problems, International Conference on Life System Modeling and Simulation, pp.297-306, 2007.
DOI : 10.1007/978-3-540-74769-7_33

J. Wang, Y. Zhou, and J. Yin, Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem, Expert Systems with Applications, vol.38, issue.12, pp.14870-14881, 2011.
DOI : 10.1016/j.eswa.2011.05.060

G. Lin and J. Guan, An Integrated Method Based on PSO and EDA for the Max-Cut Problem, Computational Intelligence and Neuroscience, vol.2016, p.3420671, 2016.
DOI : 10.1137/s1052623497328987
URL : http://doi.org/10.1155/2016/3420671

V. P. Shylo and O. V. Shylo, Solving the maxcut problem by the global equilibrium search, Cybernetics and Systems Analysis, vol.10, issue.1, pp.744-754, 2010.
DOI : 10.1007/s10559-010-9256-4

X. S. Yang and S. Deb, Cuckoo search via Levy flights, World Congress on Nature & Biologically Inspired Computing, pp.210-214, 2009.
DOI : 10.1109/nabic.2009.5393690

Z. H. Cui, B. Sun, G. G. Wang, and Y. Xue, A novel oriented cuckoo search algorithm to improve DV-Hop performance for cyber???physical systems, Journal of Parallel and Distributed Computing, vol.103, pp.42-52, 2017.
DOI : 10.1016/j.jpdc.2016.10.011

M. Q. Zhang, H. Wang, Z. H. Cui, and J. J. Chen, Hybrid multi-objective cuckoo search with dynamical local search, Memetic Comp. DOI:10.1007, pp.12293-12310, 2017.
DOI : 10.1162/106365600568202

F. X. Li, Z. H. Cui, and B. Sun, DV-hop localisation algorithm with DDICS, International Journal of Computing Science and Mathematics, vol.7, issue.3, pp.254-262, 2016.
DOI : 10.1504/IJCSM.2016.077857

D. K. Feng, Q. Ruan, and L. M. Du, Binary cuckoo search algorithm, Journal of Computer Applications, vol.33, issue.6, pp.1566-1570, 2013.
DOI : 10.3724/SP.J.1087.2013.01566

F. M. Xu, X. S. Ma, and B. L. Chen, A new Lagrangian net algorithm for solving max-bisection problems, Journal of Computational and Applied Mathematics, vol.235, issue.13, pp.3718-3723, 2011.
DOI : 10.1016/j.cam.2011.01.015
URL : https://doi.org/10.1016/j.cam.2011.01.015