{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:05:03Z","timestamp":1775279103310,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T00:00:00Z","timestamp":1542758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The Scientific Research Deanship at Umm Al-Qura University","award":["43508016"],"award-info":[{"award-number":["43508016"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Netw Syst Manage"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10922-018-9480-1","type":"journal-article","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T21:28:25Z","timestamp":1542749305000},"page":"647-687","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Two Meta-Heuristics Designed to Solve the Minimum Connected Dominating Set Problem for Wireless Networks Design and Management"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9936-5987","authenticated-orcid":false,"given":"Abdel-Rahman","family":"Hedar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rashad","family":"Ismail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gamal A.","family":"El-Sayed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalid M. Jamil","family":"Khayyat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"issue":"4","key":"9480_CR1","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1109\/TNET.2017.2690359","volume":"25","author":"X Gao","year":"2017","unstructured":"Gao, X., Zhu, X., Li, J., Fan, W., Chen, G., Ding-Zhu, D., Tang, S.: A novel approximation for multi-hop connected clustering problem in wireless networks. IEEE\/ACM Trans. Netw. 25(4), 2223\u20132234 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9480_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.comnet.2017.05.017","volume":"123","author":"JP Mohanty","year":"2017","unstructured":"Mohanty, J.P., Mandal, C., Reade, C.: Distributed construction of minimum connected dominating set in wireless sensor network using two-hop information. Comput. Netw. 123, 137\u2013152 (2017)","journal-title":"Comput. Netw."},{"key":"9480_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.adhoc.2016.02.003","volume":"42","author":"JP Mohanty","year":"2016","unstructured":"Mohanty, J.P., Mandal, C., Reade, C., Das, A.: Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set. Ad Hoc Netw. 42, 61\u201373 (2016)","journal-title":"Ad Hoc Netw."},{"issue":"3","key":"9480_CR4","first-page":"3","volume":"1","author":"V Narasimha Raghavan","year":"2007","unstructured":"Narasimha Raghavan, V., Arvind Ranganath, R., Bharath, N., Khan, M.F.: Simple and efficient backbone algorithm for calculating connected dominating set in wireless adhoc networks. Int. J. Electron. Circuits Syst. 1(3), 3\u201318 (2007)","journal-title":"Int. J. Electron. Circuits Syst."},{"issue":"9","key":"9480_CR5","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/TMC.2008.22","volume":"7","author":"MT Thai","year":"2008","unstructured":"Thai, M.T., Tiwari, R., Du, D.-Z.: On construction of virtual backbone in wireless ad hoc networks with unidirectional links. IEEE Trans. Mobile Comput. 7(9), 1098\u20131109 (2008)","journal-title":"IEEE Trans. Mobile Comput."},{"issue":"5","key":"9480_CR6","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1016\/j.comnet.2009.10.007","volume":"54","author":"JA Torkestani","year":"2010","unstructured":"Torkestani, J.A., Meybodi, M.R.: An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata. Comput. Netw. 54(5), 826\u2013843 (2010)","journal-title":"Comput. Netw."},{"key":"9480_CR7","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Proceedings INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1597\u20131604. IEEE (2002)","DOI":"10.1109\/INFCOM.2002.1019411"},{"key":"9480_CR8","first-page":"1","volume":"21","author":"F Yu","year":"2016","unstructured":"Yu, F., Xia, X., Li, W., Tao, J., Ma, L., Cai, Z.-Q.: Critical node identification for complex network based on a novel minimum connected dominating set. Soft Comput. 21, 1\u20139 (2016)","journal-title":"Soft Comput."},{"issue":"19","key":"9480_CR9","doi-asserted-by":"publisher","first-page":"5621","DOI":"10.1007\/s00500-016-2303-y","volume":"21","author":"Y Fahong","year":"2017","unstructured":"Fahong, Y., Xia, X., Li, W., Tao, J., Ma, L., Cai, Z.: Critical node identification for complex network based on a novel minimum connected dominating set. Soft Comput. 21(19), 5621\u20135629 (2017)","journal-title":"Soft Comput."},{"issue":"2","key":"9480_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10922-007-9062-0","volume":"15","author":"L Paradis","year":"2007","unstructured":"Paradis, L., Han, Q.: A survey of fault management in wireless sensor networks. J. Netw. Syst. Manag. 15(2), 171\u2013190 (2007)","journal-title":"J. Netw. Syst. Manag."},{"issue":"2","key":"9480_CR11","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s10922-016-9398-4","volume":"25","author":"C Ferreira","year":"2017","unstructured":"Ferreira, C., Guardalben, L., Gomes, T., Sargento, S., Salvador, P., Robalo, D., Velez, F.J.: Supporting unified distributed management and autonomic decisions: design, implementation and deployment. J. Netw. Syst. Manag. 25(2), 416\u2013456 (2017)","journal-title":"J. Netw. Syst. Manag."},{"key":"9480_CR12","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (1998)"},{"key":"9480_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of np-Completeness","author":"RG Michael","year":"1979","unstructured":"Michael, R.G., David, S.J.: Computers and Intractability: A Guide to the Theory of np-Completeness. WH Freeman & Co., San Francisco (1979)"},{"key":"9480_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/b101874","volume-title":"Handbook of Metaheuristics","author":"F Glover","year":"2003","unstructured":"Glover, F., Kochenberger, G.A.: Handbook of Metaheuristics. Springer, Berlin (2003)"},{"issue":"3","key":"9480_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/1063656041774956","volume":"12","author":"P Merz","year":"2004","unstructured":"Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evolut. Comput. 12(3), 303\u2013325 (2004)","journal-title":"Evolut. Comput."},{"key":"9480_CR16","first-page":"1","volume-title":"Essays and Surveys in Metaheuristics","author":"E Aarts","year":"2002","unstructured":"Aarts, E., Korst, J.: Selected topics in simulated annealing. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 1\u201337. Springer, Berlin (2002)"},{"issue":"3\u20134","key":"9480_CR17","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1080\/10556780310001645189","volume":"19","author":"A-R Hedar","year":"2004","unstructured":"Hedar, A.-R., Fukushima, M.: Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization. Optim. Methods Softw. 19(3\u20134), 291\u2013308 (2004)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"9480_CR18","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10898-005-3693-z","volume":"35","author":"A-R Hedar","year":"2006","unstructured":"Hedar, A.-R., Fukushima, M.: Derivative-free filter simulated annealing method for constrained continuous global optimization. J. Glob. Optim. 35(4), 521\u2013549 (2006)","journal-title":"J. Glob. Optim."},{"issue":"4598","key":"9480_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Vecchi, M.P., et al.: Optimization by simmulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"9480_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/0-387-28356-0_7","volume-title":"Search Methodologies","author":"E Aarts","year":"2005","unstructured":"Aarts, E., Korst, J., Michiels, W.: Simulated annealing. In: Burke, E.K. (ed.) Search Methodologies, pp. 187\u2013210. Springer, Berlin (2005)"},{"issue":"5","key":"9480_CR21","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1080\/1055678021000030084","volume":"17","author":"A-R Hedar","year":"2002","unstructured":"Hedar, A.-R., Fukushima, M.: Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization. Optim. Methods Softw. 17(5), 891\u2013912 (2002)","journal-title":"Optim. Methods Softw."},{"key":"9480_CR22","unstructured":"Moscato, P., et\u00a0al.: On genetic crossover operators for relative order preservation. C3P Report, pp. 778 (1989)"},{"issue":"3","key":"9480_CR23","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1109\/TIM.2004.827093","volume":"53","author":"M Pastorino","year":"2004","unstructured":"Pastorino, M., Caorsi, S., Massa, A., Randazzo, A.: Reconstruction algorithms for electromagnetic imaging. IEEE Trans. Instrum. Meas. 53(3), 692\u2013699 (2004)","journal-title":"IEEE Trans. Instrum. Meas."},{"key":"9480_CR24","doi-asserted-by":"crossref","unstructured":"Hedar, A.-R., Ismail, R.: Hybrid genetic algorithm for minimum dominating set problem. In: Computational Science and Its Applications\u2013ICCSA 2010, pp. 457\u2013467. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-12189-0_40"},{"key":"9480_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/NECO_a_00798","volume":"28","author":"R Li","year":"2016","unstructured":"Li, R., Hu, S., Gao, J., Zhou, Y., Wang, Y., Yin, M.: Grasp for connected dominating set problems. Neural Comput. Appl. 28, 1\u20139 (2016)","journal-title":"Neural Comput. Appl."},{"issue":"3","key":"9480_CR26","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/TPDS.2009.78","volume":"21","author":"R Misra","year":"2010","unstructured":"Misra, R., Mandal, C.: Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks. IEEE Trans. Parallel Distrib. Syst. 21(3), 292\u2013302 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"9480_CR27","first-page":"22","volume":"7","author":"AK Yadav","year":"2014","unstructured":"Yadav, A.K., Yadav, R.S., Singh, R., Singh, A.K.: Connected dominating set for wireless ad hoc networks: a survey. Int. J. Eng. Syst. Modell. Simul. 7(1), 22\u201334 (2014)","journal-title":"Int. J. Eng. Syst. Modell. Simul."},{"key":"9480_CR28","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.endm.2015.07.011","volume":"50","author":"RS Coelho","year":"2015","unstructured":"Coelho, R.S., Moura, P.F.S., Wakabayashi, Y.: The k-hop connected dominating set problem: hardness and polyhedra. Electron. Notes Discrete Math. 50, 59\u201364 (2015)","journal-title":"Electron. Notes Discrete Math."},{"key":"9480_CR29","first-page":"783","volume-title":"Handbook of Combinatorial Optimization","author":"D Hongjie","year":"2013","unstructured":"Hongjie, D., Ding, L., Weili, W., Kim, D., Pardalos, P.M., Willson, J.: Connected dominating set in wireless networks. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 783\u2013833. Springer, Berlin (2013)"},{"key":"9480_CR30","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, pp. 365\u2013372 (2003)","DOI":"10.1145\/780542.780597"},{"issue":"4","key":"9480_CR31","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","volume":"40","author":"C Swamy","year":"2004","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245\u2013269 (2004)","journal-title":"Algorithmica"},{"key":"9480_CR32","unstructured":"Cheng, X., Ding, M., Chen, D.: An approximation algorithm for connected dominating set in ad hoc networks. In: Proceedings of International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor, and Peer-to-Peer Networks (TAWN) (2004)"},{"issue":"10","key":"9480_CR33","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1109\/TC.2004.69","volume":"53","author":"W Jie","year":"2004","unstructured":"Jie, W., Dai, F.: A generic distributed broadcast scheme in ad hoc wireless networks. IEEE Trans. Comput. 53(10), 1343\u20131354 (2004)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"9480_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11227-013-1021-9","volume":"68","author":"P Rawat","year":"2014","unstructured":"Rawat, P., Singh, K.D., Chaouchi, H., Bonnin, J.M.: Wireless sensor networks: a survey on recent developments and potential synergies. J. Supercomput. 68(1), 1\u201348 (2014)","journal-title":"J. Supercomput."},{"key":"9480_CR35","doi-asserted-by":"crossref","unstructured":"Hongwei, D., Ye, Q., Weili, W., Lee, W., Li, D., Dingzhu, D., Howard, S.: Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks. In: 2011 Proceedings IEEE INFOCOM, pp. 1737\u20131744. IEEE (2011)","DOI":"10.1109\/INFCOM.2011.5934967"},{"key":"9480_CR36","doi-asserted-by":"crossref","unstructured":"Ren, S., Yi, P., Lin, Z., Guo, C., Wu, Y.: Constructing minimum connected dominating sets with constant update time in wireless ad-hoc sensor networks. In: 2014 IEEE 17th International Conference on Computational Science and Engineering (CSE), pp. 1570\u20131576. IEEE (2014)","DOI":"10.1109\/CSE.2014.290"},{"key":"9480_CR37","doi-asserted-by":"crossref","unstructured":"Ren, S., Yi, P., Hong, D., Wu, Y., Zhu, T.: Distributed construction of connected dominating sets optimized by minimum-weight spanning tree in wireless ad-hoc sensor networks. In: 2014 IEEE 17th International Conference on Computational Science and Engineering (CSE), pp. 901\u2013908. IEEE (2014)","DOI":"10.1109\/CSE.2014.183"},{"issue":"2","key":"9480_CR38","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPDS.2008.74","volume":"20","author":"D Kim","year":"2009","unstructured":"Kim, D., Yiwei, W., Li, Y., Zou, F., Ding-Zhu, D.: Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Trans. Parallel Distrib. Syst. 20(2), 147\u2013157 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"9480_CR39","first-page":"162","volume":"1","author":"L Wang","year":"2013","unstructured":"Wang, L., Wan, P.-J., Yao, F.: Minimum cds in multihop wireless networks with disparate communication ranges. IEEE Trans. Mobile Comput. 1(3), 162\u2013168 (2013)","journal-title":"IEEE Trans. Mobile Comput."},{"key":"9480_CR40","unstructured":"Mohanty, J.P., Mandal, C.: A distributed greedy algorithm for construction of minimum connected dominating set in wireless sensor network. In: Applications and Innovations in Mobile Computing (AIMoC), 2014, pp. 104\u2013110. IEEE (2014)"},{"key":"9480_CR41","doi-asserted-by":"crossref","unstructured":"Kui, X., Wang, J., Zhang, S.: A data gathering algorithm based on energy-balanced connected dominating sets in wireless sensor networks. In: 2013 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1139\u20131144. IEEE (2013)","DOI":"10.1109\/WCNC.2013.6554724"},{"issue":"1","key":"9480_CR42","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10922-006-9052-7","volume":"15","author":"A Malatras","year":"2007","unstructured":"Malatras, A., Hadjiantonis, A.M., Pavlou, G.: Exploiting context-awareness for the autonomic management of mobile ad hoc networks. J. Netw. Syst. Manag. 15(1), 29\u201355 (2007)","journal-title":"J. Netw. Syst. Manag."},{"issue":"3","key":"9480_CR43","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10922-006-9039-4","volume":"14","author":"B Aoun","year":"2006","unstructured":"Aoun, B., Boutaba, R.: Clustering in wsn with latency and energy consumption constraints. J. Netw. Syst. Manag. 14(3), 415\u2013439 (2006)","journal-title":"J. Netw. Syst. Manag."},{"issue":"4","key":"9480_CR44","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"9480_CR45","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan, L., Hongwei, D., Jia, X., Weili, W., Li, Y., Ko, K.-I.: A greedy approximation for minimum connected dominating sets. Theor. Comput. Sci. 329(1\u20133), 325\u2013330 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"9480_CR46","first-page":"1","volume":"352","author":"W Weili","year":"2006","unstructured":"Weili, W., Hongwei, D., Jia, X., Li, Y., Huang, S.C.-H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor. Comput. Sci. 352(1\u20133), 1\u20137 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9480_CR47","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2011.12.007","volume":"428","author":"S Kamei","year":"2012","unstructured":"Kamei, S., Kakugawa, H.: A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs. Theor. Comput. Sci. 428, 80\u201390 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"9480_CR48","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1016\/j.jpdc.2005.12.010","volume":"66","author":"F Dai","year":"2006","unstructured":"Dai, F., Jie, W.: On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. J. Parallel Distrib. Comput. 66(7), 947\u2013958 (2006)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9480_CR49","unstructured":"Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad hoc networks using a spine. In: Proceedings Sixth International Conference on Computer Communications and Networks, 1997, pp. 34\u201339. IEEE (1997)"},{"key":"9480_CR50","doi-asserted-by":"crossref","unstructured":"Wu, J., Li, H.: On calculating connected dominating set forefficient routing in ad hoc wireless networks. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7\u201314. ACM (1999)","DOI":"10.1145\/313239.313261"},{"key":"9480_CR51","first-page":"1","volume":"97","author":"B Das","year":"1997","unstructured":"Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad-hoc network using a virtual backbone. Proc. ACM SIGCOMM 97, 1\u201320 (1997)","journal-title":"Proc. ACM SIGCOMM"},{"issue":"1","key":"9480_CR52","doi-asserted-by":"publisher","first-page":"133","DOI":"10.2298\/CSIS110927038J","volume":"10","author":"R Jovanovic","year":"2013","unstructured":"Jovanovic, R., Tuba, M.: Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem. Comput. Sci. Inf. Syst. 10(1), 133\u2013149 (2013)","journal-title":"Comput. Sci. Inf. Syst."},{"key":"9480_CR53","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.asoc.2017.06.023","volume":"59","author":"ZA Dagdeviren","year":"2017","unstructured":"Dagdeviren, Z.A., Aydin, D., Cinsdikici, M.: Two population-based optimization algorithms for minimum weight connected dominating set problem. Appl. Soft Comput. 59, 644\u2013658 (2017)","journal-title":"Appl. Soft Comput."},{"key":"9480_CR54","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jnca.2016.11.013","volume":"78","author":"G Kumar","year":"2017","unstructured":"Kumar, G., Rai, M.K.: An energy efficient and optimized load balanced localization method using cds with one-hop neighbourhood and genetic algorithm in wsns. J. Netw. Comput. Appl. 78, 73\u201382 (2017)","journal-title":"J. Netw. Comput. Appl."},{"key":"9480_CR55","volume-title":"Multi-objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms, vol. 16. Wiley, Hoboken (2001)"},{"key":"9480_CR56","unstructured":"Baker, J.E.: Adaptive selection methods for genetic algorithms. In Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 101\u2013111. ACM, Hillsdale (1985)"},{"issue":"4","key":"9480_CR57","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1006504901164","volume":"12","author":"F Herrera","year":"1998","unstructured":"Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: operators and tools for behavioural analysis. Artif. Intell. Rev. 12(4), 265\u2013319 (1998)","journal-title":"Artif. Intell. Rev."},{"key":"9480_CR58","doi-asserted-by":"crossref","unstructured":"Hedar, A.-R., Ismail, R., El Sayed, G.A., Khayyat, : K.M.J.: Two meta-heuristics for the minimum connected dominating set problem with an application in wireless networks. In 2015 3rd International Conference on Applied Computing and Information Technology\/2nd International Conference on Computational Science and Intelligence (ACIT-CSI), pp. 355\u2013362. IEEE (2015)","DOI":"10.1109\/ACIT-CSI.2015.68"},{"issue":"2","key":"9480_CR59","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s13042-011-0043-y","volume":"3","author":"A-R Hedar","year":"2012","unstructured":"Hedar, A.-R., Ismail, R.: Simulated annealing with stochastic local search for minimum dominating set problem. Int. J. Mach. Learn. Cybern. 3(2), 97\u2013109 (2012)","journal-title":"Int. J. Mach. Learn. Cybern."},{"issue":"1","key":"9480_CR60","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-001-0101-z","volume":"33","author":"LA Sanchis","year":"2002","unstructured":"Sanchis, L.A.: Experimental analysis of heuristic algorithms for the dominating set problem. Algorithmica 33(1), 3\u201318 (2002)","journal-title":"Algorithmica"},{"issue":"10","key":"9480_CR61","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s00500-008-0392-y","volume":"13","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda, S., Fern\u00e1ndez, A., Luengo, J., Herrera, F.: A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability. Soft Comput. 13(10), 959\u2013977 (2009)","journal-title":"Soft Comput."},{"key":"9480_CR62","doi-asserted-by":"publisher","DOI":"10.1201\/9781420036268","volume-title":"Handbook of Parametric and Nonparametric Statistical Procedures","author":"David J Sheskin","year":"2003","unstructured":"Sheskin, David J.: Handbook of Parametric and Nonparametric Statistical Procedures. CRC Press, Boca Raton (2003)"}],"container-title":["Journal of Network and Systems Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-018-9480-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10922-018-9480-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-018-9480-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:22:19Z","timestamp":1775276539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10922-018-9480-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,21]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9480"],"URL":"https:\/\/doi.org\/10.1007\/s10922-018-9480-1","relation":{},"ISSN":["1064-7570","1573-7705"],"issn-type":[{"value":"1064-7570","type":"print"},{"value":"1573-7705","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,21]]},"assertion":[{"value":"29 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}