{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:21:02Z","timestamp":1768342862077,"version":"3.49.0"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00500-020-04725-x","type":"journal-article","created":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T13:02:33Z","timestamp":1580562153000},"page":"13069-13083","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A new flower pollination algorithm for equalization in synchronous DS\/CDMA multiuser communication systems"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8760-9577","authenticated-orcid":false,"given":"Luis M.","family":"San-Jos\u00e9-Revuelta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1565-0842","authenticated-orcid":false,"given":"Pablo","family":"Casaseca-de-la-Higuera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,1]]},"reference":[{"key":"4725_CR1","first-page":"149","volume":"3","author":"M Abdel-Baset","year":"2015","unstructured":"Abdel-Baset M, Hezam IM (2015) An improved flower pollination algorithm based on simulated annealing for solving engineering optimization problems. Asian J Math Comput Res 3:149\u2013170","journal-title":"Asian J Math Comput Res"},{"key":"4725_CR2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1504\/IJBIC.2016.078662","volume":"8","author":"M Abdel-Baset","year":"2016","unstructured":"Abdel-Baset M, Hezam IM (2016) A hybrid flower pollination algorithm for solving ill-conditioned set of equations. Int J Bio Inspired Comput 8:215\u2013220","journal-title":"Int J Bio Inspired Comput"},{"key":"4725_CR3","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1504\/IJBIC.2018.090080","volume":"11","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, Zhou Y (2018) An elite opposition-flower pollination algorithm for a 0\u20131 knapsack problem. Int J Bio Inspired Comput 11:46\u201353","journal-title":"Int J Bio Inspired Comput"},{"key":"4725_CR4","doi-asserted-by":"crossref","first-page":"2533","DOI":"10.1007\/s10462-018-9624-4","volume":"52","author":"M Abdel-Basset","year":"2019","unstructured":"Abdel-Basset M, Shawky LA (2019) Flower pollination algorithm: a comprehensive review. Artif Intell Rev 52:2533\u20132557","journal-title":"Artif Intell Rev"},{"key":"4725_CR5","first-page":"108","volume":"8","author":"M Abdel-Baset","year":"2017","unstructured":"Abdel-Baset M, Wu H, Zhou Y (2017a) A complex encoding flower pollination algorithm for constrained engineering optimisation problems. Int J Math Model Numer Optim 8:108\u2013126","journal-title":"Int J Math Model Numer Optim"},{"key":"4725_CR6","doi-asserted-by":"crossref","first-page":"901","DOI":"10.3233\/JIFS-162141","volume":"33","author":"M Abdel-Baset","year":"2017","unstructured":"Abdel-Baset M, Wu H, Zhou Y, Abdel-Fatah L (2017b) Elite opposition-flower pollination algorithm for quadratic assignment problem. J Intell Fuzzy Syst 33:901\u2013911","journal-title":"J Intell Fuzzy Syst"},{"key":"4725_CR7","doi-asserted-by":"crossref","first-page":"4221","DOI":"10.1007\/s00500-017-2744-y","volume":"22","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, El-Shahat D, El-Henawy I, Sangaiah AK (2018) A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making. Soft Comput 22:4221\u20134239","journal-title":"Soft Comput"},{"key":"4725_CR8","first-page":"1","volume":"4","author":"O Abdel-Raouf","year":"2014","unstructured":"Abdel-Raouf O, Abdel-Baset M et al (2014) A new hybrid flower pollination algorithm for solving constrained global optimization problems. Int J Appl Oper Res 4:1\u201313","journal-title":"Int J Appl Oper Res"},{"key":"4725_CR9","first-page":"14","volume":"100","author":"P Agarwal","year":"2014","unstructured":"Agarwal P, Mehta S (2014) Nature-inspired algorithms: state-of-art, problems and prospects. Nature 100:14\u201321","journal-title":"Nature"},{"key":"4725_CR10","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/j.enconman.2015.05.074","volume":"101","author":"D Alam","year":"2015","unstructured":"Alam D, Yousri D, Eteiba M (2015) Flower pollination algorithm based solar PV parameter estimation. Energy Convers Manag 101:410\u2013422","journal-title":"Energy Convers Manag"},{"key":"4725_CR11","unstructured":"Arani AHJ, Azmi P (2013) Joint multiuser and inter-symbol interference suppression in CDMA systems using particle swarm optimization algorithms. In: 21st Iranian conference on electrical engineering (ICEE). IEEE, pp 1\u20136"},{"key":"4725_CR12","doi-asserted-by":"crossref","first-page":"3853","DOI":"10.3233\/JIFS-17708","volume":"33","author":"S Arora","year":"2017","unstructured":"Arora S, Anand P (2017) Chaos-enhanced flower pollination algorithms for global optimization. J Intell Fuzzy Syst 33:3853\u20133869","journal-title":"J Intell Fuzzy Syst"},{"key":"4725_CR13","first-page":"230","volume":"3","author":"K Balasubramani","year":"2014","unstructured":"Balasubramani K, Marcus K (2014) A study on flower pollination algorithm and its applications. Int J Appl Innov Eng Manag: IJAIEM 3:230\u2013235","journal-title":"Int J Appl Innov Eng Manag: IJAIEM"},{"key":"4725_CR14","unstructured":"Balamurugan M, Narendiran S, Sahoo SK (2018) Misc. swarm intelligence techniques. In: A Nayyar, DN Le, NG Nguyen (eds) Advances in swarm intelligence for optimizing problems in computer science. Boca Raton: CRC, pp 225\u2013252"},{"key":"4725_CR15","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.asoc.2015.08.037","volume":"37","author":"G Bekda\u015f","year":"2015","unstructured":"Bekda\u015f G, Nigdeli SM, Yang X-S (2015) Sizing optimization of truss structures using flower pollination algorithm. Appl Soft Comput 37:322\u2013331","journal-title":"Appl Soft Comput"},{"key":"4725_CR16","doi-asserted-by":"crossref","first-page":"1308","DOI":"10.1109\/26.539771","volume":"44","author":"RM Buehrer","year":"1996","unstructured":"Buehrer RM, Woerner BD (1996) Analysis of adaptive multistage interference cancellation for CDMA using an improved gaussian approximation. IEEE Trans Commun 44:1308\u20131321","journal-title":"IEEE Trans Commun"},{"key":"4725_CR17","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.procs.2015.08.438","volume":"62","author":"H Chiroma","year":"2015","unstructured":"Chiroma H, Shuib NLM, Muaz SA, Abubakar AI, Ila LB, Maitama JZ (2015) A review of the applications of bio-inspired flower pollination algorithm. Procedia Comput Sci 62:435\u2013441","journal-title":"Procedia Comput Sci"},{"key":"4725_CR18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.asoc.2014.02.009","volume":"19","author":"M \u010crepin\u0161ek","year":"2014","unstructured":"\u010crepin\u0161ek M, Liu S-H, Mernik M (2014) Replication and comparison of computational experiments in applied evolutionary computing: common pitfalls and guidelines to avoid them. Appl Soft Comput 19:161\u2013170","journal-title":"Appl Soft Comput"},{"key":"4725_CR19","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.asoc.2016.05.051","volume":"47","author":"ZAEM Dahi","year":"2016","unstructured":"Dahi ZAEM, Mezioud C, Draa A (2016) On the efficiency of the binary flower pollination algorithm: application on the antenna positioning problem. Appl Soft Comput 47:395\u2013414","journal-title":"Appl Soft Comput"},{"key":"4725_CR20","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1109\/LCOMM.2010.101210.101587","volume":"14","author":"T Datta","year":"2010","unstructured":"Datta T, Srinidhi N, Chockalingam A, Rajan BS (2010) Random-restart reactive tabu search algorithm for detection in large-mimo systems. IEEE Commun Lett 14:1107\u20131109","journal-title":"IEEE Commun Lett"},{"key":"4725_CR21","doi-asserted-by":"crossref","unstructured":"De Oliveira LD, Ciriaco F, Abrao T, Jeszensky PJE (2006) Particle swarm and quantum particle swarm optimization applied to DS\/CDMA multiuser detection in flat Rayleigh channels. In: 2006 IEEE 9th International symposium on spread spectrum techniques and applications. IEEE, pp 133\u2013137","DOI":"10.1109\/ISSSTA.2006.311749"},{"key":"4725_CR22","unstructured":"Dong L, Youyun X, Wentao S, Hanwen L, XingZhao L (2004) Genetic algorithm based multiuser detection for cdma systems. In: Proceedings of IEEE 6th circuits and systems symposium on emerging technologies: frontiers of mobile and wireless communication, vol 1. IEEE, pp 321\u2013324"},{"key":"4725_CR23","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.asoc.2015.05.015","volume":"34","author":"A Draa","year":"2015","unstructured":"Draa A (2015) On the performances of the flower pollination algorithm-qualitative and quantitative analyses. Appl Soft Comput 34:349\u2013371","journal-title":"Appl Soft Comput"},{"key":"4725_CR24","doi-asserted-by":"crossref","unstructured":"Driouch E, Ajib W, Gaha M (2010) A tabu search scheduling algorithm for MIMO CDMA systems. In: IEEE global telecommunications conference (GLOBECOM 2010). IEEE, pp 1\u20135","DOI":"10.1109\/GLOCOM.2010.5684234"},{"key":"4725_CR25","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1007\/s12559-015-9324-1","volume":"7","author":"HM Dubey","year":"2015","unstructured":"Dubey HM, Pandit M, Panigrahi BK (2015) A biologically inspired modified flower pollination algorithm for solving economic dispatch problems in modern power systems. Cogn Comput 7:594\u2013608","journal-title":"Cogn Comput"},{"key":"4725_CR26","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1109\/26.864174","volume":"48","author":"C Ergun","year":"2000","unstructured":"Ergun C, Hacioglu K (2000) Multiuser detection using a genetic algorithm in CDMA communications systems. IEEE Trans Commun 48:1374\u20131383","journal-title":"IEEE Trans Commun"},{"key":"4725_CR27","doi-asserted-by":"crossref","first-page":"1896","DOI":"10.1109\/TSP.2006.872539","volume":"54","author":"B Farhang-Boroujeny","year":"2006","unstructured":"Farhang-Boroujeny B, Zhu H, Shi Z (2006) Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems. IEEE Trans Signal Process 54:1896\u20131909","journal-title":"IEEE Trans Signal Process"},{"key":"4725_CR28","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1109\/26.380205","volume":"43","author":"U Fawer","year":"1995","unstructured":"Fawer U, Aazhang B (1995) A multiuser receiver for code division multiple access communications over multipath channels. IEEE Trans Commun 43:1556\u20131565","journal-title":"IEEE Trans Commun"},{"key":"4725_CR29","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11:86\u201392","journal-title":"Ann Math Stat"},{"key":"4725_CR30","doi-asserted-by":"crossref","unstructured":"Gao H, Diao M (2009) Multiuser detection using the novel particle swarm optimization with simulated annealing. In: 5th international conference on wireless communication, networking and mobile computing. IEEE, pp 1\u20135","DOI":"10.1109\/WICOM.2009.5301498"},{"key":"4725_CR31","first-page":"30","volume":"39","author":"R Guntu Nooka","year":"2013","unstructured":"Guntu Nooka R, Rao BP (2013) Adaptive genetic algorithm assisted multi user detection of FD-MC-CDMA in frequency selective fading channels. Comput Sci Telecommun 39:30\u201339","journal-title":"Comput Sci Telecommun"},{"key":"4725_CR32","doi-asserted-by":"crossref","unstructured":"He X, Yang X-S, Karamanoglu M, Zhao Y (2017) Global convergence analysis of the flower pollination algorithm: a discrete-time Markov chain approach. Procedia Comput Sci (International conference on computational science, ICCS 2017, 12\u201314 June 2017, Zurich, Switzerland), 108C:1354\u20131363","DOI":"10.1016\/j.procs.2017.05.020"},{"key":"4725_CR33","doi-asserted-by":"crossref","first-page":"29","DOI":"10.18576\/isl\/050104","volume":"5","author":"IM Hezam","year":"2016","unstructured":"Hezam IM, Abdel-Baset M, Hassan BM (2016) A hybrid flower pollination algorithm with tabu search for unconstrained optimization problems. Inf Sci Lett 5:29\u201334","journal-title":"Inf Sci Lett"},{"key":"4725_CR34","unstructured":"Hijazi SL, Natarajan B (2004) Novel low-complexity DS-CDMA multiuser detector based on ant colony optimization. In: 2004 IEEE 60th vehicular technology conference, vol 3. IEEE, pp 1939\u20131943"},{"key":"4725_CR35","doi-asserted-by":"crossref","first-page":"1724","DOI":"10.1109\/TSP.2002.1011212","volume":"50","author":"Y Huang","year":"2002","unstructured":"Huang Y, Djuric PM (2002) Multiuser detection of synchronous code-division multiple-access signals by perfect sampling. IEEE Trans Signal Process 50:1724\u20131734","journal-title":"IEEE Trans Signal Process"},{"key":"4725_CR36","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1007\/s00500-015-1838-7","volume":"21","author":"Y-F Huang","year":"2017","unstructured":"Huang Y-F, Tan T-H, Cheng C-H, Lai W-C, Chen H-C (2017) Performance of a novel evolutionary genetic-based multi-user detector for multi-carrier CDMA communication systems. Soft Comput 21:1031\u20131039","journal-title":"Soft Comput"},{"key":"4725_CR37","doi-asserted-by":"crossref","unstructured":"Juntti M, Schlosser T, Lilleberg J (1997) Genetic algorithms for multiuser detection in synchronous CDMA. In: Proceedings 1997 IEEE international symposium on information theory. IEEE, p 492","DOI":"10.1109\/ISIT.1997.613429"},{"key":"4725_CR38","first-page":"47","volume":"133","author":"A Kaur","year":"2016","unstructured":"Kaur A (2016) Comparison analysis of CDMA multiuser detection using PSO and SMO. Int J Comput Appl 133:47\u201350","journal-title":"Int J Comput Appl"},{"key":"4725_CR39","doi-asserted-by":"crossref","first-page":"2267","DOI":"10.3906\/elk-1303-202","volume":"23","author":"MA Khan","year":"2015","unstructured":"Khan MA, Umair M, Choudhry MAS (2015) GA based adaptive receiver for MC-CDMA system. Turk J Electr Eng Comput Sci 23:2267\u20132277","journal-title":"Turk J Electr Eng Comput Sci"},{"key":"4725_CR40","first-page":"1","volume-title":"Trends in mathematics and computational intelligence","author":"PA Kowalski","year":"2019","unstructured":"Kowalski PA, Kami\u0144ski J, \u0141ukasik S, \u015awiebocka-Wi\u0229k J, Go\u0142u\u0144ska D, Tarasiuk J, Kulczycki P (2019) Application of the flower pollination algorithm in the analysis of micro-CT scans. In: Cornejo M, K\u00f3czy L, Medina J, De Barros Ruano A (eds) Trends in mathematics and computational intelligence. Springer, New York, pp 1\u20139"},{"key":"4725_CR41","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1049\/iet-com:20050456","volume":"1","author":"J-K Lain","year":"2007","unstructured":"Lain J-K, Lai J-J (2007) Ant colony optimisation-based multiuser detection for direct-sequence cdma systems with diversity reception. IET Commun 1:556\u2013561","journal-title":"IET Commun"},{"key":"4725_CR42","doi-asserted-by":"crossref","unstructured":"Larbi N, Debbat F, Stambouli AB (2014) A review of heuristic near-optimum mud for MC-CDMA systems. In: 2014 international conference on multimedia computing and systems (ICMCS). IEEE, pp 1484\u20131489","DOI":"10.1109\/ICMCS.2014.6911420"},{"key":"4725_CR43","first-page":"31","volume":"4","author":"K Lenin","year":"2014","unstructured":"Lenin K, Ravindhranath R, Surya K (2014) Shrinkage of active power loss by hybridization of flower pollination algorithm with chaotic harmony search algorithm. Control Theory Inf 4:31\u201338","journal-title":"Control Theory Inf"},{"key":"4725_CR44","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1109\/49.737640","volume":"16","author":"TJ Lim","year":"1998","unstructured":"Lim TJ, Rasmussen LK, Sugimoto H (1998) An asynchronous multiuser CDMA detector based on the Kalman filter. IEEE J Sel Areas Commun 16:1711\u20131722","journal-title":"IEEE J Sel Areas Commun"},{"key":"4725_CR45","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/18.42183","volume":"35","author":"R Lupas","year":"1989","unstructured":"Lupas R, Verdu S (1989) Linear multiuser detectors for synchronous code-division multiple-access channels. IEEE Trans Inf Theory 35:123\u2013136","journal-title":"IEEE Trans Inf Theory"},{"key":"4725_CR46","first-page":"7","volume":"I","author":"KG Maradia","year":"2009","unstructured":"Maradia KG, Joshi S, Patel JS (2009) Genetic algorithm for CDMA-based mud techniques under Rayleigh fading environment. IUP J Telecommun I:7\u201323","journal-title":"IUP J Telecommun"},{"key":"4725_CR47","doi-asserted-by":"crossref","first-page":"12876","DOI":"10.1016\/j.eswa.2012.05.005","volume":"39","author":"JC Marinello Filho","year":"2012","unstructured":"Marinello Filho JC, De Souza RN, Abr\u00e3O T (2012) Ant colony input parameters optimization for multiuser detection in DS\/CDMA systems. Expert Syst Appl 39:12876\u201312884","journal-title":"Expert Syst Appl"},{"key":"4725_CR48","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1049\/iet-com.2016.0610","volume":"11","author":"S Mehrizi","year":"2017","unstructured":"Mehrizi S, Mahboobi B (2017) Cooperative mimo relay beamforming in overloaded DS\/CDMA multicast networks. IET Commun 11:344\u2013354","journal-title":"IET Commun"},{"key":"4725_CR49","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10845-016-1261-7","volume":"30","author":"A Mishra","year":"2019","unstructured":"Mishra A, Deb S (2019) Assembly sequence optimization using a flower pollination algorithm-based approach. J Intell Manuf 30:461\u2013482","journal-title":"J Intell Manuf"},{"key":"4725_CR50","doi-asserted-by":"crossref","unstructured":"Nigdeli SM, Bekda\u015f G, Yang X-S (2016) Application of the flower pollination algorithm in structural engineering. In: Yang X-S, Bekda\u015f G, Nigdeli SM (eds) Metaheuristics and optimization in civil engineering. Springer, New York, pp 25\u201342","DOI":"10.1007\/978-3-319-26245-1_2"},{"key":"4725_CR51","doi-asserted-by":"crossref","first-page":"1858","DOI":"10.1007\/s13198-017-0623-7","volume":"8","author":"S Pant","year":"2017","unstructured":"Pant S, Kumar A, Ram M (2017) Flower pollination algorithm development: a state of art review. Int J Syst Assur Eng Manag 8:1858\u20131866","journal-title":"Int J Syst Assur Eng Manag"},{"key":"4725_CR52","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1016\/j.jcp.2007.06.008","volume":"226","author":"I Pavlyukevich","year":"2007","unstructured":"Pavlyukevich I (2007) L\u00e9vy flights, non-local search and simulated annealing. J Comput Phys 226:1830\u20131844","journal-title":"J Comput Phys"},{"key":"4725_CR53","doi-asserted-by":"crossref","first-page":"2956","DOI":"10.1016\/j.eswa.2011.08.157","volume":"39","author":"PM Pradhan","year":"2012","unstructured":"Pradhan PM, Panda G (2012) Solving multiobjective problems using cat swarm optimization. Expert Syst Appl 39:2956\u20132964","journal-title":"Expert Syst Appl"},{"key":"4725_CR54","first-page":"1009","volume":"6","author":"R Prathiba","year":"2014","unstructured":"Prathiba R, Moses MB, Sakthivel S (2014) Flower pollination algorithm applied for different economic load dispatch problems. Int J Eng Technol 6:1009\u20131016","journal-title":"Int J Eng Technol"},{"key":"4725_CR55","volume-title":"Digital communications","author":"J Proakis","year":"2008","unstructured":"Proakis J, Salehi M (2008) Digital communications, 5th edn. McGraw Hill Education, New York, USA","edition":"5"},{"key":"4725_CR56","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1049\/iet-com.2012.0763","volume":"7","author":"N Rahnama","year":"2013","unstructured":"Rahnama N, Talebi S (2013) Performance comparison of chaotic spreading sequences generated by two different classes of chaotic systems in a chaos-based direct sequence-code division multiple access system. IET Commun 7:1024\u20131031","journal-title":"IET Commun"},{"key":"4725_CR57","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.eswa.2016.06.006","volume":"62","author":"D Rodrigues","year":"2016","unstructured":"Rodrigues D, Silva GF, Papa JP, Marana AN, Yang X-S (2016) EEG-based person identification through binary flower pollination algorithm. Expert Syst Appl 62:81\u201390","journal-title":"Expert Syst Appl"},{"key":"4725_CR58","unstructured":"Rycroft C, Bazant M (2005) Introduction to random walks and diffusion. Random walks and diffusion-2005 lecture notes. MIT"},{"key":"4725_CR59","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1016\/j.sigpro.2007.02.015","volume":"87","author":"LM San-Jos\u00e9-Revuelta","year":"2007","unstructured":"San-Jos\u00e9-Revuelta LM (2007) A bayesian framework for the development of suboptimal blind multiuser detectors for DS\/CDMA signals in synchronous channels. Sig Process 87:2231\u20132250","journal-title":"Sig Process"},{"key":"4725_CR60","doi-asserted-by":"crossref","unstructured":"San-Jose-Revuelta LM, Cid-Sueiro J (2003) Bayesian and RBF structures for wireless communications detection. In: 2003 IEEE 13th workshop on neural networks for signal processing. IEEE, pp 749\u2013758","DOI":"10.1109\/NNSP.2003.1318074"},{"key":"4725_CR61","first-page":"54","volume":"4","author":"M Sharawi","year":"2014","unstructured":"Sharawi M, Emary E, Saroit IA, El-Mahdy H (2014) Flower pollination optimization algorithm for wireless sensor network lifetime global optimization. Int J Soft Comput Eng 4:54\u201359","journal-title":"Int J Soft Comput Eng"},{"key":"4725_CR62","first-page":"2377","volume":"86","author":"MG Shayesteh","year":"2003","unstructured":"Shayesteh MG, Menhaj MB, Nobary BG (2003) A modified genetic algorithm for multiuser detection in DS\/CDMA systems. IEICE Trans Commun 86:2377\u20132388","journal-title":"IEICE Trans Commun"},{"key":"4725_CR63","doi-asserted-by":"crossref","first-page":"115","DOI":"10.21833\/ijaas.2017.06.016","volume":"4","author":"M Sohail","year":"2017","unstructured":"Sohail M, Alam S, Hussain A, Ghauri SA, Sarfraz M, Ahmed M (2017) Multiuser detection: comparative analysis of heuristic approach. Int J Adv Appl Sci 4:115\u2013120","journal-title":"Int J Adv Appl Sci"},{"key":"4725_CR64","doi-asserted-by":"crossref","first-page":"3006","DOI":"10.1109\/TVT.2007.900383","volume":"56","author":"K-K Soo","year":"2007","unstructured":"Soo K-K, Siu Y-M, Chan W-S, Yang L, Chen R-S (2007) Particle-swarm-optimization-based multiuser detector for CDMA communications. IEEE Trans Veh Technol 56:3006\u20133013","journal-title":"IEEE Trans Veh Technol"},{"key":"4725_CR65","doi-asserted-by":"crossref","first-page":"2955","DOI":"10.1109\/TCOMM.2011.070511.110058","volume":"59","author":"N Srinidhi","year":"2011","unstructured":"Srinidhi N, Datta T, Chockalingam A, Rajan BS (2011) Layered tabu search algorithm for large-MIMO detection and a lower bound on ML performance. IEEE Trans Commun 59:2955\u20132963","journal-title":"IEEE Trans Commun"},{"key":"4725_CR66","doi-asserted-by":"crossref","first-page":"1802","DOI":"10.1109\/TWC.2004.834699","volume":"3","author":"PH Tan","year":"2004","unstructured":"Tan PH, Rasmussen LK (2004) Multiuser detection in CDMA\u2014a comparison of relaxations, exact, and heuristic search methods. IEEE Trans Wirel Commun 3:1802\u20131809","journal-title":"IEEE Trans Wirel Commun"},{"key":"4725_CR67","doi-asserted-by":"crossref","unstructured":"Tan T-H, Huang Y-F, Hsu L-C, Wu C-H (2010a) Joint channel estimation and multi-user detection for MC-CDMA system using genetic algorithm and simulated annealing. In: IEEE international conference on systems man and cybernetics. IEEE, pp 249\u2013256","DOI":"10.1109\/ICSMC.2010.5642243"},{"key":"4725_CR68","first-page":"3347","volume":"6","author":"T-H Tan","year":"2010","unstructured":"Tan T-H, Huang Y-F, Liu F-T (2010b) Multi-user detection in DS-CDMA systems using a genetic algorithm with redundancy saving strategy. Int J Innov Comput Inf Control 6:3347\u20133364","journal-title":"Int J Innov Comput Inf Control"},{"key":"4725_CR69","unstructured":"Tan T-H, Chang C-C, Jean F-R, Chiang JY, Lu Y-C (2013) Joint channel estimation and multi-user detection for OFDMA systems using a genetic algorithm with simulated annealing-based mutation. In: IEEE International conference on systems, man, and cybern. IEEE, pp 162\u2013167"},{"key":"4725_CR70","volume-title":"Multiuser detection","author":"S Verdu","year":"1998","unstructured":"Verdu S (1998) Multiuser detection. Cambridge University Press, Cambridge"},{"key":"4725_CR71","doi-asserted-by":"crossref","unstructured":"Wang C (2014) A completely binary and hardware-efficient PSO for CDMA multiuser detection. In: 6th international conference on intelligent human-machine systems and cybernetics (IHMSC), vol 1, pp 3\u20136. IEEE","DOI":"10.1109\/IHMSC.2014.9"},{"key":"4725_CR72","doi-asserted-by":"crossref","unstructured":"Xu C, Yang L-L, Hanzo L (2007) Ant-colony-based multiuser detection for MC DS-CDMA systems. In: 2007 IEEE 66th vehicular technology conference. IEEE, pp 960\u2013964","DOI":"10.1109\/VETECF.2007.209"},{"key":"4725_CR73","unstructured":"Yang X-S (2012) Flower pollination algorithm for global optimization. In: UCNC. Springer, pp 240\u2013249"},{"key":"4725_CR74","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00521-013-1367-1","volume":"24","author":"X-S Yang","year":"2014","unstructured":"Yang X-S, Deb S (2014) Cuckoo search: recent advances and applications. Neural Comput Appl 24:169\u2013174","journal-title":"Neural Comput Appl"},{"key":"4725_CR75","unstructured":"Yao Y-C, Cheng C-H, Wen G-J, Wen J-H (2011) Multiuser detection using simulated annealing hopfield neural network for DS-UWB systems. In: 2011 international conference on machine learning and cybernetics (ICMLC), vol 2. IEEE, pp 763\u2013768"},{"key":"4725_CR76","doi-asserted-by":"crossref","unstructured":"Yen K, Hanzo L (2000) Hybrid genetic algorithm based detection schemes for synchronous CDMA systems. In: IEEE 51st vehicular technology conference proceedings, 2000. Tokyo, vol 2. IEEE, pp 1400\u20131404","DOI":"10.1109\/VETECS.2000.851356"},{"key":"4725_CR77","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1109\/49.926355","volume":"19","author":"K Yen","year":"2001","unstructured":"Yen K, Hanzo L (2001) Genetic algorithm assisted joint multiuser symbol detection and fading channel estimation for synchronous CDMA systems. IEEE J Sel Areas Commun 19:985\u2013998","journal-title":"IEEE J Sel Areas Commun"},{"key":"4725_CR78","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1109\/TVT.2004.832412","volume":"53","author":"K Yen","year":"2004","unstructured":"Yen K, Hanzo L (2004) Genetic-algorithm-assisted multiuser detection in asynchronous CDMA communications. IEEE Trans Veh Technol 53:1413\u20131422","journal-title":"IEEE Trans Veh Technol"},{"key":"4725_CR79","doi-asserted-by":"crossref","first-page":"2155","DOI":"10.1007\/s00521-017-3176-4","volume":"31","author":"Y Zhou","year":"2019","unstructured":"Zhou Y, Wang R, Zhao C, Luo Q, Metwally MA (2019) Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput Appl 31:2155\u20132170","journal-title":"Neural Comput Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-04725-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-020-04725-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-04725-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,31]],"date-time":"2021-01-31T00:32:24Z","timestamp":1612053144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-020-04725-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,1]]},"references-count":79,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["4725"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-04725-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,1]]},"assertion":[{"value":"1 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"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 or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}