{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T12:03:32Z","timestamp":1722945812227},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T00:00:00Z","timestamp":1421107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10489-014-0642-x","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T01:41:32Z","timestamp":1421026892000},"page":"32-48","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A mnemonic shuffled frog leaping algorithm with cooperation and mutation"],"prefix":"10.1007","volume":"43","author":[{"given":"Hong-bo","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ke-peng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xu-yan","family":"Tu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,13]]},"reference":[{"key":"642_CR1","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(210)","volume":"129","author":"M Eusuff","year":"2003","unstructured":"Eusuff M, Lansey K (2003) Optimization of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Plan Manag 129:210\u2013225","journal-title":"J Water Resour Plan Manag"},{"key":"642_CR2","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.cie.2007.06.007","volume":"53","author":"A Rahimi-Vahed","year":"2007","unstructured":"Rahimi-Vahed A, Mirzaei AH (2007) A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem. Comput Ind Eng 53:642\u2013666","journal-title":"Comput Ind Eng"},{"key":"642_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/03052150500384759","volume":"38","author":"M Eusuff","year":"2006","unstructured":"Eusuff M, Lansey K (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38:129\u2013154","journal-title":"Eng Optim"},{"key":"642_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.ins.2010.07.016","volume":"192","author":"X Li","year":"2012","unstructured":"Li X, Luo J (2012) An improved shuffled frog-leaping algorithm with external optimization for continuous optimization. Inf Sci 192:143\u2013151","journal-title":"Inf Sci"},{"key":"642_CR5","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/j.ejor.2007.05.008","volume":"188","author":"MR Chen","year":"2008","unstructured":"Chen MR, Lu YZ (2008) A novel elitist multi-objective optimization algorithm: multi-objectiveextremal optimization. Eur J Oper Res 188:637\u2013651","journal-title":"Eur J Oper Res"},{"key":"642_CR6","unstructured":"Wang QS, Sun XY (2011) A modified shuffled frog leaping algorithm with convergence of update process in local search. In: International conference on instrumentation, measurement, computer communication and control, pp 1046\u20131019"},{"key":"642_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.amc.2014.04.035","volume":"239","author":"MA Ahandani","year":"2014","unstructured":"Ahandani MA (2014) A diversified shuffled frog leaping: an application for parameter identification. Appl Math Comput 239:1\u201316","journal-title":"Appl Math Comput"},{"key":"642_CR8","doi-asserted-by":"crossref","unstructured":"Wang L, Gong Y (2013) A fast shuffled frog leaping algorithm. In: 9th international conference on natural computation (ICNC), pp 369\u2013373","DOI":"10.1109\/ICNC.2013.6818003"},{"key":"642_CR9","doi-asserted-by":"crossref","unstructured":"Li YH, Zhou JZ (2008) The chaos-based shuffled frog leaping algorithm and its application. In: Proceedings of 4th international conference on natural computation, pp 481\u2013485","DOI":"10.1109\/ICNC.2008.242"},{"key":"642_CR10","doi-asserted-by":"crossref","unstructured":"Luo P, Lu Q, Wu CX (2011) Modified shuffled frog leaping algorithm based on new searching strategy. In: 7th international conference on natural computation, pp 1346\u20131350","DOI":"10.1109\/ICNC.2011.6022273"},{"key":"642_CR11","doi-asserted-by":"crossref","first-page":"4244","DOI":"10.1016\/j.asoc.2013.07.006","volume":"13","author":"R Roy","year":"2013","unstructured":"Roy R, Roy P, Chakrabarti A (2013) Modified shuffled frog leaping algorithm with genetic algorithm crossover for solving economic load dispatch problem with valve-point effect. Appl Soft Comput 13:4244\u20134254","journal-title":"Appl Soft Comput"},{"key":"642_CR12","first-page":"276","volume":"31","author":"TY Liu","year":"2014","unstructured":"Liu TY (2014) Fuzzy clustering algorithm based on chaotic and dynamic mutation shuffled frog leaping algorithm. Comput Appl Soft 31:276\u2013279","journal-title":"Comput Appl Soft"},{"key":"642_CR13","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1016\/j.eswa.2010.08.009","volume":"38","author":"S Kiranyaz","year":"2011","unstructured":"Kiranyaz S, Pulkkinen J, Gabbouj M (2011) Multi-dimensional particle swarm optimization in dynamic environments. Expert Syst Appl 38:2212\u20132223","journal-title":"Expert Syst Appl"},{"key":"642_CR14","doi-asserted-by":"crossref","unstructured":"Bijami E, Farsangi M (2014) An improved adaptive shuffled frog leaping algorithm to solve various non-smooth economic dispatch problems in power systems. IEEE, pp 14\u201319","DOI":"10.1109\/IranianCIS.2014.6802542"},{"key":"642_CR15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/15732470500254535","volume":"3","author":"E Elbeltagi","year":"2007","unstructured":"Elbeltagi E (2007) A modified shuffled frog-leaping optimization algorithm: application to project management. Struct Infrastruct Eng 3:53\u201360","journal-title":"Struct Infrastruct Eng"},{"key":"642_CR16","doi-asserted-by":"crossref","unstructured":"TanUai F (2012) Improved shuffled frog leaping algorithm and its application in node localization of wireless sensor network. Intell Autom Soft Comput:807\u2013818","DOI":"10.1080\/10798587.2012.10643290"},{"key":"642_CR17","doi-asserted-by":"crossref","unstructured":"Zhu GY, Zhangm WB (2014) An improved shuffled frog-leaping algorithm to optimize component pick-and-place sequencing optimization. Expert Syst Appl:2535\u20132545","DOI":"10.1016\/j.eswa.2014.04.038"},{"key":"642_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1504\/IJAIP.2013.054670","volume":"5","author":"H Banati","year":"2013","unstructured":"Banati H, Mehta S (2013) Improved shuffled frog leaping algorithm for continuous optimization adapted SEVO toolbox. Adv Intell Paradigms 5:31\u201344","journal-title":"Adv Intell Paradigms"},{"key":"642_CR19","unstructured":"Panigrahi BK (2011) A parallel hybridization of clonal selection with shuffled frog leaping algorithm for solving global optimization problems (P-AISFLA). Springer-Verlag-Berlin-Heidelberg, pp 211\u2013222"},{"key":"642_CR20","unstructured":"Ling YX, Wang M, Wang SY (2013) An effective shuffled frog-leaping algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Springer-Verlag-London, pp 1529\u20131537"},{"key":"642_CR21","doi-asserted-by":"crossref","unstructured":"Bhattacharjee KK, Sarmah SP (2014) Shuffled frog leaping algorithm and its application to 0\/1 knapsack problem. Appl Soft Comput:253\u2013263","DOI":"10.1016\/j.asoc.2014.02.010"},{"key":"642_CR22","doi-asserted-by":"crossref","unstructured":"Sharma H, Bansal JC, Arya KV (2014) Self balanced differential evolution. J Comput Sci:312\u2013323","DOI":"10.1016\/j.jocs.2012.12.002"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0642-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0642-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0642-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:25:55Z","timestamp":1559154355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0642-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,13]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["642"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0642-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,13]]}}}