{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:46:46Z","timestamp":1740160006656,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T00:00:00Z","timestamp":1516579200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Syst Assur Eng Manag"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s13198-018-0696-y","type":"journal-article","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T12:22:41Z","timestamp":1516623761000},"page":"972-986","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A novel cuckoo search technique for solving discrete optimization problems"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9803-0050","authenticated-orcid":false,"given":"Ashish","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narendra S.","family":"Chaudhari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,22]]},"reference":[{"issue":"1","key":"696_CR1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s12293-013-0128-0","volume":"6","author":"JC Bansal","year":"2014","unstructured":"Bansal JC, Sharma H, Jadon SS, Clerc M (2014) Spider monkey optimization algorithm for numerical optimization. Memet Comput 6(1):31\u201347","journal-title":"Memet Comput"},{"key":"696_CR2","doi-asserted-by":"crossref","unstructured":"Bastos\u00a0Filho CJ, de\u00a0Lima\u00a0Neto FB, Lins AJ, Nascimento AI, Lima MP (2008) A novel search algorithm based on fish school behavior. In: IEEE international conference on systems, man and cybernetics, 2008. SMC 2008. IEEE, pp 2646\u20132651","DOI":"10.1109\/ICSMC.2008.4811695"},{"key":"696_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.asoc.2014.10.004","volume":"26","author":"AK Bhateja","year":"2015","unstructured":"Bhateja AK, Bhateja A, Chaudhury S, Saxena P (2015) Cryptanalysis of vigenere cipher using cuckoo search. Appl Soft Comput 26:315\u2013324","journal-title":"Appl Soft Comput"},{"key":"696_CR4","doi-asserted-by":"crossref","unstructured":"Boryczka U, Dworak K (2014a) Cryptanalysis of transposition cipher using evolutionary algorithms. In: Hwang D, Jung JJ, Nguyen NT (eds) Computational collective intelligence. Technologies and applications. ICCCI 2014. Lecture Notes in Computer Science, Springer, vol 8733, pp 623\u2013632","DOI":"10.1007\/978-3-319-11289-3_63"},{"key":"696_CR5","doi-asserted-by":"crossref","unstructured":"Boryczka U, Dworak K (2014b) Genetic transformation techniques in cryptanalysis. In: Nguyen NT, Attachoo B, Trawi\u0144ski B, Somboonviwat K (eds) Intelligent information and database systems. ACIIDS 2014. Lecture Notes in Computer Science, vol 8398. Springer, pp 147\u2013156","DOI":"10.1007\/978-3-319-05458-2_16"},{"key":"696_CR6","doi-asserted-by":"crossref","unstructured":"Carneiro RF, Bastos-Filho CJ (2016) Improving the binary fish school search algorithm for feature selection. In: IEEE Latin American conference on computational intelligence (LA-CCI), 2016. IEEE, pp 1\u20136","DOI":"10.1109\/LA-CCI.2016.7885708"},{"issue":"2","key":"696_CR7","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/TEVC.2013.2256427","volume":"18","author":"S Chetty","year":"2014","unstructured":"Chetty S, Adewumi AO (2014) Comparison study of swarm intelligence techniques for the annual crop planning problem. IEEE Trans Evolut Comput 18(2):258\u2013268","journal-title":"IEEE Trans Evolut Comput"},{"key":"696_CR8","doi-asserted-by":"crossref","unstructured":"Clark A (1994) Modern optimisation algorithms for cryptanalysis. In: Proceedings of the 1994 second Australian and New Zealand conference on intelligent information systems, 1994. IEEE, pp 258\u2013262","DOI":"10.1109\/ANZIIS.1994.396969"},{"key":"696_CR9","unstructured":"Clark AJ (1998) Optimisation heuristics for cryptology. Ph.D. thesis"},{"issue":"16","key":"696_CR10","doi-asserted-by":"crossref","first-page":"6374","DOI":"10.1016\/j.eswa.2013.05.041","volume":"40","author":"E Cuevas","year":"2013","unstructured":"Cuevas E, Cienfuegos M, Zald\u00edvar D, P\u00e9rez-Cisneros M (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40(16):6374\u20136384","journal-title":"Expert Syst Appl"},{"issue":"3","key":"696_CR11","doi-asserted-by":"crossref","first-page":"1798","DOI":"10.1109\/TLA.2012.6222587","volume":"10","author":"M Danziger","year":"2012","unstructured":"Danziger M, Henriques MAA (2012) Computational intelligence applied on cryptology: a brief review. IEEE Latin Am Trans 10(3):1798\u20131810","journal-title":"IEEE Latin Am Trans"},{"key":"696_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.cor.2015.01.005","volume":"60","author":"P Dasgupta","year":"2015","unstructured":"Dasgupta P, Das S (2015) A discrete inter-species cuckoo search for flowshop scheduling problems. Comput Oper Res 60:111\u2013120","journal-title":"Comput Oper Res"},{"issue":"17","key":"696_CR13","doi-asserted-by":"crossref","first-page":"7958","DOI":"10.1016\/j.eswa.2014.06.048","volume":"41","author":"KM Faraoun","year":"2014","unstructured":"Faraoun KM (2014) A genetic strategy to design cellular automata based block ciphers. Expert Syst Appl 41(17):7958\u20137967","journal-title":"Expert Syst Appl"},{"key":"696_CR14","volume-title":"Genetic algorithms","author":"DE Goldberg","year":"2006","unstructured":"Goldberg DE (2006) Genetic algorithms. Pearson Education India, Delhi"},{"key":"696_CR15","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010749","volume-title":"Handbook of approximation algorithms and metaheuristics","author":"TF Gonzalez","year":"2007","unstructured":"Gonzalez TF (2007) Handbook of approximation algorithms and metaheuristics. CRC Press, Boca Raton"},{"issue":"1","key":"696_CR16","first-page":"140","volume":"3","author":"M Heydari","year":"2014","unstructured":"Heydari M, Senejani MN (2014) Automated cryptanalysis of transposition ciphers using cuckoo search algorithm. Int J Comput Sci Mob Comput 3(1):140\u2013149","journal-title":"Int J Comput Sci Mob Comput"},{"key":"696_CR17","doi-asserted-by":"crossref","DOI":"10.1515\/9781400885626","volume-title":"The mathematics of secrets: cryptography from caesar ciphers to digital encryption","author":"J Holden","year":"2017","unstructured":"Holden J (2017) The mathematics of secrets: cryptography from caesar ciphers to digital encryption. Princeton University Press, Princeton"},{"key":"696_CR18","doi-asserted-by":"crossref","unstructured":"Jain A, Chaudhari NS (2014) Cryptanalytic results on knapsack cryptosystem using binary particle swarm optimization. In: International joint conference SOCO14-CISIS14-ICEUTE14, Springer, Berlin, pp 375\u2013384","DOI":"10.1007\/978-3-319-07995-0_37"},{"key":"696_CR19","doi-asserted-by":"crossref","unstructured":"Jain A, Chaudhari NS (2015a) Evolving highly nonlinear balanced boolean functions with improved resistance to DPA attacks. In: Network and system security, Springer, Berlin, pp 316\u2013330","DOI":"10.1007\/978-3-319-25645-0_21"},{"key":"696_CR20","doi-asserted-by":"crossref","unstructured":"Jain A, Chaudhari NS (2015b) A new heuristic based on the cuckoo search for cryptanalysis of substitution ciphers. In: Neural information processing, Springer, Berlin, pp 206\u2013215","DOI":"10.1007\/978-3-319-26535-3_24"},{"key":"696_CR21","doi-asserted-by":"crossref","unstructured":"Jain A, Chaudhari NS (2017a) An improved genetic algorithm for developing deterministic OTP key generator. Complexity, Wiley & Hindawi (7436709, 2017), pp 1\u201317","DOI":"10.1155\/2017\/7436709"},{"key":"696_CR22","doi-asserted-by":"publisher","unstructured":"Jain A, Chaudhari NS (2017b) A novel cuckoo search strategy for automated cryptanalysis: a case study on the reduced complex knapsack cryptosystem, Int J Syst Assur Eng Manag 1\u201320. https:\/\/doi.org\/10.1007\/s13198-017-0690-9","DOI":"10.1007\/s13198-017-0690-9"},{"key":"696_CR23","doi-asserted-by":"crossref","unstructured":"Jhajharia S, Mishra S, Bali S (2013) Public key cryptography using neural networks and genetic algorithms. In: 2013 Sixth international conference on contemporary computing (IC3). IEEE, pp 137\u2013142","DOI":"10.1109\/IC3.2013.6612177"},{"key":"696_CR24","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Techical report, Technical report-tr06, Erciyes university, engineering faculty, computer engineering department"},{"key":"696_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-52156-5","volume-title":"Genetic algorithm essentials","author":"O Kramer","year":"2017","unstructured":"Kramer O (2017) Genetic algorithm essentials, vol 679. Springer, Berlin"},{"issue":"3","key":"696_CR26","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1016\/j.apm.2013.07.038","volume":"38","author":"JQ Li","year":"2014","unstructured":"Li JQ, Pan QK, Tasgetiren MF (2014) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Model 38(3):1111\u20131132","journal-title":"Appl Math Model"},{"issue":"2","key":"696_CR27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1109\/TEM.2016.2645790","volume":"64","author":"X Li","year":"2017","unstructured":"Li X, Ma S (2017) Multiobjective discrete artificial bee colony algorithm for multiobjective permutation flow shop scheduling problem with sequence dependent setup times. IEEE Trans Eng Manag 64(2):149\u2013165","journal-title":"IEEE Trans Eng Manag"},{"issue":"5","key":"696_CR28","doi-asserted-by":"crossref","first-page":"4677","DOI":"10.1103\/PhysRevE.49.4677","volume":"49","author":"RN Mantegna","year":"1994","unstructured":"Mantegna RN (1994) Fast, accurate algorithm for numerical simulation of levy stable stochastic processes. Phys Rev E 49(5):4677","journal-title":"Phys Rev E"},{"key":"696_CR29","doi-asserted-by":"crossref","unstructured":"Marinakis Y, Marinaki M, Migdalas A (2016) A hybrid discrete artificial bee colony algorithm for the multicast routing problem. In: European conference on the applications of evolutionary computation, Springer, Berlin, pp 203\u2013218","DOI":"10.1007\/978-3-319-31204-0_14"},{"issue":"2","key":"696_CR30","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1080\/0161-119391867863","volume":"17","author":"RA Matthews","year":"1993","unstructured":"Matthews RA (1993) The use of genetic algorithms in cryptanalysis. Cryptologia 17(2):187\u2013201","journal-title":"Cryptologia"},{"key":"696_CR31","doi-asserted-by":"crossref","DOI":"10.1201\/9781439821916","volume-title":"Handbook of applied cryptography","author":"AJ Menezes","year":"1996","unstructured":"Menezes AJ, Van Oorschot PC, Vanstone SA (1996) Handbook of applied cryptography. CRC Press, Boca Raton"},{"key":"696_CR32","volume-title":"Genetic algorithms + data structures = evolution programs","author":"Z Michalewicz","year":"2013","unstructured":"Michalewicz Z (2013) Genetic algorithms + data structures = evolution programs. Springer, Berlin"},{"key":"696_CR33","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1063\/1.2817338","volume":"953","author":"A Mucherino","year":"2007","unstructured":"Mucherino A, Seref O (2007) Monkey search: a novel metaheuristic search for global optimization. AIP Conf Proc 953:162\u2013173","journal-title":"AIP Conf Proc"},{"key":"696_CR34","volume-title":"Fundamentals of statistics","author":"H Mulholland","year":"2013","unstructured":"Mulholland H, Jones CR (2013) Fundamentals of statistics. Springer, Berlin"},{"key":"696_CR35","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang XS, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u201371","journal-title":"Eng Appl Artif Intell"},{"issue":"18","key":"696_CR36","doi-asserted-by":"crossref","first-page":"5295","DOI":"10.1007\/s00500-016-2114-1","volume":"21","author":"E Osaba","year":"2017","unstructured":"Osaba E, Yang XS, Diaz F, Onieva E, Masegosa AD, Perallos A (2017) A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft Comput 21(18):5295\u20135308","journal-title":"Soft Comput"},{"issue":"7\u20138","key":"696_CR37","doi-asserted-by":"crossref","first-page":"1659","DOI":"10.1007\/s00521-013-1402-2","volume":"24","author":"A Ouaarab","year":"2014","unstructured":"Ouaarab A, Ahiod B, Yang XS (2014a) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 24(7\u20138):1659\u20131669","journal-title":"Neural Comput Appl"},{"key":"696_CR38","doi-asserted-by":"crossref","unstructured":"Ouaarab A, Ahiod B, Yang XS (2014) Improved and discrete cuckoo search for solving the travelling salesman problem. In: Yang XS (eds) Cuckoo search and firefly algorithm. Studies in Computational Intelligence, vol 516. Springer, Cham","DOI":"10.1007\/978-3-319-02141-6_4"},{"issue":"3","key":"696_CR39","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.eij.2017.02.003","volume":"18","author":"ME Riffi","year":"2017","unstructured":"Riffi ME, Saji Y, Barkatou M (2017) Incorporating a modified uniform crossover and 2-exchange neighborhood mechanism in a discrete bat algorithm to solve the quadratic assignment problem. Egypt Inform J 18(3):221\u2013232","journal-title":"Egypt Inform J"},{"issue":"1","key":"696_CR40","first-page":"22","volume":"4","author":"AT Sadiq","year":"2014","unstructured":"Sadiq AT, Ali L, Kareem H (2014) Attacking transposition cipher using improved cuckoo search. J Adv Comput Sci Technol Res 4(1):22\u201332","journal-title":"J Adv Comput Sci Technol Res"},{"issue":"7","key":"696_CR41","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1007\/s00521-015-1978-9","volume":"27","author":"Y Saji","year":"2016","unstructured":"Saji Y, Riffi ME (2016) A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput Appl 27(7):1853\u20131866","journal-title":"Neural Comput Appl"},{"issue":"3\u20134","key":"696_CR42","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1504\/IJMHEUR.2016.081156","volume":"5","author":"A Sharma","year":"2016","unstructured":"Sharma A, Sharma H, Bhargava A, Sharma N (2016) Optimal design of pida controller for induction motor using spider monkey optimization algorithm. Int J Metaheuristics 5(3\u20134):278\u2013290","journal-title":"Int J Metaheuristics"},{"key":"696_CR43","doi-asserted-by":"crossref","unstructured":"Shlesinger MF, Zaslavsky GM, Frisch U (1994) L\u00e9vy flights and related topics in physics. In: Nice, 27\u201330 June, Springer, Berlin","DOI":"10.1007\/3-540-59222-9"},{"issue":"7\u20138","key":"696_CR44","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1007\/s00521-011-0799-8","volume":"22","author":"M Sokouti","year":"2013","unstructured":"Sokouti M, Sokouti B, Pashazadeh S, Feizi-Derakhshi MR, Haghipour S (2013) Genetic-based random key generator (grkg): a new method for generating more-random keys for one-time pad cryptosystem. Neural Comput Appl 22(7\u20138):1667\u20131675","journal-title":"Neural Comput Appl"},{"key":"696_CR45","doi-asserted-by":"crossref","unstructured":"Song J, Yang F, Wang M, Zhang H (2008) Cryptanalysis of transposition cipher using simulated annealing genetic algorithm. In: Advances in Computation and Intelligence, Springer, Berlin, pp 795\u2013802","DOI":"10.1007\/978-3-540-92137-0_87"},{"key":"696_CR46","doi-asserted-by":"crossref","unstructured":"Soto R, Crawford B, Galleguillos C, Barraza J, Lizama S, Mu\u00f1oz A, Vilches J, Misra S, Paredes F (2015) Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem. In: Computational science and its applications\u2013ICCSA 2015, Springer, Berlin, pp 187\u2013202","DOI":"10.1007\/978-3-319-21404-7_14"},{"key":"696_CR47","doi-asserted-by":"crossref","DOI":"10.1201\/9781420057133","volume-title":"Cryptography: theory and practice","author":"DR Stinson","year":"2005","unstructured":"Stinson DR (2005) Cryptography: theory and practice. CRC Press, Boca Raton"},{"issue":"7","key":"696_CR48","first-page":"75","volume":"79","author":"R Toemeh","year":"2007","unstructured":"Toemeh R, Arumugam S (2007) Breaking transposition cipher with genetic algorithm. Electron Elect Eng 79(7):75\u201378","journal-title":"Electron Elect Eng"},{"issue":"6","key":"696_CR49","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1016\/j.physleta.2012.01.009","volume":"376","author":"Y Wang","year":"2012","unstructured":"Wang Y, Wong KW, Li C, Li Y (2012) A novel method to design s-box based on chaotic map and genetic algorithm. Phys Lett A 376(6):827\u2013833","journal-title":"Phys Lett A"},{"issue":"2","key":"696_CR50","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1504\/IJBIC.2010.032124","volume":"2","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010a) Firefly algorithm, stochastic test functions and design optimisation. Int J Bio Inspir Comput 2(2):78\u201384","journal-title":"Int J Bio Inspir Comput"},{"key":"696_CR51","doi-asserted-by":"crossref","unstructured":"Yang XS (2010b) A new metaheuristic bat-inspired algorithm. In: Gonz\u00e1lez JR, Pelta DA, Cruz C, Terrazas G, Krasnogor N (eds) Nature inspired cooperative strategies for optimization (NICSO 2010). Studies in Computational Intelligence, Springer, vol 284, pp 65\u201374","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"696_CR52","volume-title":"Nature-inspired optimization algorithms","author":"XS Yang","year":"2014","unstructured":"Yang XS (2014) Nature-inspired optimization algorithms. Elsevier, Amsterdam"},{"key":"696_CR53","unstructured":"Yang XS, Deb S (2009) Cuckoo search via L\u00e9vy flights. In: World congress on nature and biologically inspired computing, 2009 (NaBIC 2009). IEEE, pp 210\u2013214"},{"issue":"4","key":"696_CR54","first-page":"330","volume":"1","author":"XS Yang","year":"2010","unstructured":"Yang XS, Deb S (2010) Engineering optimisation by cuckoo search. Intern J Math Model Numer Optim 1(4):330\u2013343","journal-title":"Intern J Math Model Numer Optim"},{"key":"696_CR55","volume-title":"Swarm intelligence and bio-inspired computation: theory and applications","author":"XS Yang","year":"2013","unstructured":"Yang XS, Cui Z, Xiao R, Gandomi AH, Karamanoglu M (2013) Swarm intelligence and bio-inspired computation: theory and applications. Elsevier, Waltham"},{"issue":"1","key":"696_CR56","first-page":"24","volume":"3","author":"M Yazdani","year":"2016","unstructured":"Yazdani M, Jolai F (2016) Lion optimization algorithm (loa): a nature-inspired metaheuristic algorithm. J Comput Des Eng 3(1):24\u201336","journal-title":"J Comput Des Eng"},{"issue":"9","key":"696_CR57","doi-asserted-by":"crossref","first-page":"2795","DOI":"10.1007\/s00521-016-2204-0","volume":"28","author":"L Zhang","year":"2017","unstructured":"Zhang L, Shan L, Wang J (2017) Optimal feature selection using distance-based discrete firefly algorithm with mutual information criterion. Neural Comput Appl 28(9):2795\u20132808","journal-title":"Neural Comput Appl"},{"key":"696_CR58","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ins.2017.08.067","volume":"421","author":"Y Zhong","year":"2017","unstructured":"Zhong Y, Lin J, Wang L, Zhang H (2017) Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Inf Sci 421:70\u201384","journal-title":"Inf Sci"}],"container-title":["International Journal of System Assurance Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13198-018-0696-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-018-0696-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-018-0696-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T00:11:43Z","timestamp":1660349503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13198-018-0696-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,22]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["696"],"URL":"https:\/\/doi.org\/10.1007\/s13198-018-0696-y","relation":{},"ISSN":["0975-6809","0976-4348"],"issn-type":[{"type":"print","value":"0975-6809"},{"type":"electronic","value":"0976-4348"}],"subject":[],"published":{"date-parts":[[2018,1,22]]}}}