{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T05:13:57Z","timestamp":1772082837919,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:00:00Z","timestamp":1556755200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10732-019-09414-z","type":"journal-article","created":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T14:04:29Z","timestamp":1556805869000},"page":"861-899","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An evolutionary hybrid search heuristic for monitor placement in communication networks"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2172-6711","authenticated-orcid":false,"given":"Robin","family":"Mueller-Bady","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kappes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inmaculada","family":"Medina-Bulo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Palomo-Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,2]]},"reference":[{"key":"9414_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/11803089_22","volume-title":"Artificial Intelligence and Neural Networks","author":"L Aksoy","year":"2006","unstructured":"Aksoy, L., Gunes, E.O.: An evolutionary local search algorithm for the satisfiability problem. In: Savaci, F.A. (ed.) Artificial Intelligence and Neural Networks, pp. 185\u2013193. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/11803089_22"},{"key":"9414_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77610-1","volume-title":"Cellular Genetic Algorithms, Operations Research\/Computer Science Interfaces Series","author":"E Alba","year":"2008","unstructured":"Alba, E., Dorronsoro, B.: Cellular Genetic Algorithms, Operations Research\/Computer Science Interfaces Series, vol. 42. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-77610-1"},{"key":"9414_CR3","doi-asserted-by":"publisher","unstructured":"Back, T., Khuri, S.: An evolutionary heuristic for the maximum independent set problem. In: Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, IEEE, pp. 531\u2013535 (1994). https:\/\/doi.org\/10.1109\/ICEC.1994.350004","DOI":"10.1109\/ICEC.1994.350004"},{"issue":"18","key":"9414_CR4","doi-asserted-by":"publisher","first-page":"5803","DOI":"10.1002\/sec.1737","volume":"9","author":"K Benzekki","year":"2016","unstructured":"Benzekki, K., El Fergougui, A., Elbelrhiti Elalaoui, A.: Software-defined networking (SDN): a survey. Secur. Commun. Netw. 9(18), 5803\u20135833 (2016). https:\/\/doi.org\/10.1002\/sec.1737","journal-title":"Secur. Commun. Netw."},{"issue":"4","key":"9414_CR5","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti, S.P., Everett, M.G.: A graph-theoretic perspective on centrality. Soc. Netw. 28(4), 466\u2013484 (2006). https:\/\/doi.org\/10.1016\/j.socnet.2005.11.005","journal-title":"Soc. Netw."},{"key":"9414_CR6","doi-asserted-by":"crossref","unstructured":"Cai, S.: Balance between complexity and quality: local search for minimum vertex cover in massive graphs. In: Proceedings of the 24th International Conference on Artificial Intelligence, AAAI Press, pp. 747\u2013753 (2015)","DOI":"10.1609\/aaai.v29i1.9357"},{"issue":"9\u201310","key":"9414_CR7","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai, S., Su, K., Sattar, A.: Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif. Intell. 175(9\u201310), 1672\u20131696 (2011). https:\/\/doi.org\/10.1016\/j.artint.2011.03.003","journal-title":"Artif. Intell."},{"issue":"1","key":"9414_CR8","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K., Luo, C., Sattar, A.: NuMVC: an efficient local search algorithm for minimum vertex cover. J. Artif. Intell. Res. 46(1), 687\u2013716 (2013). https:\/\/doi.org\/10.1613\/jair.3907","journal-title":"J. Artif. Intell. Res."},{"key":"9414_CR9","doi-asserted-by":"publisher","unstructured":"Cantieni, G.R., Iannaccone, G., Barakat, C., Diot, C., Thiran, P.: Reformulating the monitor placement problem. In: Proceedings of the 2006 ACM CoNEXT conference on\u2014CoNEXT \u201906, ACM Press, New York, USA, CoNEXT \u201906, p.\u00a01 (2006). https:\/\/doi.org\/10.1145\/1368436.1368444","DOI":"10.1145\/1368436.1368444"},{"key":"9414_CR10","doi-asserted-by":"publisher","unstructured":"Chauhan, A., Friedrich, T., Quinzan, F.: Approximating optimization problems using EAs on scale-free networks. In: Proceedings of the Genetic and Evolutionary Computation Conference on\u2014GECCO \u201917, ACM Press, New York, USA, pp. 235\u2013242 (2017). https:\/\/doi.org\/10.1145\/3071178.3071257","DOI":"10.1145\/3071178.3071257"},{"issue":"11\u201312","key":"9414_CR11","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CA Coello Coello","year":"2002","unstructured":"Coello Coello, C.A.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput. Methods Appl. Mech. Eng. 191(11\u201312), 1245\u20131287 (2002). https:\/\/doi.org\/10.1016\/S0045-7825(01)00323-1","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"9414_CR12","unstructured":"Cohoon, J.P., Hedge, S.U., Martine, W.N., Richards, D.: Punctuated equilibria: a parallel genetic algorithm. In: Proceedings of the Second International Conference on Genetic Algorithms on Genetic Algorithms and Their Application, L. Erlbaum Associates Inc., pp. 148\u2013154 (1987)"},{"key":"9414_CR13","doi-asserted-by":"publisher","unstructured":"Darwin, C.: On the origin of species by means of natural selection, or, the preservation of favoured races in the struggle for life. John Murray, London (1859). https:\/\/doi.org\/10.5962\/bhl.title.59991","DOI":"10.5962\/bhl.title.59991"},{"key":"9414_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/11526216","volume-title":"Quantum Annealing and Other Optimization Methods, Lecture Notes in Physics","author":"A Das","year":"2005","unstructured":"Das, A., Chakrabarti, B.K.: Quantum Annealing and Other Optimization Methods, Lecture Notes in Physics, vol. 679. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/11526216"},{"key":"9414_CR15","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"Reinhard Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 5th edn. Springer, Berlin (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"issue":"1","key":"9414_CR16","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating vertex cover. Ann. Math. 162(1), 439\u2013485 (2005). https:\/\/doi.org\/10.4007\/annals.2005.162.439","journal-title":"Ann. Math."},{"issue":"4","key":"9414_CR17","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64(4), 673\u2013697 (2012). https:\/\/doi.org\/10.1007\/s00453-012-9622-x","journal-title":"Algorithmica"},{"issue":"3","key":"9414_CR18","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.cor.2010.08.017","volume":"38","author":"C Duhamel","year":"2011","unstructured":"Duhamel, C., Lacomme, P., Quilliot, A., Toussaint, H.: A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput. Oper. Res. 38(3), 617\u2013640 (2011). https:\/\/doi.org\/10.1016\/j.cor.2010.08.017","journal-title":"Comput. Oper. Res."},{"key":"9414_CR19","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"A.E. Eiben","year":"2015","unstructured":"Eiben, A., Smith, J.: Introduction to Evolutionary Computing, Natural Computing Series, 2nd edn. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-662-44874-8"},{"key":"9414_CR20","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BFb0040790","volume-title":"Lecture Notes in Computer Science","author":"Isaac K. Evans","year":"1998","unstructured":"Evans, I.K.: Evolutionary algorithms for vertex cover. In: International Conference on Evolutionary Programming, Springer, pp. 377\u2013386 (1998). https:\/\/doi.org\/10.1007\/BFb0040790"},{"key":"9414_CR21","doi-asserted-by":"publisher","DOI":"10.1002\/9780470172261","volume-title":"Genetic Algorithms and Engineering Optimization, Wiley Series in Engineering Design and Automation","author":"M Gen","year":"1999","unstructured":"Gen, M., Cheng, R.: Genetic Algorithms and Engineering Optimization, Wiley Series in Engineering Design and Automation, vol. 7. Wiley, Hoboken (1999). https:\/\/doi.org\/10.1002\/9780470172261"},{"issue":"1\u20132","key":"9414_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0255(96)00121-1","volume":"95","author":"F Ghannadian","year":"1996","unstructured":"Ghannadian, F., Alford, C., Shonkwiler, R.: Application of random restart to genetic algorithms. Inf. Sci. 95(1\u20132), 81\u2013102 (1996). https:\/\/doi.org\/10.1016\/S0020-0255(96)00121-1","journal-title":"Inf. Sci."},{"key":"9414_CR23","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc, Boston (1989)"},{"issue":"2","key":"9414_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950). https:\/\/doi.org\/10.1002\/j.1538-7305.1950.tb00463.x","journal-title":"Bell Syst. Tech. J."},{"key":"9414_CR25","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. MIT Press, Cambridge (1992)"},{"key":"9414_CR26","doi-asserted-by":"publisher","unstructured":"Jackson, A.W., Milliken, W., Santivanez, C.A., Condell, M., Strayer, W.T.: A topological analysis of monitor placement. In: Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), IEEE, pp. 169\u2013178 (2007). https:\/\/doi.org\/10.1109\/NCA.2007.3","DOI":"10.1109\/NCA.2007.3"},{"key":"9414_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Richard M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, Springer, Boston, pp. 85\u2013103 (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"4598","key":"9414_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"issue":"6","key":"9414_CR29","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MNET.2012.6375890","volume":"26","author":"S Knight","year":"2012","unstructured":"Knight, S., Falkner, N., Nguyen, H.X., Tune, P., Roughan, M.: I can see for miles: re-visualizing the internet. IEEE Netw. 26(6), 26\u201332 (2012). https:\/\/doi.org\/10.1109\/MNET.2012.6375890","journal-title":"IEEE Netw."},{"key":"9414_CR30","doi-asserted-by":"publisher","unstructured":"Lagraa, S., Francois, J.: Knowledge discovery of port scans from darknet. In: 2017 IFIP\/IEEE Symposium on Integrated Network and Service Management (IM), IEEE, pp. 935\u2013940 (2017). https:\/\/doi.org\/10.23919\/INM.2017.7987415","DOI":"10.23919\/INM.2017.7987415"},{"issue":"4","key":"9414_CR31","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699\u2013719 (1966). https:\/\/doi.org\/10.1287\/opre.14.4.699","journal-title":"Oper. Res."},{"issue":"1","key":"9414_CR32","doi-asserted-by":"publisher","first-page":"2-es","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution. ACM Trans. Knowl. Discov. Data 1(1), 2-es (2007). https:\/\/doi.org\/10.1145\/1217299.1217301","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"9414_CR33","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., Birattari, M., St\u00fctzle, T.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper. Res. Perspect."},{"key":"9414_CR34","doi-asserted-by":"publisher","unstructured":"Luling, R., Monien, B.: Load balancing for distributed branch and bound algorithms. In: Proceedings Sixth International Parallel Processing Symposium, IEEE Computer Soc. Press, pp. 543\u2013548 (1992). https:\/\/doi.org\/10.1109\/IPPS.1992.222970","DOI":"10.1109\/IPPS.1992.222970"},{"key":"9414_CR35","unstructured":"Mahfoud, S.: Crowding and preselection revisited. In: Urbana, vol. 51 (1992)"},{"issue":"1","key":"9414_CR36","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"Mann, H.B., Whitney, D.R.: On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Stat. 18(1), 50\u201360 (1947). https:\/\/doi.org\/10.1214\/aoms\/1177730491","journal-title":"Ann. Math. Stat."},{"issue":"17","key":"9414_CR37","doi-asserted-by":"publisher","first-page":"3641","DOI":"10.1016\/j.comnet.2013.08.011","volume":"57","author":"M Manzano","year":"2013","unstructured":"Manzano, M., Calle, E., Torres-Padrosa, V., Segovia, J., Harle, D.: Endurance: a new robustness measure for complex networks under multiple failure scenarios. Comput. Netw. 57(17), 3641\u20133653 (2013). https:\/\/doi.org\/10.1016\/j.comnet.2013.08.011","journal-title":"Comput. Netw."},{"issue":"1","key":"9414_CR38","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/4236.978369","volume":"6","author":"R Matei","year":"2002","unstructured":"Matei, R., Iamnitchi, A., Foster, P.: Mapping the Gnutella network. IEEE Internet Comput. 6(1), 50\u201357 (2002). https:\/\/doi.org\/10.1109\/4236.978369","journal-title":"IEEE Internet Comput."},{"key":"9414_CR39","doi-asserted-by":"crossref","unstructured":"McKinney, W.: Data structures for statistical computing in python. In: van\u00a0der Walt, S., Millman, J. (Eds.) Proceedings of the 9th Python in Science Conference, pp. 51\u201356 (2010)","DOI":"10.25080\/Majora-92bf1922-00a"},{"issue":"4","key":"9414_CR40","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.swevo.2011.10.001","volume":"1","author":"E Mezura-Montes","year":"2011","unstructured":"Mezura-Montes, E., Coello Coello, C.A.: Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evolut. Comput. 1(4), 173\u2013194 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.10.001","journal-title":"Swarm Evolut. Comput."},{"key":"9414_CR41","first-page":"1251","volume":"29","author":"M Milancovic","year":"2012","unstructured":"Milancovic, M.: Solving the generalized vertex cover problem by genetic algorithm. Comput. Inform. 29, 1251\u20131265 (2012)","journal-title":"Comput. Inform."},{"issue":"2","key":"9414_CR42","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/MCSE.2011.36","volume":"13","author":"KJ Millman","year":"2011","unstructured":"Millman, K.J., Aivazis, M.: Python for scientists and engineers. Comput. Sci. Eng. 13(2), 9\u201312 (2011). https:\/\/doi.org\/10.1109\/MCSE.2011.36","journal-title":"Comput. Sci. Eng."},{"key":"9414_CR43","doi-asserted-by":"publisher","unstructured":"Mueller-Bady, R., Gad, R., Kappes, M., Medina-Bulo, I.: Using genetic algorithms for deadline-constrained monitor selection in dynamic computer networks. In: Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference\u2014GECCO Companion \u201915, ACM Press, New York, USA, pp. 867\u2013874 (2015). https:\/\/doi.org\/10.1145\/2739482.2768430","DOI":"10.1145\/2739482.2768430"},{"key":"9414_CR44","doi-asserted-by":"publisher","unstructured":"Mueller-Bady, R., Kappes, M., Bulo, I.M., Palomo-Lozano, F.: Leveraging diversity in evolutionary algorithms using a population injection method. In: 2016 20th International Conference on System Theory, Control and Computing (ICSTCC), IEEE, pp. 526\u2013531 (2016). https:\/\/doi.org\/10.1109\/ICSTCC.2016.7790719","DOI":"10.1109\/ICSTCC.2016.7790719"},{"key":"9414_CR45","doi-asserted-by":"publisher","unstructured":"Mueller-Bady, R., Kappes, M., Atkinson, L., Medina-Bulo, I.: Multijob: a framework for efficient distribution of evolutionary algorithms for parameter tuning. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion on\u2014GECCO \u201917, ACM Press, New York, USA, pp. 1231\u20131238 (2017a). https:\/\/doi.org\/10.1145\/3067695.3082476","DOI":"10.1145\/3067695.3082476"},{"key":"9414_CR46","doi-asserted-by":"publisher","unstructured":"Mueller-Bady, R., Kappes, M., Medina-Bulo, I., Palomo-Lozano, F.: Optimization of monitoring in dynamic communication networks using a hybrid evolutionary algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference on\u2014GECCO \u201917, ACM Press, New York, USA, pp. 1200\u20131207 (2017b). https:\/\/doi.org\/10.1145\/3071178.3071255","DOI":"10.1145\/3071178.3071255"},{"issue":"6\u20137","key":"9414_CR47","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/S0167-8191(05)80052-3","volume":"17","author":"H M\u00fchlenbein","year":"1991","unstructured":"M\u00fchlenbein, H., Schomisch, M., Born, J.: The parallel genetic algorithm as function optimizer. Parallel Comput. 17(6\u20137), 619\u2013632 (1991). https:\/\/doi.org\/10.1016\/S0167-8191(05)80052-3","journal-title":"Parallel Comput."},{"issue":"1","key":"9414_CR48","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"MJ Newman","year":"2005","unstructured":"Newman, M.J.: A measure of betweenness centrality based on random walks. Soc. Netw. 27(1), 39\u201354 (2005). https:\/\/doi.org\/10.1016\/j.socnet.2004.11.009","journal-title":"Soc. Netw."},{"key":"9414_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/b10910","volume-title":"Hierarchical Bayesian Optimization Algorithm, Studies in Fuzziness and Soft Computing","author":"M Pelikan","year":"2005","unstructured":"Pelikan, M.: Hierarchical Bayesian Optimization Algorithm, Studies in Fuzziness and Soft Computing, vol. 170. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/b10910"},{"key":"9414_CR50","unstructured":"Pelikan, M., Goldberg, D.E.: Escaping hierarchical traps with competent genetic algorithms. In: Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, GECCO\u201901, pp. 511\u2013518 (2001)"},{"issue":"1","key":"9414_CR51","doi-asserted-by":"publisher","first-page":"33","DOI":"10.14445\/22312803\/IJCTT-V17P108","volume":"17","author":"D Pratap Chandu","year":"2014","unstructured":"Pratap Chandu, D.: A parallel genetic algorithm for three dimensional bin packing with heterogeneous bins. Int. J. Comput. Trends Technol. 17(1), 33\u201338 (2014). https:\/\/doi.org\/10.14445\/22312803\/IJCTT-V17P108","journal-title":"Int. J. Comput. Trends Technol."},{"key":"9414_CR52","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-74565-5_31","volume-title":"Lecture Notes in Computer Science","author":"Silvia Richter","year":"2007","unstructured":"Richter, S., Helmert, M., Gretton, C.: A stochastic local search approach to vertex cover. In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007: Advances in Artificial Intelligence, Springer, Berlin, pp. 412\u2013426 (2007). https:\/\/doi.org\/10.1007\/978-3-540-74565-5_31"},{"key":"9414_CR53","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI Press, pp. 4292\u20134293 (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"9414_CR54","unstructured":"Spears, W.: Simple subpopulation schemes. In: Proceedings of the Evolutionary Programming Conference, World Scientific, vol.\u00a03, pp. 296\u2013307 (1994)"},{"issue":"1","key":"9414_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0378-8733(89)90016-6","volume":"11","author":"K Stephenson","year":"1989","unstructured":"Stephenson, K., Zelen, M.: Rethinking centrality: methods and examples. Soc. Netw. 11(1), 1\u201337 (1989). https:\/\/doi.org\/10.1016\/0378-8733(89)90016-6","journal-title":"Soc. Netw."},{"issue":"1","key":"9414_CR56","first-page":"42","volume":"36","author":"O Tange","year":"2011","unstructured":"Tange, O.: GNU parallel: the command-line power tool. USENIX Mag. 36(1), 42\u201347 (2011)","journal-title":"USENIX Mag."},{"key":"9414_CR57","doi-asserted-by":"publisher","unstructured":"Ulker, O., Landa-Silva, D.: Evolutionary local search for solving the office space allocation problem. In: 2012 IEEE Congress on Evolutionary Computation, IEEE, pp. 1\u20138 (2012). https:\/\/doi.org\/10.1109\/CEC.2012.6253009","DOI":"10.1109\/CEC.2012.6253009"},{"key":"9414_CR58","volume-title":"Handbook of Theoretical Computer Science","author":"J van Leeuwen","year":"1990","unstructured":"van Leeuwen, J.: Handbook of Theoretical Computer Science. MIT Press, Cambridge (1990)"},{"key":"9414_CR59","unstructured":"Whitley, D.: Cellular genetic algorithms. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA93), Morgan Kaufmann Publishers Inc., p. 658 (1993)"},{"issue":"1","key":"9414_CR60","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Trans. Evolut. Comput. 1(1), 67\u201382 (1997). https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"6","key":"9414_CR61","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TEVC.2005.856205","volume":"9","author":"D Wolpert","year":"2005","unstructured":"Wolpert, D., Macready, W.: Coevolutionary free lunches. IEEE Trans. Evolut. Comput. 9(6), 721\u2013735 (2005). https:\/\/doi.org\/10.1109\/TEVC.2005.856205","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"9414_CR62","doi-asserted-by":"publisher","unstructured":"Zhang, D., Cetinkaya, E.K., Sterbenz, J.P.: Robustness of mobile ad hoc networks under centrality-based attacks. In: 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), IEEE, pp. 229\u2013235 (2013). https:\/\/doi.org\/10.1109\/ICUMT.2013.6798431","DOI":"10.1109\/ICUMT.2013.6798431"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09414-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-019-09414-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09414-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T08:38:59Z","timestamp":1663403939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-019-09414-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,2]]},"references-count":62,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["9414"],"URL":"https:\/\/doi.org\/10.1007\/s10732-019-09414-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,2]]},"assertion":[{"value":"17 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}