{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:05:38Z","timestamp":1742958338473,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319681207"},{"type":"electronic","value":"9783319681214"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68121-4_7","type":"book-chapter","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T12:23:46Z","timestamp":1506428626000},"page":"66-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Discrete Cuckoo Search with Local Search for Max-cut Problem"],"prefix":"10.1007","author":[{"given":"Yingying","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihua","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lifang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s13226-010-0039-4","volume":"41","author":"Y Xia","year":"2010","unstructured":"Xia, Y., Xu, Z.: An efficient lagrangian smoothing heuristic for max-cut. Indian J. Pure Appl. Math. 41(5), 683\u2013700 (2010)","journal-title":"Indian J. Pure Appl. Math."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/ijoc.1080.0275","volume":"21","author":"R Marti","year":"2009","unstructured":"Marti, R., Duarte, A., Laguna, M.: Advanced scatter search for the max-cut problem. Inf. J. Comput. 21(1), 26\u201338 (2009)","journal-title":"Inf. J. Comput."},{"issue":"6","key":"7_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1504\/IJBIC.2016.081335","volume":"8","author":"GG Wang","year":"2016","unstructured":"Wang, G.G., Deb, S., Gao, X.Z., Coelho, L.: A new metaheuristic optimization algorithm motivated by elephant herding behavior. Int. J. Bio-Inspired Comput. 8(6), 394\u2013409 (2016)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"5","key":"7_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1504\/IJBIC.2015.072257","volume":"7","author":"MN Bilbao","year":"2015","unstructured":"Bilbao, M.N., Ser, J.D., Salcedo-Sanz, S., Casanova-Mateo, C.: On the application of multi-objective harmony search heuristics to the predictive deployment of firefighting aircrafts: a realistic case study. Int. J. Bio-Inspired Comput. 7(5), 270\u2013284 (2015)","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Rajakumar, R., Dhavachelvan, P., Vengattaraman, T.: A survey on nature inspired meta-heuristic algorithms with its domain specifications. In: International Conference on Communication and Electronics Systems, pp. 550\u2013555 (2016)","DOI":"10.1109\/CESYS.2016.7889811"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1504\/IJBIC.2015.069292","volume":"7","author":"R Xiao","year":"2015","unstructured":"Xiao, R., Zhang, Y., Huang, Z.: Emergent computation of complex systems: a comprehensive review. Int. J. Bio-Inspired Comput. 7(2), 75\u201397 (2015)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1109\/TEVC.2002.802446","volume":"6","author":"M Dorigo","year":"2002","unstructured":"Dorigo, M., Gambardella, L.M., Middendorf, M., Stutzle, T.: Special section on ant colony optimization. IEEE Trans. Evol. Comput. 6(4), 317\u2013320 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1504\/IJBIC.2016.10000256","volume":"8","author":"P Stodola","year":"2016","unstructured":"Stodola, P., Mazal, J.: Applying the ant colony optimisation algorithm to the capacitated multi-depot vehicle routing problem. Int. J. Bio-Inspired Comput. 8(4), 228\u2013233 (2016)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1504\/IJCSM.2016.076036","volume":"7","author":"YW Zhang","year":"2016","unstructured":"Zhang, Y.W., Wu, J.T., Guo, X., Li, G.N.: Optimising web service composition based on differential fruit fly optimisation algorithm. Int. J. Comput. Sci. Math. 7(1), 87\u2013101 (2016)","journal-title":"Int. J. Comput. Sci. Math."},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2004.830335","volume":"8","author":"RC Eberhart","year":"2004","unstructured":"Eberhart, R.C., Shi, Y.H.: Special issue on particle swarm optimization. IEEE Trans. Evol. Comput. 8(3), 201\u2013203 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1504\/IJBIC.2016.074632","volume":"8","author":"AO Adewumi","year":"2016","unstructured":"Adewumi, A.O., Arasomwan, M.A.: On the performance of particle swarm optimisation with(out) some control parameters for global optimisation. Int. J. Bio-Inspired Comput. 8(1), 14\u201332 (2016)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1504\/IJBIC.2015.069557","volume":"7","author":"H Grillo","year":"2015","unstructured":"Grillo, H., Peidro, D., Alemany, M., Mula, J.: Application of particle swarm optimisation with backward calculation to solve a fuzzy multi-objective supply chain master planning model. Int. J. Bio-Inspired Comput. 7(3), 157\u2013169 (2015)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"5","key":"7_CR13","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1504\/IJCSM.2016.080087","volume":"7","author":"L Lv","year":"2016","unstructured":"Lv, L., Wu, L.Y., Zhao, J., Wang, H., Wu, R.X., Fan, T.H., Hu, M., Xie, Z.F.: Improved multi-strategy artificial bee colony algorithm. Int. J. Comput. Sci. Math. 7(5), 467\u2013475 (2016)","journal-title":"Int. J. Comput. Sci. Math."},{"issue":"6","key":"7_CR14","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1504\/IJCSM.2016.081698","volume":"7","author":"H Sun","year":"2016","unstructured":"Sun, H., Wang, K., Zhao, J., Yu, X.: Artificial bee colony algorithm with improved special centre. Int. J. Comput. Sci. Math. 7(6), 548\u2013553 (2016)","journal-title":"Int. J. Comput. Sci. Math."},{"issue":"6","key":"7_CR15","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1504\/IJCSM.2016.081696","volume":"7","author":"Y Lu","year":"2016","unstructured":"Lu, Y., Li, R.X., Li, S.M.: Artificial bee colony with bidirectional search. Int. J. Comput. Sci. Math. 7(6), 586\u2013593 (2016)","journal-title":"Int. J. Comput. Sci. Math."},{"issue":"6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1504\/IJCSM.2016.081695","volume":"7","author":"G Yu","year":"2016","unstructured":"Yu, G.: A new multi-population-based artificial bee colony for numerical optimization. Int. J. Comput. Sci. Math. 7(6), 509\u2013515 (2016)","journal-title":"Int. J. Comput. Sci. Math."},{"issue":"6","key":"7_CR17","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1504\/IJCSM.2016.081694","volume":"7","author":"ZL Guo","year":"2016","unstructured":"Guo, Z.L., Wang, S.W., Yue, X.Z., Yin, B.Y., Deng, C.S., Wu, Z.J.: Enhanced social emotional optimisation algorithm with elite multi-parent crossover. Int. J. Comput. Sci. Math. 7(6), 568\u2013574 (2016)","journal-title":"Int. J. Comput. Sci. Math."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.ins.2016.12.024","volume":"382","author":"H Wang","year":"2017","unstructured":"Wang, H., Wang, W.J., Zhou, X.Y.: Firefly algorithm with neighborhood attraction. Inf. Sci. 382, 374\u2013387 (2017)","journal-title":"Inf. Sci."},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1504\/IJBIC.2016.074630","volume":"8","author":"H Wang","year":"2016","unstructured":"Wang, H., Wang, W.J., Sun, H.: Firefly algorithm with random attraction. Int. J. Bio-Inspired Comput. 8(1), 33\u201341 (2016)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"6","key":"7_CR20","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1504\/IJCSM.2016.081701","volume":"7","author":"G Yu","year":"2016","unstructured":"Yu, G.: An improved firefly algorithm based on probabilistic attraction. Int. J. Comput. Sci. Math. 7(6), 530\u2013536 (2016)","journal-title":"Int. J. Comput. Sci. Math."},{"issue":"5","key":"7_CR21","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1504\/IJBIC.2016.079575","volume":"8","author":"B Nasiri","year":"2016","unstructured":"Nasiri, B., Meybodi, M.R.: History-driven firefly algorithm for optimisation in dynamic and uncertain environments. Int. J. Bio-Inspired Comput. 8(5), 326\u2013339 (2016)","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.swevo.2013.06.001","volume":"13","author":"I Fister","year":"2013","unstructured":"Fister, I., Fister, I., Yang, X.S., Brest, J.: A comprehensive review of firefly algorithms. Swarm Evol. Comput. 13, 34\u201346 (2013)","journal-title":"Swarm Evol. Comput."},{"issue":"5\u20136","key":"7_CR23","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1108\/02644401211235834","volume":"29","author":"XS Yang","year":"2012","unstructured":"Yang, X.S., Gandomi, A.H.: Bat algorithm: a novel approach for global engineering optimization. Eng. Comput. 29(5\u20136), 464\u2013483 (2012)","journal-title":"Eng. Comput."},{"issue":"4","key":"7_CR24","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1504\/IJBIC.2016.078666","volume":"8","author":"X Cai","year":"2016","unstructured":"Cai, X., Gao, X.Z., Xue, Y.: Improved bat algorithm with optimal forage strategy and random disturbance strategy. Int. J. Bio-Inspired Comput. 8(4), 205\u2013214 (2016)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"2","key":"7_CR25","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1504\/IJBIC.2015.069304","volume":"7","author":"F Xue","year":"2015","unstructured":"Xue, F., Cai, Y., Cao, Y., Cui, Z., Li, F.: Optimal parameter settings for bat algorithm. Int. J. Bio-Inspired Comput. 7(2), 125\u2013128 (2015)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"2","key":"7_CR26","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.cor.2007.10.001","volume":"36","author":"M Laguna","year":"2009","unstructured":"Laguna, M., Duarte, A., Marti, R.: Hybridizing the cross-entropy method: an application to the max-cut problem. Comput. Oper. Res. 36(2), 487\u2013498 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"7_CR27","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10479-012-1133-2","volume":"196","author":"G Lin","year":"2012","unstructured":"Lin, G., Zhu, W.: A discrete dynamic convexized method for the max-cut problem. Ann. Oper. Res. 196(1), 371\u2013390 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"7_CR28","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"17","author":"P Festa","year":"2002","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Randomized heuristics for the max-cut problem. Optim. Method Softw. 17(6), 1033\u20131058 (2002)","journal-title":"Optim. Method Softw."},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-74769-7_33","volume-title":"Bio-Inspired Computational Intelligence and Applications","author":"J Wang","year":"2007","unstructured":"Wang, J.: A memetic algorithm with genetic particle swarm optimization and neural network for maximum cut problems. In: Li, K., Fei, M., Irwin, G.W., Ma, S. (eds.) LSMS 2007. LNCS, vol. 4688, pp. 297\u2013306. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74769-7_33"},{"issue":"12","key":"7_CR30","doi-asserted-by":"publisher","first-page":"14870","DOI":"10.1016\/j.eswa.2011.05.060","volume":"38","author":"J Wang","year":"2011","unstructured":"Wang, J., Zhou, Y., Yin, J.: Combining tabu hopfield network and estimation of distribution for unconstrained binary quadratic programming problem. Expert Syst. Appl. 38(12), 14870\u201314881 (2011)","journal-title":"Expert Syst. Appl."},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Lin, G., Guan, J.: An integrated method based on PSO and EDA for the max-cut problem. Comput. Intell. Neurosci. (2016). doi:10.1155\/2016\/3420671","DOI":"10.1155\/2016\/3420671"},{"issue":"5","key":"7_CR32","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/s10559-010-9256-4","volume":"46","author":"VP Shylo","year":"2010","unstructured":"Shylo, V.P., Shylo, O.V.: Solving the maxcut problem by the global equilibrium search. Cybern. Syst. Anal. 46(5), 744\u2013754 (2010)","journal-title":"Cybern. Syst. Anal."},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Yang, X.S., Deb, S.: Cuckoo search via levy flights. In: World Congress on Nature and Biologically Inspired Computing, pp. 210\u2013214 (2009)","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"7_CR34","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.jpdc.2016.10.011","volume":"103","author":"ZH Cui","year":"2017","unstructured":"Cui, Z.H., Sun, B., Wang, G.G., Xue, Y.: A novel oriented cuckoo search algorithm to improve DV-hop performance for cyber-physical systems. J. Parallel Distrib. Comput. 103, 42\u201352 (2017)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Zhang, M.Q., Wang, H., Cui, Z.H., Chen, J.J.: Hybrid multi-objective cuckoo search with dynamical local search. Memetic Comp. (2017). doi:10.1007\/s12293-017-0237-2","DOI":"10.1007\/s12293-017-0237-2"},{"issue":"3","key":"7_CR36","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1504\/IJCSM.2016.077857","volume":"7","author":"FX Li","year":"2016","unstructured":"Li, F.X., Cui, Z.H., Sun, B.: DV-hop localisation algorithm with DDICS. Int. J. Comput. Sci. Math. 7(3), 254\u2013262 (2016)","journal-title":"Int. J. Comput. Sci. Math."},{"issue":"6","key":"7_CR37","first-page":"1566","volume":"33","author":"DK Feng","year":"2013","unstructured":"Feng, D.K., Ruan, Q., Du, L.M.: Binary cuckoo search algorithm. J. Comput. Appl. 33(6), 1566\u20131570 (2013). (in Chinese)","journal-title":"J. Comput. Appl."},{"issue":"13","key":"7_CR38","doi-asserted-by":"publisher","first-page":"3718","DOI":"10.1016\/j.cam.2011.01.015","volume":"235","author":"FM Xu","year":"2011","unstructured":"Xu, F.M., Ma, X.S., Chen, B.L.: A new lagrangian net algorithm for solving max-bisection problems. J. Comput. Appl. Math. 235(13), 3718\u20133723 (2011)","journal-title":"J. Comput. Appl. Math."}],"container-title":["IFIP Advances in Information and Communication Technology","Intelligence Science I"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68121-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:14:55Z","timestamp":1709813695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-68121-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319681207","9783319681214"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68121-4_7","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"27 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligence Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icis2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cie.shmtu.edu.cn\/icis-2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}