{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T15:49:02Z","timestamp":1766159342968,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,11]],"date-time":"2024-02-11T00:00:00Z","timestamp":1707609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,11]],"date-time":"2024-02-11T00:00:00Z","timestamp":1707609600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10878-023-01102-w","type":"journal-article","created":{"date-parts":[[2024,2,11]],"date-time":"2024-02-11T17:02:06Z","timestamp":1707670926000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improved shuffled Frog leaping algorithm with unsupervised population partitioning strategies for complex optimization problems"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2601-6284","authenticated-orcid":false,"given":"Shikha","family":"Mehta","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,11]]},"reference":[{"key":"1102_CR1","doi-asserted-by":"publisher","first-page":"681","DOI":"10.3233\/IFS-120759","volume":"26","author":"R Azizipanah-Abarghooee","year":"2014","unstructured":"Azizipanah-Abarghooee R, Narimani MR, Bahmani-Firouzi B, Niknam T (2014) Modified shuffled frog leaping algorithm for multi-objective optimal power flow with facts devices. J Intell Fuzzy Syst 26:681\u2013692. https:\/\/doi.org\/10.3233\/IFS-120759","journal-title":"J Intell Fuzzy Syst"},{"key":"1102_CR2","doi-asserted-by":"publisher","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 optimisation adapted sevo toolbox. Int J Adv Intell Paradigms 5:31\u201344. https:\/\/doi.org\/10.1504\/IJAIP.2013.054670","journal-title":"Int J Adv Intell Paradigms"},{"key":"1102_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103540","volume":"90","author":"J Cai","year":"2020","unstructured":"Cai J, Zhou R, Lei D (2020) Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks. Eng Appl Artif Intell 90:103540. https:\/\/doi.org\/10.1016\/j.engappai.2020.103540","journal-title":"Eng Appl Artif Intell"},{"key":"1102_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2020.1780333","volume":"59","author":"J Cai","year":"2020","unstructured":"Cai J, Lei D, Li M (2020) A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop. Int J Prod Res 59:1\u201318. https:\/\/doi.org\/10.1080\/00207543.2020.1780333","journal-title":"Int J Prod Res"},{"key":"1102_CR5","doi-asserted-by":"publisher","first-page":"100672","DOI":"10.1016\/j.swevo.2020.100672","volume":"55","author":"R Chaudhary","year":"2020","unstructured":"Chaudhary R, Banati H (2020) Study of population partitioning techniques on efficiency of swarm algorithms. Swarm Evol Comput 55:100672. https:\/\/doi.org\/10.1016\/j.swevo.2020.100672","journal-title":"Swarm Evol Comput"},{"key":"1102_CR6","unstructured":"Chen Q, Liu B, Zhang QF, Liang JJ, Suganthan PN, Qu B (2015) Problem definitions and evaluation criteria for cec 2015 special session on bound constrained single-objective computationally expensive numerical optimization"},{"key":"1102_CR7","doi-asserted-by":"publisher","unstructured":"Daoden K, Thaiupthump T (2016) A modified shuffled frog leaping algorithm using truncated gaussian distribution in Frog\u2019s position updating process, pp 965\u2013974. https:\/\/doi.org\/10.1007\/978-981-10-0557-2_92","DOI":"10.1007\/978-981-10-0557-2_92"},{"key":"1102_CR8","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.swevo.2019.04.008","volume":"48","author":"J Del Ser","year":"2019","unstructured":"Del Ser J, Osaba E, Molina D, Yang X-S, Salcedo-Sanz S, Camacho D, Das S, Suganthan PN, Coello Coello CA, Herrera F (2019) Bio-inspired computation: where we stand and what\u2019s next. Swarm Evol Comput 48:220\u2013250. https:\/\/doi.org\/10.1016\/j.swevo.2019.04.008","journal-title":"Swarm Evol Comput"},{"key":"1102_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2013.03.008","volume":"50","author":"W Ding","year":"2013","unstructured":"Ding W, Wang J (2013) A novel approach to minimum attribute reduction based on quantum-inspired self-adaptive cooperative co-evolution. Knowl Based Syst 50:1\u201313. https:\/\/doi.org\/10.1016\/j.knosys.2013.03.008","journal-title":"Knowl Based Syst"},{"key":"1102_CR10","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BF00939380","volume":"76","author":"Q Duan","year":"1993","unstructured":"Duan Q, Gupta V, Sorooshian S (1993) A shuffled complex evolution approach for effective and efficient global minimization. J Optim Theory Appl 76:501\u2013521. https:\/\/doi.org\/10.1007\/BF00939380","journal-title":"J Optim Theory Appl"},{"key":"1102_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2018\/7896926","volume":"2018","author":"X Duan","year":"2018","unstructured":"Duan X, Niu T, Huang Q (2018) An improved shuffled frog leaping algorithm and its application in dynamic emergency vehicle dispatching. Math Probl Eng 2018:1\u201334. https:\/\/doi.org\/10.1155\/2018\/7896926","journal-title":"Math Probl Eng"},{"key":"1102_CR12","doi-asserted-by":"publisher","unstructured":"Duarte G, Lemonge A, Goliatt L (2017) A dynamic migration policy to the island model, pp 1135\u20131142. https:\/\/doi.org\/10.1109\/CEC.2017.7969434","DOI":"10.1109\/CEC.2017.7969434"},{"issue":"2","key":"1102_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/03052150500384759","volume":"38","author":"M Eusuff","year":"2006","unstructured":"Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129\u2013154. https:\/\/doi.org\/10.1080\/03052150500384759","journal-title":"Eng Optim"},{"key":"1102_CR14","doi-asserted-by":"publisher","unstructured":"Guo Y, Tian X, Fang G, Xu Y-P (2020) Many-objective optimization with improved shuffled frog leaping algorithm for inter-basin water transfers Adv. Water Resour 138:103531. https:\/\/doi.org\/10.1016\/j.advwatres.2020.103531","DOI":"10.1016\/j.advwatres.2020.103531"},{"key":"1102_CR15","doi-asserted-by":"publisher","unstructured":"Jaballah S, Rouis K, Ben\u00a0Abdallah F, Tahar J (2014) An improved shuffled frog leaping algorithm with a fast search strategy for optimization problems, pp 23\u201327. https:\/\/doi.org\/10.1109\/ICCP.2014.6936975","DOI":"10.1109\/ICCP.2014.6936975"},{"key":"1102_CR16","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.ins.2014.08.050","volume":"294","author":"N Jaddi","year":"2015","unstructured":"Jaddi N, Abdullah S, Hamdan A (2015) Multi-population cooperative bat algorithm-based optimization of artificial neural network model. Inf Sci 294:628\u2013644. https:\/\/doi.org\/10.1016\/j.ins.2014.08.050","journal-title":"Inf Sci"},{"key":"1102_CR17","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.ijepes.2014.07.073","volume":"64","author":"M Jadidoleslam","year":"2015","unstructured":"Jadidoleslam M, Ebrahimi A (2015) Reliability constrained generation expansion planning by a modified shuffled frog leaping algorithm. Int J Electr Power Energy Syst 64:743\u2013751. https:\/\/doi.org\/10.1016\/j.ijepes.2014.07.073","journal-title":"Int J Electr Power Energy Syst"},{"key":"1102_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jpdc.2016.11.003","volume":"101","author":"P Jaggi","year":"2016","unstructured":"Jaggi P, Mehta S (2016) Resource provisioning and work flow scheduling in clouds using augmented shuffled frog leaping algorithm. J Parallel Distrib Comput 101:3. https:\/\/doi.org\/10.1016\/j.jpdc.2016.11.003","journal-title":"J Parallel Distrib Comput"},{"key":"1102_CR19","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00500-019-04484-4","volume":"24","author":"M Karpagam","year":"2020","unstructured":"Karpagam M, Geetha K, Chinnasamy R (2020) A modified shuffled frog leaping algorithm for scientific workflow scheduling using clustering techniques. Soft Comput 24:4. https:\/\/doi.org\/10.1007\/s00500-019-04484-4","journal-title":"Soft Comput"},{"key":"1102_CR20","doi-asserted-by":"publisher","unstructured":"Kashtiban AM, Ahandani MA (2009) Various strategies for partitioning of memeplexes in shuffled frog leaping algorithm. In: 2009 14th International CSI Computer Conference, pp 576\u2013581. https:\/\/doi.org\/10.1109\/CSICC.2009.5349641","DOI":"10.1109\/CSICC.2009.5349641"},{"key":"1102_CR21","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1016\/j.swevo.2018.09.002","volume":"44","author":"JK Kordestani","year":"2019","unstructured":"Kordestani JK, Ranginkaman AE, Meybodi MR, Novoa-Hern\u00e1ndez P (2019) A novel framework for improving multi-population algorithms for dynamic optimization problems, (2019) A scheduling approach. Swarm Evol Comput 44:788\u2013805. https:\/\/doi.org\/10.1016\/j.swevo.2018.09.002","journal-title":"Swarm Evol Comput"},{"key":"1102_CR22","doi-asserted-by":"publisher","unstructured":"Laessig J, Sudholt D (2010) The benefit of migration in parallel evolutionary algorithms, pp 1105\u20131112. https:\/\/doi.org\/10.1145\/1830483.1830687","DOI":"10.1145\/1830483.1830687"},{"key":"1102_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/0305215X.2019.1674295","volume":"52","author":"D Lei","year":"2019","unstructured":"Lei D, Wang T (2019) Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping. Eng Optim 52:1\u201314. https:\/\/doi.org\/10.1080\/0305215X.2019.1674295","journal-title":"Eng Optim"},{"key":"1102_CR24","doi-asserted-by":"publisher","unstructured":"Li X (2004) Adaptively choosing neighbourhood bests using species in a particle swarm optimizer for multimodal function optimization, vol. 3102. https:\/\/doi.org\/10.1007\/978-3-540-24854-5_10","DOI":"10.1007\/978-3-540-24854-5_10"},{"issue":"4","key":"1102_CR25","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1109\/TEVC.2011.2169966","volume":"16","author":"C Li","year":"2012","unstructured":"Li C, Yang S (2012) A general framework of multipopulation methods with clustering in undetectable dynamic environments. IEEE Trans Evol Comput 16(4):556\u2013577. https:\/\/doi.org\/10.1109\/TEVC.2011.2169966","journal-title":"IEEE Trans Evol Comput"},{"key":"1102_CR26","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.swevo.2018.04.011","volume":"44","author":"H Ma","year":"2019","unstructured":"Ma H, Shen S, Yu M, Yang Z, Fei M, Zhou H (2019) Multi-population techniques in nature inspired optimization algorithms: a comprehensive survey. Swarm Evol Comput 44:365\u2013387. https:\/\/doi.org\/10.1016\/j.swevo.2018.04.011","journal-title":"Swarm Evol Comput"},{"key":"1102_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2020\/1260196","volume":"2020","author":"X Ma","year":"2020","unstructured":"Ma X, Bian Y, Gao F (2020) An improved shuffled frog leaping algorithm for multiload agv dispatching in automated container terminals. Math Probl Eng 2020:1\u201313. https:\/\/doi.org\/10.1155\/2020\/1260196","journal-title":"Math Probl Eng"},{"key":"1102_CR28","doi-asserted-by":"crossref","unstructured":"Manning CD, Raghavan P, Sch\u00fctze H (2008) Introduction to Information Retrieval. Cambridge University Press, Cambridge, UK. http:\/\/nlp.stanford.edu\/IR-book\/information-retrieval-book.html","DOI":"10.1017\/CBO9780511809071"},{"key":"1102_CR29","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.swevo.2014.02.003","volume":"17","author":"S Mehta","year":"2014","unstructured":"Mehta S, Banati H (2014) Context aware filtering using social behavior of frogs. Swarm Evol Comput 17:25\u201336. https:\/\/doi.org\/10.1016\/j.swevo.2014.02.003","journal-title":"Swarm Evol Comput"},{"key":"1102_CR30","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/TEVC.2005.859468","volume":"10","author":"D Parrott","year":"2006","unstructured":"Parrott D, Li X (2006) Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans Evol Comput 10:440\u2013458. https:\/\/doi.org\/10.1109\/TEVC.2005.859468","journal-title":"IEEE Trans Evol Comput"},{"key":"1102_CR31","doi-asserted-by":"publisher","unstructured":"Shi J, Malik J (2002) Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22. https:\/\/doi.org\/10.1109\/34.868688","DOI":"10.1109\/34.868688"},{"key":"1102_CR32","doi-asserted-by":"publisher","unstructured":"Skolicki Z, De\u00a0Jong K (2005) The influence of migration intervals on island models, pp 1295\u20131302. https:\/\/doi.org\/10.1145\/1068009.1068219","DOI":"10.1145\/1068009.1068219"},{"key":"1102_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.07.004","volume":"187","author":"J Tang","year":"2020","unstructured":"Tang J, Zhang R, Wang P, Zhao Z, Fan L, Liu X (2020) A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowl Based Syst 187:104833. https:\/\/doi.org\/10.1016\/j.knosys.2019.07.004","journal-title":"Knowl Based Syst"},{"key":"1102_CR34","doi-asserted-by":"publisher","unstructured":"Wang L, Gong Y (2013) Quantum binary shuffled frog leaping algorithm, pp. 1655\u20131659. https:\/\/doi.org\/10.1109\/IMCCC.2013.366","DOI":"10.1109\/IMCCC.2013.366"},{"key":"1102_CR35","doi-asserted-by":"crossref","unstructured":"Ward JH (1963) Hierarchical groupings to optimize an objective function. J Am Stat Assoc 234\u2013244","DOI":"10.1080\/01621459.1963.10500845"},{"key":"1102_CR36","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.asoc.2018.02.042","volume":"67","author":"X Xia","year":"2018","unstructured":"Xia X, Gui L, Zhan ZH (2018) A multi-swarm particle swarm optimization algorithm based on dynamical topology and purposeful detecting. Appl Soft Comput 67:42. https:\/\/doi.org\/10.1016\/j.asoc.2018.02.042","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1102_CR37","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s12065-013-0102-2","volume":"7","author":"X-S Yang","year":"2013","unstructured":"Yang X-S (2013) Swarm intelligence based algorithms: a critical analysis. Evol Intell 7(1):17\u201328. https:\/\/doi.org\/10.1007\/s12065-013-0102-2","journal-title":"Evol Intell"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01102-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01102-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01102-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T23:13:46Z","timestamp":1710285226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01102-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,11]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1102"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01102-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,2,11]]},"assertion":[{"value":"12 September 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"6"}}