{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:06Z","timestamp":1759847946320},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2013,12,25]],"date-time":"2013-12-25T00:00:00Z","timestamp":1387929600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s00500-013-1212-6","type":"journal-article","created":{"date-parts":[[2013,12,24]],"date-time":"2013-12-24T04:22:19Z","timestamp":1387858939000},"page":"2385-2396","source":"Crossref","is-referenced-by-count":15,"title":["Fitness distance analysis for parallel genetic algorithm in the test task scheduling problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Hui","family":"Lu","sequence":"first","affiliation":[]},{"given":"Jing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ruiyao","family":"Niu","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,25]]},"reference":[{"issue":"2","key":"1212_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1111\/j.1467-8640.2010.00367.x","volume":"27","author":"G Acampora","year":"2011","unstructured":"Acampora G, Gaeta M, Loia V (2011a) Combining multi-agent paradigm and memetic computing for personalized and adaptive learning experiences. Comput Intell 27(2):141\u2013165","journal-title":"Comput Intell"},{"issue":"5","key":"1212_CR2","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s00521-009-0273-z","volume":"20","author":"G Acampora","year":"2011","unstructured":"Acampora G, Gaeta M, Loia V (2011b) Hierarchical optimization of personalized experiences for e-Learning systems through evolutionary models. Neural Comput Appl 20(5):641\u2013657","journal-title":"Neural Comput Appl"},{"issue":"4","key":"1212_CR3","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1109\/TII.2011.2166782","volume":"7","author":"G Acampora","year":"2011","unstructured":"Acampora G, Cadenas JM, Loia V, Balleste EM (2011c) Achieving memetic adaptability by Means of agent-based machine learning. IEEE Trans Ind Inform 7(4):557\u2013569","journal-title":"IEEE Trans Ind Inform"},{"issue":"2","key":"1212_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00198963","volume":"69","author":"FQ Bac","year":"1993","unstructured":"Bac FQ, Perov VL (1993) New evolutionary genetic algorithms for NP-complete combinatorial optimization problems. Biol Cybern 69(2):229\u2013234","journal-title":"Biol Cybern"},{"key":"1212_CR5","unstructured":"Brindle A (1981) Genetic algorithms for function optimization. Dissertation, the University of Alberta"},{"key":"1212_CR6","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ins.2012.11.017","volume":"227","author":"F Caraffini","year":"2013","unstructured":"Caraffini F, Neri F, Iacca G, Mol A (2013) Parallel memetic structures. Inform Sci 227:60\u201382","journal-title":"Inform Sci"},{"issue":"1","key":"1212_CR7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10732-010-9155-x","volume":"18","author":"J Czogall","year":"2011","unstructured":"Czogall J, Fink A (2011) Fitness landscape analysis for the no-wait flow-shop scheduling problem. J Heuristics 18(1):25\u201351","journal-title":"J Heuristics"},{"issue":"1\u20134","key":"1212_CR8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s00170-009-2388-x","volume":"49","author":"FM Defersha","year":"2010","unstructured":"Defersha FM, Chen M (2010) A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups. Int J Adv Manuf Tech 49(1\u20134):263\u2013279","journal-title":"Int J Adv Manuf Tech"},{"issue":"1","key":"1212_CR9","first-page":"151","volume":"43","author":"JQ Gao","year":"2009","unstructured":"Gao JQ, He GX, Wang YS (2009) A new parallel genetic algorithm for solving multi-objective scheduling problems subjected to special process constraint. Int J Adv Manuf Tech 43(1):151\u2013160","journal-title":"Int J Adv Manuf Tech"},{"issue":"4","key":"1212_CR10","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1080\/0305215X.2010.491547","volume":"43","author":"MS Gibbs","year":"2011","unstructured":"Gibbs MS, Maier HR, Dandy GC (2011) Relationship between problem characteristics and the optimal number of genetic algorithm generations. Eng Optim 43(4):349\u2013376","journal-title":"Eng Optim"},{"key":"1212_CR11","volume-title":"Stochastic local search: foundations and applications","author":"HH Hoo","year":"2004","unstructured":"Hoo HH, St\u00fctzle T (2004) Stochastic local search: foundations and applications. Morgan Kaufmann, San Francisco"},{"key":"1212_CR12","unstructured":"Jones T (1995) Evolutionary algorithm, fitness landscapes and search. Dissertation, the University of New Mexico Albuquerque"},{"key":"1212_CR13","first-page":"345","volume":"39","author":"M Kubiak","year":"2007","unstructured":"Kubiak M (2007) Distance measures and fitness-distance analysis for the capacitated vehicle routing problem. Oper Res Comput Sci 39:345\u2013364","journal-title":"Oper Res Comput Sci"},{"issue":"4","key":"1212_CR14","first-page":"615","volume":"21","author":"H Lu","year":"2012","unstructured":"Lu H, Chen X, Liu J (2012) Parallel test task scheduling with constraints based on hybrid particle swarm optimization and tabu search. Chinese J Electron 21(4):615\u2013618","journal-title":"Chinese J Electron"},{"key":"1212_CR15","doi-asserted-by":"crossref","unstructured":"Lu H, Niu RY, Liu J, Zhu Z (2013) A chaotic non-dominated sorting genetic algorithm for the multi-objective automatic test task scheduling problem. Appl Soft Comput 31(5):2790\u20132802","DOI":"10.1016\/j.asoc.2012.10.001"},{"key":"1212_CR16","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/A:1018979424002","volume":"86","author":"DC Mattfeld","year":"1999","unstructured":"Mattfeld DC, Bierwirth C, Kopfer H (1999) A search space analysis of the Job Shop Scheduling Problem. Ann Oper Res 86:441\u2013453","journal-title":"Ann Oper Res"},{"key":"1212_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BFb0056851","volume":"1498","author":"RJ Quick","year":"1998","unstructured":"Quick RJ, Rayward-Smith VJ, Smith GD (1998) Fitness distance correlation and ridge functions. Lect Notes Comput Sci (LNCS) 1498:77\u201386","journal-title":"Lect Notes Comput Sci (LNCS)"},{"key":"1212_CR18","doi-asserted-by":"crossref","unstructured":"Radulescu A, Nicolescu C, van-Gemund AJC, Jonker PP (2001) CPR: mixed task and data parallel scheduling for distributed systems. In: Proceedings of the 15th international parallel and distributed processing symposium, pp 39\u201339","DOI":"10.1109\/IPDPS.2001.924977"},{"issue":"1","key":"1212_CR19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5\u201313","journal-title":"Comput Oper Res"},{"key":"1212_CR20","doi-asserted-by":"crossref","unstructured":"Ross WA (2003) The impact of next generation test technology on aviation maintenance. In: Proceeding of IEEE systems readiness technology conference of autotestcon, pp 2\u20139","DOI":"10.1109\/AUTEST.2003.1243547"},{"issue":"4","key":"1212_CR21","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10852-005-2583-1","volume":"3","author":"T Schiavinotto","year":"2005","unstructured":"Schiavinotto T, St\u00fctzle T (2005) The linear ordering problem: instances, search space analysis and algorithms. J Math Model Algorithms 3(4):367\u2013402","journal-title":"J Math Model Algorithms"},{"issue":"10","key":"1212_CR22","doi-asserted-by":"crossref","first-page":"3134","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T Schiavinotto","year":"2007","unstructured":"Schiavinotto T, St\u00fctzle T (2007) A review of metrics on permutations for search landscape analysis. Comput Oper Res 34(10):3134\u20133153","journal-title":"Comput Oper Res"},{"key":"1212_CR23","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1023\/A:1018948011707","volume":"86","author":"J Schulze","year":"1999","unstructured":"Schulze J, Fahle T (1999) A parallel algorithm for the vehicle routing problem with time window constraints. Ann Oper Res 86:585\u2013607","journal-title":"Ann Oper Res"},{"issue":"6","key":"1212_CR24","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles K, Lopes L (2012) Measuring instance difficulty for combinatorial optimization problems. Comput Oper Res 39(6):875\u2013889","journal-title":"Comput Oper Res"},{"issue":"1","key":"1212_CR25","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10732-006-9001-3","volume":"13","author":"K S\u00f6rensen","year":"2007","unstructured":"S\u00f6rensen K (2007) Distance measures based on the edit distance for permutation-type representations. J Heuristics 13(1):35\u201347","journal-title":"J Heuristics"},{"issue":"8","key":"1212_CR26","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) MAX -MIN Ant System. Future Gener Comp Sy 16(8):889\u2013914","journal-title":"Future Gener Comp Sy"},{"issue":"3","key":"1212_CR27","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TSMCB.2008.915539","volume":"38","author":"J Tavares","year":"2008","unstructured":"Tavares J, Pereira FB, Costa E (2008) Multidimensional Knapsack Problem: a fitness landscape analysis. IEEE Trans Syst Man Cybern Part B Cybern 38(3):604\u2013616","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"1212_CR28","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/978-3-642-14822-4_27","volume":"6083","author":"CW Tsai","year":"2011","unstructured":"Tsai CW, Tseng SP, Chiang MC, Yang CS (2011) A fast parallel genetic algorithm for travelling salesman problem. Lect Notes Comput Sci (LNCS) 6083:241\u2013250","journal-title":"Lect Notes Comput Sci (LNCS)"},{"key":"1212_CR29","unstructured":"Xia R, Xiao MQ, Cheng JJ, Fu XH (2007a) Optimizing the multi-UUT parallel test task scheduling based on multi-objective GASA. In: The 8th international conference on electronic measurement and instruments, pp 839\u2013844"},{"key":"1212_CR30","doi-asserted-by":"crossref","unstructured":"Xia R, Xiao MQ, Cheng JJ (2007b) Parallel TPS design and application based on software architecture, components and patterns. In: IEEE Autotestcon 2007 systems readiness technology conference, pp 234\u2013240","DOI":"10.1109\/AUTEST.2007.4374224"},{"issue":"8","key":"1212_CR31","doi-asserted-by":"crossref","first-page":"5081","DOI":"10.1016\/j.asoc.2011.05.051","volume":"11","author":"B Yu","year":"2011","unstructured":"Yu B, Yang ZZ, Sun XS et al (2011) Parallel genetic algorithm in bus route headway optimization. Appl Soft Comput 11(8):5081\u20135091","journal-title":"Appl Soft Comput"},{"issue":"5\u20136","key":"1212_CR32","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1007\/s00170-004-2223-3","volume":"27","author":"L Zhang","year":"2006","unstructured":"Zhang L, Wang L, Zheng DZ (2006) An adaptive genetic algorithm with multiple operators for flowshop scheduling. Int J Adv Manuf Tech 27(5\u20136):580\u2013587","journal-title":"Int J Adv Manuf Tech"},{"key":"1212_CR33","doi-asserted-by":"crossref","unstructured":"Zhou DX, Qi P, Liu T (2009) An optimizing algorithm for resources allocation in parallel test. In: IEEE international conference on control and automation, pp 1997\u20132002","DOI":"10.1109\/ICCA.2009.5410493"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1212-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-013-1212-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1212-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T09:09:08Z","timestamp":1564996148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-013-1212-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,25]]},"references-count":33,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["1212"],"URL":"https:\/\/doi.org\/10.1007\/s00500-013-1212-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,25]]}}}