{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:21:09Z","timestamp":1740108069279,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T00:00:00Z","timestamp":1615248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T00:00:00Z","timestamp":1615248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["61703258"],"award-info":[{"award-number":["61703258"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2017M613053"],"award-info":[{"award-number":["2017M613053"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009996","name":"Shaanxi Province Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2017BSHYDZZ33"],"award-info":[{"award-number":["2017BSHYDZZ33"]}],"id":[{"id":"10.13039\/501100009996","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Fundamental Research Funds for the Central Universities of Shaanxi Normal University","award":["GK202103092"],"award-info":[{"award-number":["GK202103092"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s00521-021-05803-3","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T03:03:01Z","timestamp":1615258981000},"page":"12319-12329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A discrete collaborative swarm optimizer for resource scheduling problem in mobile cellular networks"],"prefix":"10.1007","volume":"35","author":[{"given":"Bei","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuping","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,9]]},"reference":[{"key":"5803_CR1","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/RBME.2018.2848228","volume":"12","author":"AK Teshome","year":"2019","unstructured":"Teshome AK, Kibret B, Lai DTH (2019) A review of implant communication technology in WBAN: progress and challenges. IEEE Rev Biomed Eng 12:88","journal-title":"IEEE Rev Biomed Eng"},{"key":"5803_CR2","unstructured":"Asadi A, Wang Q, Mancuso V (2013) A survey on device-to-device communication in cellular networks. CoRR"},{"key":"5803_CR3","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., USA"},{"issue":"2","key":"5803_CR4","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/25.923049","volume":"50","author":"R Battiti","year":"1999","unstructured":"Battiti R, Bertossi A, Cavallaro D (1999) A randomized saturation degree heuristic for channel assignment in cellular radio networks. IEEE Trans Veh Technol 50(2):364","journal-title":"IEEE Trans Veh Technol"},{"issue":"7","key":"5803_CR5","doi-asserted-by":"publisher","first-page":"2101","DOI":"10.1109\/TWC.2011.051311.100393","volume":"10","author":"N Ksairi","year":"2011","unstructured":"Ksairi N, Bianchi P, Ciblat P (2011) Nearly optimal resource allocation for downlink OFDMA in 2-D cellular networks. IEEE Trans Wirel Commun 10(7):2101","journal-title":"IEEE Trans Wirel Commun"},{"issue":"3","key":"5803_CR6","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1109\/TNET.2009.2034850","volume":"18","author":"R Madan","year":"2010","unstructured":"Madan R, Boyd SP, Lall S (2010) Fast algorithms for resource allocation in wireless cellular networks. IEEE\/ACM Trans Netw 18(3):973","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"6","key":"5803_CR7","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1109\/25.966583","volume":"50","author":"G Chakraborty","year":"2001","unstructured":"Chakraborty G (2001) An efficient heuristic algorithm for channel assignment problem in cellular radio networks. IEEE Trans Veh Technol 50(6):1528","journal-title":"IEEE Trans Veh Technol"},{"key":"5803_CR8","doi-asserted-by":"publisher","first-page":"3270","DOI":"10.1109\/ACCESS.2018.2789423","volume":"6","author":"L Zhao","year":"2018","unstructured":"Zhao L, Wang H, Zhong X (2018) Interference graph based channel assignment algorithm for D2D cellular networks. IEEE Access 6:3270","journal-title":"IEEE Access"},{"key":"5803_CR9","doi-asserted-by":"crossref","unstructured":"Li Z, Chen S, Guo C (2018) Location-aware hypergraph coloring based spectrum allocation for D2D communication. In: 2018 15th international symposium on wireless communication systems (ISWCS), pp 1\u20136","DOI":"10.1109\/ISWCS.2018.8491251"},{"key":"5803_CR10","doi-asserted-by":"crossref","unstructured":"Cankaya HC, Iridon M, Matula DW (1999) Performance analysis of a graph model for channel assignment in a cellular network. In: Proceedings. Twenty-third annual international computer software and applications conference (Cat. No.99CB37032), pp 239\u2013240","DOI":"10.1109\/CMPSAC.1999.812707"},{"key":"5803_CR11","doi-asserted-by":"crossref","unstructured":"Sharma PC, Chaudhari NS (2011) A graph coloring approach for channel assignment in cellular network via propositional satisfiability. In: 2011 international conference on emerging trends in networks and computer communications (ETNCC), pp 23\u201326","DOI":"10.1109\/ETNCC.2011.5958479"},{"key":"5803_CR12","doi-asserted-by":"crossref","unstructured":"Sharma PC, Chaudhari NS (2012) Channel assignment problem in cellular network and its reduction to satisfiability using graph k-colorability. In: 2012 7th IEEE conference on industrial electronics and applications (ICIEA), pp 1734\u20131737","DOI":"10.1109\/ICIEA.2012.6361005"},{"issue":"2","key":"5803_CR13","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1109\/TVT.2005.863351","volume":"55","author":"SC Ghosh","year":"2006","unstructured":"Ghosh SC, Sinha BP, Das N (2006) Coalesced CAP: an improved technique for frequency assignment in cellular networks. IEEE Trans Veh Technol 55(2):640","journal-title":"IEEE Trans Veh Technol"},{"issue":"8","key":"5803_CR14","first-page":"1","volume":"PP","author":"CC Coskun","year":"2017","unstructured":"Coskun CC, Davaslioglu K, Ayanoglu E (2017) Three-stage resource allocation algorithm for energy-efficient heterogeneous networks. IEEE Trans Veh Technol PP(8):1","journal-title":"IEEE Trans Veh Technol"},{"key":"5803_CR15","unstructured":"Yu J, Han S, Li X (2018) A robust game-based algorithm for downlink joint resource allocation in hierarchical OFDMA femtocell network system. IEEE Trans Syst Man Cybern Syst 1\u201311"},{"key":"5803_CR16","doi-asserted-by":"publisher","first-page":"59690","DOI":"10.1109\/ACCESS.2019.2914973","volume":"7","author":"H Chour","year":"2019","unstructured":"Chour H, Jorswieck EA, Bader F, Nasser Y, Bazzi O (2019) Global optimal resource allocation for efficient FD-D2D enabled cellular network. IEEE Access 7:59690","journal-title":"IEEE Access"},{"issue":"2","key":"5803_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/TNN.2010.2091653","volume":"22","author":"C Zhao","year":"2011","unstructured":"Zhao C, Gan L (2011) Dynamic channel assignment for large-scale cellular networks using noisy chaotic neural network. IEEE Trans Neural Netw 22(2):222","journal-title":"IEEE Trans Neural Netw"},{"key":"5803_CR18","unstructured":"Ansari AQ, Saxena PC, Gupta KD (2012) In: 2012 fourth international conference on computational intelligence and communication networks, pp 815\u2013818"},{"issue":"1","key":"5803_CR19","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1109\/TVT.2019.2954538","volume":"69","author":"X Liao","year":"2020","unstructured":"Liao X, Shi J, Li Z, Zhang L, Xia B (2020) A model-driven deep reinforcement learning heuristic algorithm for resource allocation in ultra-dense cellular networks. IEEE Trans Veh Technol 69(1):983","journal-title":"IEEE Trans Veh Technol"},{"issue":"11","key":"5803_CR20","doi-asserted-by":"publisher","first-page":"5141","DOI":"10.1109\/TWC.2019.2933417","volume":"18","author":"N Zhao","year":"2019","unstructured":"Zhao N, Liang Y, Niyato D, Pei Y, Wu M, Jiang Y (2019) Deep reinforcement learning for user association and resource allocation in heterogeneous cellular networks. IEEE Trans Wirel Commun 18(11):5141","journal-title":"IEEE Trans Wirel Commun"},{"issue":"2","key":"5803_CR21","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/wcm.114","volume":"3","author":"AY Zomaya","year":"2010","unstructured":"Zomaya AY, Smith A, Seredynski F (2010) The use of the simulated annealing algorithm for channel allocation in mobile computing. Wirel Commun Mob Comput 3(2):239","journal-title":"Wirel Commun Mob Comput"},{"key":"5803_CR22","doi-asserted-by":"crossref","unstructured":"Girdinio P, Nervi M, Rossi M (2006) An improved simulated annealing algorithm for the channel allocation problem in cellular networks. In: 2006 12th Biennial IEEE conference on electromagnetic field computation, pp 126","DOI":"10.1109\/CEFC-06.2006.1632918"},{"key":"5803_CR23","unstructured":"Peng Y, Wang L, Soong BH (2003) Optimal channel assignment in cellular systems using tabu search. In: 14th IEEE proceedings on personal, indoor and mobile radio communications. PIMRC 2003, vol 1, pp 31\u201335"},{"key":"5803_CR24","doi-asserted-by":"crossref","unstructured":"Gozupek D, Genc G, Ersoy C (2009) Channel assignment problem in cellular networks: a reactive tabu search approach. In: 2009 24th international symposium on computer and information sciences, pp 298\u2013303","DOI":"10.1109\/ISCIS.2009.5291830"},{"issue":"3","key":"5803_CR25","doi-asserted-by":"publisher","first-page":"1823","DOI":"10.1109\/TVT.2007.907311","volume":"57","author":"LMO Khanbary","year":"2008","unstructured":"Khanbary LMO, Vidyarthi DP (2008) A GA-based effective fault-tolerant model for channel allocation in mobile computing. IEEE Trans Veh Technol 57(3):1823\u20131833","journal-title":"IEEE Trans Veh Technol"},{"key":"5803_CR26","doi-asserted-by":"crossref","unstructured":"Marappan R, Sethumadhavan G (2016) Solving channel allocation problem using new genetic algorithm with clique partitioning method. In: 2016 IEEE international conference on computational intelligence and computing research (ICCIC), pp 1\u20134","DOI":"10.1109\/ICCIC.2016.7919671"},{"key":"5803_CR27","doi-asserted-by":"crossref","unstructured":"An J, Hines EL, Leeson MS, Sun L, Ren W, Iliescu DD (2007) Genetic algorithms and fuzzy logic for dynamic channel allocation in cellular radio networks. In: 2007 IEEE radio and wireless symposium, pp 19\u201322","DOI":"10.1109\/RWS.2007.351779"},{"key":"5803_CR28","doi-asserted-by":"crossref","unstructured":"Shafi F, Sheikh JA, Mehboob-ul-Amin (2018) Efficient resource allocation in future networks using bio-inspired algorithm. In: 2018 international conference on smart systems and inventive technology (ICSSIT), pp 527\u2013531","DOI":"10.1109\/ICSSIT.2018.8748505"},{"key":"5803_CR29","doi-asserted-by":"crossref","unstructured":"Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, zcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64(12):1695","DOI":"10.1057\/jors.2013.71"},{"issue":"2","key":"5803_CR30","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MCI.2018.2807018","volume":"13","author":"I Amaya","year":"2018","unstructured":"Amaya I, Ortiz-Bayliss JC, Rosales-Perez A, Gutierrez-Rodriguez AE, Conant-Pablos SE, Terashima-Marin H, Coello Coello CA (2018) Enhancing selection hyper-heuristics via feature transformations. IEEE Comput Intell Mag 13(2):30","journal-title":"IEEE Comput Intell Mag"},{"issue":"6","key":"5803_CR31","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1109\/TEVC.2013.2281527","volume":"17","author":"NR Sabar","year":"2013","unstructured":"Sabar NR, Ayob M, Kendall G, Qu R (2013) Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans Evol Comput 17(6):840","journal-title":"IEEE Trans Evol Comput"},{"key":"5803_CR32","first-page":"S00200255183046","volume":"463\u2013464","author":"V Pandiri","year":"2018","unstructured":"Pandiri V, Alok S (2018) A hyper-heuristic based artificial bee colony algorithm for k-interconnected multi-depot multi-traveling salesman problem. Inf Sci 463\u2013464:S0020025518304675","journal-title":"Inf Sci"},{"key":"5803_CR33","unstructured":"Kendall G, Mohamad M (2004) Channel assignment in cellular communication using a great deluge hyper-heuristic. In: Proceedings. 2004 12th IEEE international conference on networks (ICON 2004) (IEEE Cat. No.04EX955), vol 2, pp 769\u2013773"},{"key":"5803_CR34","doi-asserted-by":"crossref","unstructured":"Kendall G, Mohamad M (2004) Channel assignment optimisation using a hyper-heuristic. In: IEEE conference on cybernetics and intelligent systems, vol 2, pp 791\u2013796","DOI":"10.1109\/ICCIS.2004.1460689"},{"issue":"1","key":"5803_CR35","first-page":"244","volume":"88","author":"L Jiao","year":"2015","unstructured":"Jiao L, Wu J, Dong B (2015) A two-phase knowledge based hyper-heuristic scheduling algorithm in cellular system. Knowl Based Syst 88(1):244\u2013252","journal-title":"Knowl Based Syst"},{"key":"5803_CR36","doi-asserted-by":"crossref","unstructured":"Dong B, Su Y, Zhou Y, Wu X (2020) Coordinative hyper-heuristic resource scheduling in mobile cellular networks","DOI":"10.1007\/978-981-15-7670-6_12"},{"issue":"2","key":"5803_CR37","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TCYB.2014.2322602","volume":"45","author":"R Cheng","year":"2015","unstructured":"Cheng R, Jin Y (2015) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45(2):191","journal-title":"IEEE Trans Cybern"},{"key":"5803_CR38","doi-asserted-by":"crossref","unstructured":"Gu S, Cheng R, Jin Y (2016) Feature selection for high-dimensional classification using a competitive swarm optimizer. Soft Comput 1\u201312","DOI":"10.1007\/s00500-016-2385-6"},{"key":"5803_CR39","unstructured":"Ling T, Zhan ZH, Wang YX, Wang ZJ, Zhang J (2018) A PSO-based hyper-heuristic for evolving dispatching rules in job shop scheduling. In: 2018 IEEE congress on evolutionary computation (CEC), pp 882\u2013889"},{"key":"5803_CR40","doi-asserted-by":"crossref","unstructured":"Zhang L, Zhu Y, Zhong S, Lan R, Luo X (2020) Multi-level competitive swarm optimizer for large scale optimization","DOI":"10.1007\/978-3-030-16946-6_15"},{"key":"5803_CR41","doi-asserted-by":"crossref","unstructured":"Audhya GK, Sinha K, Mandal K, Dattagupta R, Ghosh SC (1814) Sinha BP (2013) A new approach to fast near-optimal channel assignment in cellular mobile networks. IEEE Trans Mob Comput 12(9)","DOI":"10.1109\/TMC.2012.153"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-05803-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-05803-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-05803-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T17:30:48Z","timestamp":1683826248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-05803-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,9]]},"references-count":41,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["5803"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-05803-3","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2021,3,9]]},"assertion":[{"value":"30 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2021","order":3,"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 do not have any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All authors are informed and agree the submission. And this research does not involve any human or animal participation.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human or animal participation"}}]}}