{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:49:26Z","timestamp":1648568966829},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T00:00:00Z","timestamp":1495584000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10710-017-9305-0","type":"journal-article","created":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T11:17:00Z","timestamp":1495624620000},"page":"183-210","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Cooperative evolutionary heterogeneous simulated annealing algorithm for google machine reassignment problem"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-8415-7328","authenticated-orcid":false,"given":"Ayad","family":"Turky","sequence":"first","affiliation":[]},{"given":"Nasser R.","family":"Sabar","sequence":"additional","affiliation":[]},{"given":"Andy","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"9305_CR1","unstructured":"Roadef\/euro Challenge 2012: Machine Reassignment. http:\/\/challenge.roadef.org\/2012\/en\/"},{"key":"9305_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-016-2203-7","volume":"242","author":"HM Afsar","year":"2016","unstructured":"H.M. Afsar, C. Artigues, E. Bourreau, S. Kedad-Sidhoum, Machine reassignment problem: the ROADEF\/EURO challenge 2012. Ann. Oper. Res. 242, 1\u201317 (2016)","journal-title":"Ann. Oper. Res."},{"key":"9305_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0471739383","volume-title":"Parallel Metaheuristics: A New Class of Algorithms","author":"E Alba","year":"2005","unstructured":"E. Alba, Parallel Metaheuristics: A New Class of Algorithms, vol. 47 (Wiley, New York, 2005)"},{"issue":"1","key":"9305_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2012.00862.x","volume":"20","author":"E Alba","year":"2013","unstructured":"E. Alba, G. Luque, S. Nesmachnow, Parallel metaheuristics: recent advances and new trends. Int. Trans. Oper. Res. 20(1), 1\u201348 (2013)","journal-title":"Int. Trans. Oper. Res."},{"issue":"4","key":"9305_CR5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1721654.1721672","volume":"53","author":"M Armbrust","year":"2010","unstructured":"M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica et al., A view of cloud computing. Commun. ACM 53(4), 50\u201358 (2010)","journal-title":"Commun. ACM"},{"issue":"2","key":"9305_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0968-090X(97)00005-3","volume":"5","author":"P Badeau","year":"1997","unstructured":"P. Badeau, F. Guertin, M. Gendreau, J.-Y. Potvin, E. Taillard, A parallel tabu search heuristic for the vehicle routing problem with time windows. Transp. Res. Part C Emerg. Technol. 5(2), 109\u2013122 (1997)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"9305_CR7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.cor.2015.07.002","volume":"65","author":"R Bellio","year":"2016","unstructured":"R. Bellio, S. Ceschia, L. Di Gaspero, A. Schaerf, T. Urli, Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Comput. Oper. Res. 65, 83\u201392 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9305_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10479-014-1772-6","volume":"242","author":"F Brandt","year":"2012","unstructured":"F. Brandt, J. Speck, M. V\u00f6lker, Constraint-based large neighborhood search for machine reassignment. Ann. Oper. Res. 242(1), 63\u201391 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9305_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.995","volume":"41","author":"RN Calheiros","year":"2011","unstructured":"R.N. Calheiros, R. Ranjan, A. Beloglazov, C.A. De Rose, R. Buyya, Cloudsim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Softw. Pract. Exp. 41(1), 23\u201350 (2011)","journal-title":"Softw. Pract. Exp."},{"key":"9305_CR10","doi-asserted-by":"crossref","unstructured":"T.G. Crainic, M. Toulouse, Parallel meta-heuristics. in Handbook of Metaheuristics, 2nd edn, ed. by M. Gendreau, J.Y. Potvin (Springer, 2010), pp. 497\u2013541","DOI":"10.1007\/978-1-4419-1665-5_17"},{"key":"9305_CR11","doi-asserted-by":"crossref","unstructured":"M. El-Abd, M. Kamel, A taxonomy of cooperative search algorithms. in International Workshop on Hybrid Metaheuristics (Springer, 2005), pp. 32\u201341","DOI":"10.1007\/11546245_4"},{"issue":"10","key":"9305_CR12","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"S. Garc\u00eda, A. Fern\u00e1ndez, J. Luengo, F. Herrera, Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf. Sci. 180(10), 2044\u20132064 (2010)","journal-title":"Inf. Sci."},{"key":"9305_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.endm.2012.10.028","volume":"39","author":"H Gavranovi\u0107","year":"2012","unstructured":"H. Gavranovi\u0107, M. Buljuba\u0161i\u0107, E. Demirovi\u0107, Variable neighborhood search for google machine reassignment problem. Electron. Notes Discret. Math. 39, 209\u2013216 (2012)","journal-title":"Electron. Notes Discret. Math."},{"issue":"10","key":"9305_CR14","doi-asserted-by":"crossref","first-page":"1962","DOI":"10.1109\/TCYB.2014.2308917","volume":"44","author":"S Huda","year":"2014","unstructured":"S. Huda, J. Yearwood, R. Togneri, Hybrid metaheuristic approaches to the expectation maximization for estimation of the hidden markov model for signal modeling. Cybern. IEEE Trans. 44(10), 1962\u20131977 (2014)","journal-title":"Cybern. IEEE Trans."},{"issue":"4","key":"9305_CR15","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1057\/jors.2015.77","volume":"67","author":"G Kendall","year":"2016","unstructured":"G. Kendall, R. Bai, J. B\u0142azewicz, P. De Causmaecker, M. Gendreau, R. John, J. Li, B. McCollum, E. Pesch, R. Qu et al., Good laboratory practice for optimization research. J. Oper. Res. Soc. 67(4), 676\u2013689 (2016)","journal-title":"J. Oper. Res. Soc."},{"issue":"4598","key":"9305_CR16","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi et al., Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"4","key":"9305_CR17","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1287\/ijoc.1060.0200","volume":"19","author":"D Landa-Silva","year":"2007","unstructured":"D. Landa-Silva, E.K. Burke, Asynchronous cooperative local search for the office-space-allocation problem. INFORMS J. Comput. 19(4), 575\u2013587 (2007)","journal-title":"INFORMS J. Comput."},{"key":"9305_CR18","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1016\/j.asoc.2015.08.058","volume":"37","author":"S-W Lin","year":"2015","unstructured":"S.-W. Lin, F.Y. Vincent, A simulated annealing heuristic for the multiconstraint team orienteering problem with multiple time windows. Appl. Soft Comput. 37, 632\u2013642 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"9305_CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1111\/itor.12063","volume":"22","author":"R Lopes","year":"2015","unstructured":"R. Lopes, V.W. Morais, T.F. Noronha, V.A. Souza, Heuristics and matheuristics for a real-life machine reassignment problem. Int. Trans. Oper. Res. 22(1), 77\u201395 (2015)","journal-title":"Int. Trans. Oper. Res."},{"key":"9305_CR20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.parco.2016.02.001","volume":"53","author":"Z Lou","year":"2016","unstructured":"Z. Lou, J. Reinitz, Parallel simulated annealing using an adaptive resampling interval. Parallel Comput. 53, 23\u201331 (2016)","journal-title":"Parallel Comput."},{"key":"9305_CR21","doi-asserted-by":"crossref","unstructured":"Y. Malitsky, D. Mehta, B. O\u2019Sullivan, H. Simonis, Tuning parameters of large neighborhood search for the machine reassignment problem. in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Springer, 2013), pp. 176\u2013192","DOI":"10.1007\/978-3-642-38171-3_12"},{"issue":"1","key":"9305_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.10.012","volume":"226","author":"R Mart\u00ed","year":"2013","unstructured":"R. Mart\u00ed, M.G. Resende, C.C. Ribeiro, Multi-start methods for combinatorial optimization. Eur. J. Oper. Res. 226(1), 1\u20138 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"13","key":"9305_CR23","doi-asserted-by":"crossref","first-page":"5266","DOI":"10.1016\/j.eswa.2013.03.037","volume":"40","author":"R Masson","year":"2013","unstructured":"R. Masson, T. Vidal, J. Michallet, P.H.V. Penna, V. Petrucci, A. Subramanian, H. Dubedout, An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Syst. Appl. 40(13), 5266\u20135275 (2013)","journal-title":"Expert Syst. Appl."},{"key":"9305_CR24","doi-asserted-by":"crossref","unstructured":"D. Mehta, B. O\u2019Sullivan, H. Simonis, Comparing solution methods for the machine reassignment problem. in Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, ed. by M. Milano (Springer, Berlin, Heidelberg, 2012), pp. 782\u2013797","DOI":"10.1007\/978-3-642-33558-7_56"},{"issue":"2","key":"9305_CR25","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TEVC.2010.2051446","volume":"15","author":"Y Mei","year":"2011","unstructured":"Y. Mei, K. Tang, X. Yao, Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem. IEEE Trans. Evol. Comput. 15(2), 151\u2013165 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"9305_CR26","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1109\/TSMCB.2011.2158307","volume":"41","author":"Y Mei","year":"2011","unstructured":"Y. Mei, K. Tang, X. Yao, A memetic algorithm for periodic capacitated arc routing problem. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 41(6), 1654\u20131667 (2011)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B (Cybern.)"},{"issue":"1","key":"9305_CR27","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10479-015-2002-6","volume":"242","author":"M Mrad","year":"2015","unstructured":"M. Mrad, A. Gharbi, M. Haouari, M. Kharbeche, An optimization-based heuristic for the machine reassignment problem. Ann. Oper. Res. 242(1), 115\u2013132 (2015)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9305_CR28","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1504\/IJSTL.2016.073323","volume":"8","author":"D Mu","year":"2016","unstructured":"D. Mu, C. Wang, F. Zhao, J.W. Sutherland, Solving vehicle routing problem with simultaneous pickup and delivery using parallel simulated annealing algorithm. Int. J. Ship. Transp. Logist. 8(1), 81\u2013106 (2016)","journal-title":"Int. J. Ship. Transp. Logist."},{"key":"9305_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"F. Neri, C. Cotta, Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol. Comput. 2, 1\u201314 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"9305_CR30","doi-asserted-by":"crossref","first-page":"2257","DOI":"10.1016\/j.procs.2015.05.382","volume":"51","author":"S Pace","year":"2015","unstructured":"S. Pace, A. Turky, I. Moser, A. Aleti, Distributing fibre boards: a practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. Proced. Comput. Sci. 51, 2257\u20132266 (2015)","journal-title":"Proced. Comput. Sci."},{"key":"9305_CR31","doi-asserted-by":"crossref","unstructured":"K. Peng, Y. Shen, J. Li, A multi-objective simulated annealing for bus driver rostering. in Bio-Inspired Computing\u2014Theories and Applications. Communications in Computer and Information Science, vol. 562, ed. by M. Gong, L. Pan, T. Song, K. Tang, X. Zhang (Springer, Berlin, Heidelberg, 2015), pp. 315\u2013330","DOI":"10.1007\/978-3-662-49014-3_29"},{"issue":"1","key":"9305_CR32","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10479-014-1771-7","volume":"242","author":"GM Portal","year":"2016","unstructured":"G.M. Portal, M. Ritt, L. Borba, L.S. Buriol, Simulated annealing for the machine reassignment problem. Ann. Oper. Res. 242(1), 93\u2013114 (2016)","journal-title":"Ann. Oper. Res."},{"key":"9305_CR33","unstructured":"M.R.P. Ritt, An Algorithmic Study of the Machine Reassignment Problem. PhD Thesis, Universidade Federal do Rio Grande do Sul (2012)"},{"issue":"2","key":"9305_CR34","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/TEVC.2016.2602860","volume":"21","author":"N Sabar","year":"2017","unstructured":"N. Sabar, J. Abawajy, J. Yearwood, Heterogeneous cooperative co-evolution memetic differential evolution algorithms for big data optimisation problems. IEEE Trans. Evol. Comput. 21(2), 315\u2013327 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9305_CR35","doi-asserted-by":"crossref","unstructured":"N.R. Sabar, A. Aleti, An adaptive memetic algorithm for the architecture optimisation problem. in Australasian Conference on Artificial Life and Computational Intelligence (Springer, 2017), pp. 254\u2013265","DOI":"10.1007\/978-3-319-51691-2_22"},{"issue":"6","key":"9305_CR36","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1109\/TEVC.2013.2281527","volume":"17","author":"NR Sabar","year":"2013","unstructured":"N.R. Sabar, M. Ayob, G. Kendall, R. Qu, Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans. Evol. Comput. 17(6), 840\u2013861 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"9305_CR37","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/TEVC.2014.2319051","volume":"19","author":"NR Sabar","year":"2015","unstructured":"N.R. Sabar, M. Ayob, G. Kendall, R. Qu, Automatic design of a hyper-heuristic framework with gene expression programming for combinatorial optimization problems. IEEE Trans. Evol. Comput. 19(3), 309\u2013325 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"9305_CR38","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/TCYB.2014.2323936","volume":"45","author":"NR Sabar","year":"2015","unstructured":"N.R. Sabar, M. Ayob, G. Kendall, R. Qu, A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems. IEEE Trans. Cybern. 45(2), 217\u2013228 (2015)","journal-title":"IEEE Trans. Cybern."},{"key":"9305_CR39","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.omega.2015.03.007","volume":"56","author":"NR Sabar","year":"2015","unstructured":"N.R. Sabar, G. Kendall, An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. Omega 56, 88\u201398 (2015)","journal-title":"Omega"},{"key":"9305_CR40","doi-asserted-by":"crossref","unstructured":"N.R. Sabar, A. Song, Grammatical evolution enhancing simulated annealing for the load balancing problem in cloud computing. in Proceedings of the 2016 on Genetic and Evolutionary Computation Conference ACM (2016), pp. 997\u20131003","DOI":"10.1145\/2908812.2908861"},{"key":"9305_CR41","unstructured":"N.R. Sabar, A. Song, Z. Tari, X. Yi, A. Zomaya, A memetic algorithm for dynamic shortest path routing on mobile ad-hoc networks. in Parallel and Distributed Systems (ICPADS), 2015 IEEE 21st International Conference on IEEE (2015), pp. 60\u201367"},{"key":"9305_CR42","doi-asserted-by":"crossref","unstructured":"N.R. Sabar, A. Song, M. Zhang, A variable local search based memetic algorithm for the load balancing problem in cloud computing. in European Conference on the Applications of Evolutionary Computation (Springer, 2016), pp. 267\u2013282","DOI":"10.1007\/978-3-319-31204-0_18"},{"key":"9305_CR43","doi-asserted-by":"crossref","unstructured":"N.R Sabar, A. Turky, A. Song, A multi-memory multi-population memetic algorithm for dynamic shortest path routing in mobile ad-hoc networks. in Pacific Rim International Conference on Artificial Intelligence (Springer, 2016), pp. 406\u2013418","DOI":"10.1007\/978-3-319-42911-3_34"},{"issue":"3","key":"9305_CR44","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/TCYB.2013.2256892","volume":"44","author":"J Sun","year":"2014","unstructured":"J. Sun, Q. Zhang, X. Yao, Meta-heuristic combining prior online and offline information for the quadratic assignment problem. Cybern. IEEE Trans. 44(3), 429\u2013444 (2014)","journal-title":"Cybern. IEEE Trans."},{"key":"9305_CR45","doi-asserted-by":"crossref","unstructured":"A. Turky, N.R. Sabar, A. Sattar, A. Song, Parallel late acceptance hill-climbing algorithm for the google machine reassignment problem. in Australasian Joint Conference on Artificial Intelligence (Springer, 2016), pp. 163\u2013174","DOI":"10.1007\/978-3-319-50127-7_13"},{"key":"9305_CR46","unstructured":"A. Turky, N.R. Sabar, A. Song, A multi-population memetic algorithm for dynamic shortest path routing in mobile ad-hoc networks. in Evolutionary Computation (CEC), 2016 IEEE Congress on IEEE (2016), pp. 4119\u20134126"},{"key":"9305_CR47","doi-asserted-by":"crossref","unstructured":"A. Turky, N.R. Sabar, A. Song, An evolutionary simulated annealing algorithm for google machine reassignment problem. in Intelligent and Evolutionary Systems: The 20th Asia Pacific Symposium, IES 2016, Canberra, Australia, November 2016, Proceedings (Springer, 2017), pp. 431\u2013442","DOI":"10.1007\/978-3-319-49049-6_31"},{"key":"9305_CR48","doi-asserted-by":"crossref","unstructured":"A. Turky, N.R. Sabar, A. Song, Neighbourhood analysis: a case study on google machine reassignment problem. in Australasian Conference on Artificial Life and Computational Intelligence (Springer, 2017), pp. 228\u2013237","DOI":"10.1007\/978-3-319-51691-2_20"},{"key":"9305_CR49","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.cor.2014.10.009","volume":"62","author":"FY Vincent","year":"2015","unstructured":"F.Y. Vincent, S.-Y. Lin, A simulated annealing heuristic for the open location-routing problem. Comput. Oper. Res. 62, 184\u2013196 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"9305_CR50","doi-asserted-by":"crossref","first-page":"2848","DOI":"10.1109\/TCYB.2015.2490669","volume":"46","author":"J Wang","year":"2016","unstructured":"J. Wang, W. Zhang, J. Zhang, Cooperative differential evolution with multiple populations for multiobjective optimization. IEEE Trans. Cybern. 46(12), 2848\u20132861 (2016)","journal-title":"IEEE Trans. Cybern."},{"key":"9305_CR51","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cor.2015.10.015","volume":"68","author":"Z Wang","year":"2016","unstructured":"Z. Wang, Z. L\u00fc, T. Ye, Multi-neighborhood local search optimization for machine reassignment problem. Comput. Oper. Res. 68, 16\u201329 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9305_CR52","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/TSMCB.2009.2020435","volume":"40","author":"S Xavier-de Souza","year":"2010","unstructured":"S. Xavier-de Souza, J.A. Suykens, J. Vandewalle, D. Boll\u00e9, D. Boll\u00e9, Coupled simulated annealing. Syst. Man Cybern. Part B Cybern. IEEE Trans. 40(2), 320\u2013335 (2010)","journal-title":"Syst. Man Cybern. Part B Cybern. IEEE Trans."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-017-9305-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-017-9305-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-017-9305-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T00:44:51Z","timestamp":1569372291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-017-9305-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,24]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["9305"],"URL":"https:\/\/doi.org\/10.1007\/s10710-017-9305-0","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,24]]}}}