{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T10:09:21Z","timestamp":1764583761040,"version":"3.46.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"23-24","license":[{"start":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T00:00:00Z","timestamp":1728000000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T00:00:00Z","timestamp":1728000000000},"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":["Soft Comput"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00500-024-09822-9","type":"journal-article","created":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T05:02:29Z","timestamp":1728018149000},"page":"6035-6052","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An augmented swarm optimization algorithm for k-clustering minimum biclique completion problems"],"prefix":"10.1007","volume":"29","author":[{"given":"G.-M.","family":"Cochard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Elmi\u00a0Samod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1031-7701","authenticated-orcid":false,"given":"M.","family":"Hifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Yousef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,4]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Aboelfotoh A, Singh M, Suer G (2019) Order batching optimization for warehouses with cluster-picking. Proc Manuf 39:1464\u20131473. https:\/\/doi.org\/10.1016\/j.promfg.2020.01.302. In: 25th International Conference on production research manufacturing innovation: cyber physical manufacturing August 9-14, 2019, Chicago, Illinois (USA)","key":"9822_CR1","DOI":"10.1016\/j.promfg.2020.01.302"},{"key":"9822_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106076","volume":"89","author":"FH Ajeil","year":"2020","unstructured":"Ajeil FH, Ibraheem IK, Sahib MA, Humaidi AJ (2020) Multi-objective path planning of an autonomous mobile robot using hybrid pso-mfb optimization algorithm. Appl Soft Comput 89:106076","journal-title":"Appl Soft Comput"},{"doi-asserted-by":"publisher","unstructured":"Al-Iedani N, Hifi M, Saadi T (2016) Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem. In: Proceedings of the International Conference on control, decision and information technologies (CoDIT), pp 639\u2013643. https:\/\/doi.org\/10.1109\/CoDIT.2016.7593637. IEEE","key":"9822_CR3","DOI":"10.1109\/CoDIT.2016.7593637"},{"key":"9822_CR4","doi-asserted-by":"publisher","first-page":"5747","DOI":"10.1007\/s00500-020-05569-1","volume":"25","author":"Y Cao","year":"2021","unstructured":"Cao Y, Liu J, Xu Z (2021) A hybrid particle swarm optimization algorithm for rfid network planning. Soft Comput 25:5747\u20135761. https:\/\/doi.org\/10.1007\/s00500-020-05569-1","journal-title":"Soft Comput"},{"key":"9822_CR5","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1007\/s00500-021-06307-x","volume":"26","author":"SN Chegini","year":"2022","unstructured":"Chegini SN, Amini P, Ahmadi B, Bagheri A, Amirmostofian I (2022) Intelligent bearing fault diagnosis using swarm decomposition method and new hybrid particle swarm optimization algorithm. Soft Comput 26:1475\u20131497. https:\/\/doi.org\/10.1007\/s00500-021-06307-x","journal-title":"Soft Comput"},{"issue":"1\u20132","key":"9822_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1111\/itor.12307","volume":"24","author":"S Dantas","year":"2017","unstructured":"Dantas S, Groshaus M, Guedes A, Machado RC, Ries B, Sasaki D (2017) On star and biclique edge-colorings. Int Trans Oper Res 24(1\u20132):339\u2013346. https:\/\/doi.org\/10.1111\/itor.12307","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"9822_CR7","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.disopt.2007.09.005","volume":"4","author":"N Faure","year":"2007","unstructured":"Faure N, Chr\u00e9tienne P, Gourdin E, Sourd F (2007) Biclique completion problems for multicast network design. Discrete Optim 4(3):360\u2013377. https:\/\/doi.org\/10.1016\/j.disopt.2007.09.005","journal-title":"Discrete Optim"},{"doi-asserted-by":"publisher","unstructured":"Glover, F, Laguna, M, Marti, R (2003) In: Ghosh, A, Tsutsui, S (eds) Scatter Search. Springer, Berlin, pp 519\u2013537. https:\/\/doi.org\/10.1007\/978-3-642-18965-4_20","key":"9822_CR8","DOI":"10.1007\/978-3-642-18965-4_20"},{"key":"9822_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-01929-6_8","volume-title":"Integration of AI and OR techniques in constraint programming for combinatorial optimization problems","author":"S Gualandi","year":"2009","unstructured":"Gualandi S (2009) $$k$$-clustering minimum biclique completion via a hybrid cp and sdp approach. In: van Hoeve W-J, Hooker JN (eds) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Springer, pp 87\u2013101. https:\/\/doi.org\/10.1007\/978-3-642-01929-6_8"},{"issue":"1","key":"9822_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1111\/j.1475-3995.2012.00860.x","volume":"20","author":"S Gualandi","year":"2013","unstructured":"Gualandi S, Maffioli F, Magni C (2013) A branch-and-price approach to $$k$$-clustering minimum biclique completion problem. Int Trans Oper Res 20(1):101\u2013117. https:\/\/doi.org\/10.1111\/j.1475-3995.2012.00860.x","journal-title":"Int Trans Oper Res"},{"doi-asserted-by":"publisher","unstructured":"Hifi M, Sadeghsa S (2023) A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem. J Oper Res Soc 74(1):258\u2013271. https:\/\/doi.org\/10.1080\/01605682.2022.2035272","key":"9822_CR11","DOI":"10.1080\/01605682.2022.2035272"},{"key":"9822_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-18161-5_2","volume-title":"Modelling, computation and optimization in information systems and management sciences","author":"M Hifi","year":"2015","unstructured":"Hifi M, Moussa I, Saadi T, Saleh S (2015) An adaptive neighborhood search for k-clustering minimum bi-clique completion problems. In: Le Thi HA, Pham Dinh T, Nguyen NT (eds) Modelling, computation and optimization in information systems and management sciences. Springer, Cham, pp 15\u201325. https:\/\/doi.org\/10.1007\/978-3-319-18161-5_2"},{"key":"9822_CR13","doi-asserted-by":"publisher","first-page":"2367","DOI":"10.1007\/s10586-021-03269-5","volume":"24","author":"J Kakkottakath Valappil Thekkepuryil","year":"2021","unstructured":"Kakkottakath Valappil Thekkepuryil J, Suseelan DP, Keerikkattil PM (2021) An effective meta-heuristic based multi-objective hybrid optimization method for workflow scheduling in cloud computing environment. Clust Comput 24:2367\u20132384","journal-title":"Clust Comput"},{"key":"9822_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/6632859","volume":"2021","author":"HA Kefale","year":"2021","unstructured":"Kefale HA, Getie EM, Eshetie KG (2021) Optimal design of grid-connected solar photovoltaic system using selective particle swarm optimization. Int J Photoenergy 2021:1\u20139","journal-title":"Int J Photoenergy"},{"issue":"1\u20132","key":"9822_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s11573-015-0789-x","volume":"86","author":"S Koch","year":"2016","unstructured":"Koch S, W\u00e4scher G (2016) A grouping genetic algorithm for the order batching problem in distribution warehouses. J Bus Econ 86(1\u20132):131\u2013153. https:\/\/doi.org\/10.1007\/s11573-015-0789-x","journal-title":"J Bus Econ"},{"doi-asserted-by":"publisher","unstructured":"Korte B, Vygen J (2018) Springer, Berlin. Heidelberg. https:\/\/doi.org\/10.1007\/978-3-662-56039-6","key":"9822_CR16","DOI":"10.1007\/978-3-662-56039-6"},{"doi-asserted-by":"publisher","unstructured":"Laguna M (2018) In: Mart\u00ed R, Pardalos PM, Resende MGC (eds) Tabu Search. Springer, Cham, pp 741\u2013758. https:\/\/doi.org\/10.1007\/978-3-319-07124-4_24","key":"9822_CR17","DOI":"10.1007\/978-3-319-07124-4_24"},{"key":"9822_CR18","doi-asserted-by":"publisher","first-page":"17621","DOI":"10.1007\/s00500-023-09223-4","volume":"27","author":"Y Liu","year":"2023","unstructured":"Liu Y, Kim K (2023) An artificial-intelligence-driven product design framework with a synergistic combination of genetic algorithm and particle swarm optimization. Soft Comput 27:17621\u201317638. https:\/\/doi.org\/10.1007\/s00500-023-09223-4","journal-title":"Soft Comput"},{"key":"9822_CR19","doi-asserted-by":"publisher","first-page":"12317","DOI":"10.1007\/s00500-022-07084-x","volume":"26","author":"C Sahu","year":"2022","unstructured":"Sahu C, Parhi DR (2022) Navigational strategy of a biped robot using regression-adaptive pso approach. Soft Comput 26:12317\u20132341. https:\/\/doi.org\/10.1007\/s00500-022-07084-x","journal-title":"Soft Comput"},{"issue":"9","key":"9822_CR20","doi-asserted-by":"publisher","first-page":"4853","DOI":"10.1038\/s41380-021-01030-3","volume":"26","author":"MA Smail","year":"2021","unstructured":"Smail MA, Wu X, Henkel ND, Eby HM, Herman JP, McCullumsmith RE, Shukla R (2021) Similarities and dissimilarities between psychiatric cluster disorders. Mol Psychiatry 26(9):4853\u20134863","journal-title":"Mol Psychiatry"},{"key":"9822_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jmsy.2020.02.011","volume":"55","author":"M Subramaniyan","year":"2020","unstructured":"Subramaniyan M, Skoogh A, Muhammad AS, Bokrantz J, Johansson B, Roser C (2020) A generic hierarchical clustering approach for detecting bottlenecks in manufacturing. J Manuf Syst 55:143\u2013158","journal-title":"J Manuf Syst"},{"issue":"18","key":"9822_CR22","doi-asserted-by":"publisher","first-page":"5405","DOI":"10.1080\/00207543.2017.1317926","volume":"55","author":"D-J van der Zee","year":"2017","unstructured":"van der Zee D-J (2017) Coordinating batching decisions in manufacturing networks. Int J Prod Res 55(18):5405\u20135422. https:\/\/doi.org\/10.1080\/00207543.2017.1317926","journal-title":"Int J Prod Res"},{"key":"9822_CR23","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00500-016-2474-6","volume":"22","author":"D Wang","year":"2018","unstructured":"Wang D, Tan D, Liu L (2018) Particle swarm optimization algorithm: an overview. Soft Comput 22:387\u2013408. https:\/\/doi.org\/10.1007\/s00500-016-2474-6","journal-title":"Soft Comput"},{"doi-asserted-by":"crossref","unstructured":"Wang Z, Zhang C, Li H, Zhao Y (2021) A multi agent-based optimal control method for combined cooling and power systems with thermal energy storage. In: Building simulation, vol. 14. Springer, pp 1709\u20131723","key":"9822_CR24","DOI":"10.1007\/s12273-021-0768-9"},{"doi-asserted-by":"crossref","unstructured":"Zhang W, Wang X, Zhao D, Tang X (2012) Graph degree linkage: Agglomerative clustering on a directed graph. In: Computer Vision\u2013ECCV 2012: 12th European Conference on computer vision, Florence, Italy, October 7-13, 2012, Proceedings, Part I 12, pp. 428\u2013441. Springer","key":"9822_CR25","DOI":"10.1007\/978-3-642-33718-5_31"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09822-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-09822-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09822-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T10:04:47Z","timestamp":1764583487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-09822-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,4]]},"references-count":25,"journal-issue":{"issue":"23-24","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["9822"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-09822-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2024,10,4]]},"assertion":[{"value":"7 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 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 authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}