{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T23:14:40Z","timestamp":1768691680966,"version":"3.49.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,12,25]],"date-time":"2014-12-25T00:00:00Z","timestamp":1419465600000},"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":["Appl Intell"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10489-014-0623-0","type":"journal-article","created":{"date-parts":[[2014,12,24]],"date-time":"2014-12-24T04:02:59Z","timestamp":1419393779000},"page":"751-776","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Best-order crossover for permutation-based evolutionary algorithms"],"prefix":"10.1007","volume":"42","author":[{"given":"Anca","family":"Andreica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camelia","family":"Chira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,25]]},"reference":[{"key":"623_CR1","first-page":"689","volume-title":"Applying Evolutionary Algorithms to Combinatorial Optimization Problems, ICCS 2001, LNCS 2074","author":"E Alba Torres","year":"2004","unstructured":"Alba Torres E, Khuri S (2004) Applying Evolutionary Algorithms to Combinatorial Optimization Problems, ICCS 2001, LNCS 2074. Springer Verlag, Berlin Heidelberg, pp 689\u2013698"},{"key":"623_CR2","first-page":"364","volume":"6","author":"A Andreica","year":"2014","unstructured":"Andreica A, Chira C (2014) Best-Order Crossover in an Evolutionary Approach to Multi-Mode Resource-Constrained Project Scheduling. International Journal of Computer Information Systems and Industrial Management (IJCISIM) 6:364\u2013372","journal-title":"International Journal of Computer Information Systems and Industrial Management (IJCISIM)"},{"key":"623_CR3","unstructured":"Augerat P, Belenguer JM, Benavent E, Corbern A, Naddef D, Rinaldi G (1995) Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem, Research Report 949-M, Universite Joseph Fourier, Grenoble, France"},{"key":"623_CR4","doi-asserted-by":"crossref","DOI":"10.1887\/0750308958","volume-title":"Handbook of Evolutionary Computation","author":"T Back","year":"1997","unstructured":"Back T, Fogel DB, Michalewicz Z (1997) Handbook of Evolutionary Computation (1st ed.) IOP Publ. Ltd., Bristol","edition":"1"},{"key":"623_CR5","first-page":"310","volume":"1996","author":"C Bierwirth","year":"1996","unstructured":"Bierwirth C, Mattfeld DC, Kopfer H (1996) On Permutation Representations for Scheduling Problems. PPSN 1996:310\u2013318","journal-title":"PPSN"},{"key":"623_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz J, Lenstra J, Rinnooy Kan A (1983) Scheduling subject to resource constraints: Classification and complexity. Discret Appl Math 5:11\u201324","journal-title":"Discret Appl Math"},{"key":"623_CR7","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Comput Surv 35:268\u2013308","journal-title":"ACM Comput Surv"},{"key":"623_CR8","doi-asserted-by":"crossref","unstructured":"Blum C, Roli A, Sampels M (2008) Hybrid Metaheuristics - An Emerging Approach to Optimization, Studies in Computational Intelligence, Vol 114. Springer","DOI":"10.1007\/978-3-540-78295-7"},{"key":"623_CR9","doi-asserted-by":"crossref","first-page":"5211","DOI":"10.1103\/PhysRevLett.86.5211","volume":"86","author":"S Boettcher","year":"2001","unstructured":"Boettcher S, Percus AG (2001) Optimization with Extremal Dynamics. Phys Rev Lett 86:5211\u20135214","journal-title":"Phys Rev Lett"},{"key":"623_CR10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V Cerny","year":"1985","unstructured":"Cerny V (1985) Thermodynamical approach to the Traveling salesman problem: An efficient simulation algorithm. J Optim Theory Appl 45:41\u201351","journal-title":"J Optim Theory Appl"},{"key":"623_CR11","unstructured":"Chira C, Gog A (2012) Recombination operators in permutation-based evolutionary algorithms for the travelling salesman problem, Chapter 10 in Logistics Management and Optimization through Hybrid Artificial Intelligence Systems. IGI Global:268\u2013285"},{"key":"623_CR12","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.neucom.2013.07.051","volume":"135","author":"C Chira","year":"2014","unstructured":"Chira C, Sedano J, Villar JR, Camara M, Corchado E (2014) Urban bicycles renting systems: Modelling and optimization using nature-inspired search methods. Neurocomputing 135:98\u2013106","journal-title":"Neurocomputing"},{"key":"623_CR13","doi-asserted-by":"crossref","DOI":"10.5962\/bhl.title.82303","volume-title":"On the Origin of Species by Means of Natural Selection, or the Preservation of Favoured Races in the Struggle for Life","author":"C Darwin","year":"1859","unstructured":"Darwin C (1859) On the Origin of Species by Means of Natural Selection, or the Preservation of Favoured Races in the Struggle for Life. John Murray, London. modern reprint Charles Darwin, Julian Huxley, The Origin of Species. Signet Classics (2003)"},{"key":"623_CR14","unstructured":"Davis L (1985) Applying Adaptive Algorithms to Epistatic Domains, IJCAI. Morgan Kaufmann:162\u2013164"},{"issue":"1","key":"623_CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"623_CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-662-04448-3_2","volume-title":"Theoretical Aspects of Evolutionary Computing, Natural Computing Series","author":"AE Eiben","year":"2001","unstructured":"Eiben AE (2001) Evolutionary Algorithms and Constraint Satisfaction: Definitions, Survey, Methodology, and Research Directions. In: Kallel L, Naudts B, Rogers A (eds) Theoretical Aspects of Evolutionary Computing, Natural Computing Series, pp 13\u201330. Springer, Berlin Heidelberg"},{"key":"623_CR17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.engappai.2013.09.013","volume":"27","author":"SM Elsayed","year":"2014","unstructured":"Elsayed SM, Sarker RA, Essam DL (2014) A new genetic algorithm for solving optimization problems. Eng Appl AI 27:57\u201369","journal-title":"Eng Appl AI"},{"key":"623_CR18","first-page":"14","volume":"4","author":"L Fogel","year":"1962","unstructured":"Fogel L (1962) Autonomous automata. Ind Res 4:14\u201319","journal-title":"Ind Res"},{"key":"623_CR19","volume-title":"Artificial Intelligence through Simulated Evolution","author":"L Fogel","year":"1966","unstructured":"Fogel L, Owens A, Walsh M (1966) Artificial Intelligence through Simulated Evolution. John Wiley, New York"},{"key":"623_CR20","doi-asserted-by":"crossref","DOI":"10.1109\/9780470544600","volume-title":"Evolutionary Computation: the Fossil Record","author":"D Fogel","year":"1998","unstructured":"Fogel D (1998) Evolutionary Computation: the Fossil Record. IEEE Press, New York"},{"key":"623_CR21","doi-asserted-by":"crossref","unstructured":"Gen M, Cheng R (2000) Genetic Algorithms and Engineering Optimization. John Wiley","DOI":"10.1002\/9780470172261"},{"issue":"5","key":"623_CR22","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future Paths for Integer Programming and Links to Artificial Intelligence. Comput Oper Res 13(5):533\u2013549","journal-title":"Comput Oper Res"},{"issue":"2","key":"623_CR23","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu Search \u2013 Part 1. ORSA J Comput 1(2):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"623_CR24","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu Search \u2013 Part 2. ORSA J Comput 2(1):4\u201332","journal-title":"ORSA J Comput"},{"key":"623_CR25","unstructured":"Goldberg DE, Lingle R (1985) Alleles, loci, and the traveling salesman problem, Proceedings of an International Conference on Genetic Algorithms and Their Applications, 154\u2013159"},{"key":"623_CR26","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg D (1989) Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, MA"},{"issue":"1","key":"623_CR27","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10489-006-0033-z","volume":"27","author":"FT Hanshar","year":"2007","unstructured":"Hanshar FT, Ombuki-Berman BM (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27(1):89\u201399","journal-title":"Appl Intell"},{"key":"623_CR28","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C","volume":"45","author":"S Hartmann","year":"1998","unstructured":"Hartmann S (1998) A Competitive Genetic Algorithm for Resource-Constrained Project Scheduling. Nav Res Logist 45:733\u2013750","journal-title":"Nav Res Logist"},{"issue":"4","key":"623_CR29","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.engappai.2007.06.001","volume":"21","author":"W Ho","year":"2008","unstructured":"Ho W, Ho G TS, Ji P, Lau HCW (2008) A hybrid genetic algorithm for the multi-depot vehicle routing problem. Eng Appl AI 21(4):548\u2013557","journal-title":"Eng Appl AI"},{"key":"623_CR30","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/321127.321128","volume":"3","author":"JH Holland","year":"1962","unstructured":"Holland JH (1962) Outline for a logical theory of adaptive systems. J ACM 3:297\u2013314","journal-title":"J ACM"},{"key":"623_CR31","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor"},{"key":"623_CR32","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1145\/1569901.1569984","volume":"2009","author":"M Jahne","year":"2009","unstructured":"Jahne M, Li X, Branke J (2009) Evolutionary algorithms and multi-objectivization for the travelling salesman problem. GECCO 2009:595\u2013602","journal-title":"GECCO"},{"key":"623_CR33","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility Among Combinatorial Problems. In: Miller R E, Thatcher J W (eds) Complexity of Computer Computations. Plenum, New York, pp 85\u2013103"},{"key":"623_CR34","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization, Proceedings of the 1995 IEEE Intern. Conf. Neural Networks, Perth, Australia, IEEE press, 4, pp 1942\u2013 1948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4598","key":"623_CR35","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by Simulated Annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"623_CR36","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. Eur J Oper Res 90:320\u2013333","journal-title":"Eur J Oper Res"},{"key":"623_CR37","doi-asserted-by":"crossref","unstructured":"Kolisch R, Schwindt C, Sprecher A (1999) Handbook on recent advances in project scheduling, pp 197\u2013212","DOI":"10.1007\/978-1-4615-5533-9_9"},{"key":"623_CR38","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza JR (1992) Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge"},{"issue":"2","key":"623_CR39","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larranaga","year":"1999","unstructured":"Larranaga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S (1999) Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artif Intell Rev 13(2):129\u2013170","journal-title":"Artif Intell Rev"},{"key":"623_CR40","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra J K, Rinnooy Kan AHG (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221\u2013227","journal-title":"Networks"},{"issue":"4","key":"623_CR41","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1016\/j.engappai.2012.10.006","volume":"26","author":"D Lin","year":"2013","unstructured":"Lin D, Lee CKM, Ho W (2013) Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop. Eng Appl AI 26(4):1282\u20131290","journal-title":"Eng Appl AI"},{"issue":"1","key":"623_CR42","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/TSMCB.2009.2025775","volume":"40","author":"J Liu","year":"2010","unstructured":"Liu J, Zhong W, Jiao L (2010) A Multiagent Evolutionary Algorithm for Combinatorial Optimization Problems. IEEE Trans Syst Man Cybern B 40(1):229\u2013240","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"623_CR43","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to Solve It: Modern Heuristics","author":"Z Michalewicz","year":"2004","unstructured":"Michalewicz Z, Fogel DB (2004) How to Solve It: Modern Heuristics, 2nd edn. Springer-Verlag, Berlin, Heidelberg","edition":"2"},{"issue":"3","key":"623_CR44","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/S0377-2217(01)00227-2","volume":"140","author":"C Moon","year":"2002","unstructured":"Moon C, Kim J, Choi G, Seo Y (2002) An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur J Oper Res 140(3):606\u2013617","journal-title":"Eur J Oper Res"},{"key":"623_CR45","volume-title":"A study of permutation crossover operators on the traveling salesman problem Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, pp 224\u2013230","author":"IM Oliver","year":"1987","unstructured":"Oliver IM, Smith DJ, Holland JRC (1987) A study of permutation crossover operators on the traveling salesman problem Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, pp 224\u2013230. L. E. Associates, Inc., Mahwah"},{"key":"623_CR46","doi-asserted-by":"crossref","unstructured":"Onwubolu GC, Davendra D (2008) Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization, Studies in Computational Intelligence, Vol 175. Springer","DOI":"10.1007\/978-3-540-92151-6"},{"key":"623_CR47","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.neucom.2012.03.032","volume":"109","author":"PC Pop","year":"2013","unstructured":"Pop PC, Matei O, Pop Sitar C (2013) An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109:76\u201383","journal-title":"Neurocomputing"},{"issue":"12","key":"623_CR48","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & OR 31(12):1985\u2013 2002","journal-title":"Computers & OR"},{"issue":"3","key":"623_CR49","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10489-006-0018-y","volume":"26","author":"S Ray","year":"2007","unstructured":"Ray S, Bandyopadhyay S, Pal SK (2007) Genetic operators for combinatorial optimization in TSP and microarray gene ordering. Appl Intell 26(3):183\u2013195","journal-title":"Appl Intell"},{"key":"623_CR50","unstructured":"Rechenberg I (1965) Cybernetic solution path of an experimental problem, Tech. Rep. 1122, Royal Aircraft Establishment"},{"key":"623_CR51","volume-title":"Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg I (1973) Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart"},{"key":"623_CR52","unstructured":"Reeves CR (1995) Genetic algorithms and combinatorial optimization. In V. J. Rayward-Smith, editor, Applications of modern heuristic methods, pp 111\u2013125. Alfred Waller Ltd., Henley-on-Thames"},{"key":"623_CR53","doi-asserted-by":"crossref","unstructured":"Reinelt G (1991) TSPLIB - A Traveling Salesman Problem Library. ORSA J Comput:376\u2013384","DOI":"10.1287\/ijoc.3.4.376"},{"key":"623_CR54","volume-title":"Kybernetische Evolution als Strategie der experimentellen Forschung in der Stromungstechnik. Masters thesis","author":"H-P Schwefel","year":"1965","unstructured":"Schwefel H-P (1965) Kybernetische Evolution als Strategie der experimentellen Forschung in der Stromungstechnik. Masters thesis. Technische Universitat Berlin, Berlin"},{"key":"623_CR55","first-page":"3","volume":"3","author":"V Snasel","year":"2009","unstructured":"Snasel V, Platos J, Kromer P, Ouddane N (2009) Genetic Algorithms for the Use in Combinatorial Problems. Foundations of Computational Intelligence 3:3\u201322","journal-title":"Foundations of Computational Intelligence"},{"key":"623_CR56","unstructured":"Storn R, Price K (1997) Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11"},{"key":"623_CR57","unstructured":"Syswerda G (1991). In: Van Nostrand Reinhold D L (ed) Schedule Optimization Using Genetic Algorithms, Handbook of Genetic Algorithms, New York, pp 332\u2013349"},{"issue":"1","key":"623_CR58","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers & OR 40(1):475\u2013489","journal-title":"Computers & OR"},{"key":"623_CR59","doi-asserted-by":"crossref","unstructured":"Wang H, Lin D, Li M (2005) A Genetic Algorithm for Solving Resource-Constrained Project Scheduling Problem. ICNC (3):185\u2013193","DOI":"10.1007\/11539902_22"},{"key":"623_CR60","first-page":"163","volume":"1994","author":"D Whitley","year":"1994","unstructured":"Whitley D, Yoo N-W (1994) Modeling Simple Genetic Algorithms for Permutation Problems. FOGA 1994:163\u2013184","journal-title":"FOGA"},{"key":"623_CR61","volume-title":"Handbook of Evolutionary Computation","author":"D Whitley","year":"1997","unstructured":"Whitley D (1997) Permutations, in Thomas Back. In: Fogel D B, Michalewicz Z (eds) Handbook of Evolutionary Computation, 1st edn. IOP Publ. Ltd., Bristol","edition":"1"},{"key":"623_CR62","doi-asserted-by":"crossref","unstructured":"Whitley D, Sutton A M, Howe A E, Barbulescu L (2008) Resource Scheduling with Permutation Based Representations: Three Applications. Evolutionary Computation in Practice:219\u2013243","DOI":"10.1007\/978-3-540-75771-9_10"},{"issue":"1","key":"623_CR63","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.cie.2011.11.019","volume":"65","author":"Y Yun","year":"2013","unstructured":"Yun Y, Chung H, Moon C (2013) Hybrid genetic algorithm approach for precedence-constrained sequencing problem. Comput. Ind. Eng 65(1):137\u2013147","journal-title":"Comput. Ind. Eng"},{"key":"623_CR64","volume-title":"Population Diversity in Permutation-Based Genetic Algorithm, Machine Learning: ECML 2004, Lecture Notes in Computer Science 3201, pp 537\u2013547","author":"KQ Zhu","year":"2004","unstructured":"Zhu KQ, Liu Z (2004) Population Diversity in Permutation-Based Genetic Algorithm, Machine Learning: ECML 2004, Lecture Notes in Computer Science 3201, pp 537\u2013547. Springer, Berlin Heidelberg"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0623-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0623-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0623-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T08:11:28Z","timestamp":1650874288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0623-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,25]]},"references-count":64,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["623"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0623-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,25]]}}}