{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:40:03Z","timestamp":1746265203324,"version":"3.40.4"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079943"},{"type":"electronic","value":"9783319079950"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07995-0_4","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T23:24:31Z","timestamp":1402442671000},"page":"31-40","source":"Crossref","is-referenced-by-count":1,"title":["A Proposal of Good Practice in the Formulation and Comparison of Meta-heuristics for Solving Routing Problems"],"prefix":"10.1007","author":[{"given":"Eneko","family":"Osaba","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Carballedo","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Diaz","sequence":"additional","affiliation":[]},{"given":"Enrique","family":"Onieva","sequence":"additional","affiliation":[]},{"given":"Asier","family":"Perallos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-32147-4_3","volume":"7422","author":"C. Papadimitriou","year":"2012","unstructured":"Papadimitriou, C.: The new faces of combinatorial optimization. Journal of Combinatorial Optimization\u00a07422(1), 19\u201323 (2012)","journal-title":"Journal of Combinatorial Optimization"},{"doi-asserted-by":"crossref","unstructured":"Korte, B., Vygen, J.: Combinatorial optimization: theory and algorithms, vol.\u00a021. Springer (2012)","key":"4_CR2","DOI":"10.1007\/978-3-642-24488-9"},{"key":"4_CR3","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"E. Lawler","year":"1985","unstructured":"Lawler, E., Lenstra, J., Kan, A., Shmoys, D.: The traveling salesman problem: a guided tour of combinatorial optimization, vol.\u00a03. Wiley, New York (1985)"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research\u00a059(3), 345\u2013358 (1992)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J. Lenstra","year":"1981","unstructured":"Lenstra, J., Kan, A.: Complexity of vehicle routing and scheduling problems. Networks\u00a011(2), 221\u2013227 (1981)","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"Onieva, E., Alonso, J., P\u00e9rez, J., Milan\u00e9s, V., De Pedro, T.: Autonomous car fuzzy control modeled by iterative genetic algorithms. In: IEEE International Conference on Fuzzy Systems, pp. 1615\u20131620 (2009)","key":"4_CR6","DOI":"10.1109\/FUZZY.2009.5277397"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"3174","DOI":"10.1016\/j.eswa.2011.09.004","volume":"39","author":"E.E. Zachariadis","year":"2012","unstructured":"Zachariadis, E.E., Kiranoudis, C.T.: An effective local search approach for the vehicle routing problem with backhauls. Expert Systems with Applications\u00a039(3), 3174\u20133184 (2012)","journal-title":"Expert Systems with Applications"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-28942-2_19","volume-title":"Hybrid Artificial Intelligent Systems","author":"D. Simi\u0107","year":"2012","unstructured":"Simi\u0107, D., Simi\u0107, S.: Hybrid artificial intelligence approaches on vehicle routing problem in logistics distribution. In: Corchado, E., Sn\u00e1\u0161el, V., Abraham, A., Wo\u017aniak, M., Gra\u00f1a, M., Cho, S.-B. (eds.) HAIS 2012, Part III. LNCS, vol.\u00a07208, pp. 208\u2013220. Springer, Heidelberg (2012)"},{"issue":"18","key":"4_CR9","doi-asserted-by":"publisher","first-page":"13148","DOI":"10.1016\/j.eswa.2012.05.087","volume":"39","author":"E. Onieva","year":"2012","unstructured":"Onieva, E., Milan\u00e9s, V., Villagra, J., P\u00e9rez, J., Godoy, J.: Genetic optimization of a vehicle fuzzy decision system for intersections. Expert Systems with Applications\u00a039(18), 13148\u201313157 (2012)","journal-title":"Expert Systems with Applications"},{"issue":"7","key":"4_CR10","doi-asserted-by":"publisher","first-page":"2677","DOI":"10.1016\/j.eswa.2012.11.007","volume":"40","author":"R. Stoean","year":"2013","unstructured":"Stoean, R., Stoean, C.: Modeling medical decision making by support vector machines, explaining by rules of evolutionary algorithms with feature selection. Expert Systems with Applications\u00a040(7), 2677\u20132686 (2013)","journal-title":"Expert Systems with Applications"},{"issue":"9","key":"4_CR11","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J. Gao","year":"2008","unstructured":"Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research\u00a035(9), 2892\u20132907 (2008)","journal-title":"Computers & Operations Research"},{"issue":"8","key":"4_CR12","doi-asserted-by":"publisher","first-page":"3036","DOI":"10.1016\/j.eswa.2012.12.019","volume":"40","author":"C.M. Joo","year":"2013","unstructured":"Joo, C.M., Kim, B.S.: Genetic algorithms for single machine scheduling with time-dependent deterioration and rate-modifying activities. Expert Systems with Applications\u00a040(8), 3036\u20133043 (2013)","journal-title":"Expert Systems with Applications"},{"issue":"4598","key":"4_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gellat, C., Vecchi, M.: Optimization by simmulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search, part i. INFORMS Journal on Computing\u00a01(3), 190\u2013206 (1989)","journal-title":"INFORMS Journal on Computing"},{"unstructured":"Goldberg, D.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Professional (1989)","key":"4_CR15"},{"unstructured":"De Jong, K.: Analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Michigan, USA (1975)","key":"4_CR16"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M. Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theoretical Computer Science\u00a0344(2), 243\u2013278 (2005)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R., et al.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, Australia, vol.\u00a04, pp. 1942\u20131948 (1995)","key":"4_CR18","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1166\/jbic.2012.1002","volume":"1","author":"E. Garcia-Gonzalo","year":"2012","unstructured":"Garcia-Gonzalo, E., Fernandez-Martinez, J.: A brief historical review of particle swarm optimization (pso). Journal of Bioinformatics and Intelligent Control\u00a01(1), 3\u201316 (2012)","journal-title":"Journal of Bioinformatics and Intelligent Control"},{"doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari, E., Lucas, C.: Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE Congress on Evolutionary Computation, pp. 4661\u20134667 (2007)","key":"4_CR20","DOI":"10.1109\/CEC.2007.4425083"},{"doi-asserted-by":"crossref","unstructured":"Osaba, E., Diaz, F., Onieva, E.: Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts. Applied Intelligence, 1\u201322 (2014)","key":"4_CR21","DOI":"10.1007\/s10489-013-0512-y"},{"doi-asserted-by":"crossref","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (abc) algorithm and applications. Artificial Intelligence Review, 1\u201337 (2012)","key":"4_CR22","DOI":"10.1016\/j.ins.2012.05.002"},{"doi-asserted-by":"crossref","unstructured":"Osaba, E., Diaz, F., Onieva, E.: A novel meta-heuristic based on soccer concepts to solve routing problems. In: Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion, pp. 1743\u20131744. ACM (2013)","key":"4_CR23","DOI":"10.1145\/2464576.2480776"},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1166\/jbic.2012.1011","volume":"1","author":"K. Jiang","year":"2012","unstructured":"Jiang, K., Song, B., Shi, X., Song, T.: An overview of membrane computing. Journal of Bioinformatics and Intelligent Control\u00a01(1), 17\u201326 (2012)","journal-title":"Journal of Bioinformatics and Intelligent Control"},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"F. Glover","year":"2001","unstructured":"Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction heuristics for the asymmetric tsp. European Journal of Operational Research\u00a0129(3), 555\u2013568 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P. Larranaga","year":"1999","unstructured":"Larranaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artificial Intelligence Review\u00a013(2), 129\u2013170 (1999)","journal-title":"Artificial Intelligence Review"},{"issue":"1","key":"4_CR27","first-page":"57","volume":"11","author":"N. Mladenovi\u0107","year":"2013","unstructured":"Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Hanafi, S.: Variable neighborhood search for the travelling deliveryman problem. A Quarterly Journal of Operations Research\u00a011(1), 57\u201373 (2013)","journal-title":"A Quarterly Journal of Operations Research"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation Sciences\u00a039(1), 104\u2013118 (2005)","journal-title":"Transportation Sciences"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1137\/1.9780898718515.ch7","volume":"9","author":"J.F. Cordeau","year":"2002","unstructured":"Cordeau, J.F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: Vrp with time windows. The Vehicle Routing Problem\u00a09, 157\u2013193 (2002)","journal-title":"The Vehicle Routing Problem"},{"issue":"4","key":"4_CR30","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1631\/jzus.2006.A0607","volume":"7","author":"A.L. Chen","year":"2006","unstructured":"Chen, A.L., Yang, G.K., Wu, Z.M.: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University Science A\u00a07(4), 607\u2013614 (2006)","journal-title":"Journal of Zhejiang University Science A"},{"issue":"2","key":"4_CR31","doi-asserted-by":"publisher","first-page":"2921","DOI":"10.1016\/j.eswa.2008.01.072","volume":"36","author":"C.H. Wang","year":"2009","unstructured":"Wang, C.H., Lu, J.Z.: A hybrid genetic algorithm that optimizes capacitated vehicle routing problems. Expert Systems with Applications\u00a036(2), 2921\u20132936 (2009)","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"4_CR32","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ejor.2012.09.023","volume":"225","author":"S. Leung","year":"2013","unstructured":"Leung, S., Zhang, Z., Zhang, D., Hua, X., Lim, M.: A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. European Journal of Operational Research\u00a0225(2), 199\u2013210 (2013)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"4_CR33","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. Solomon","year":"1987","unstructured":"Solomon, M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research\u00a035(2), 254\u2013265 (1987)","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Julstrom, B.A.: Very greedy crossover in a genetic algorithm for the traveling salesman problem. In: ACM Symposium on Applied Computing, pp. 324\u2013328 (1995)","key":"4_CR34","DOI":"10.1145\/315891.316009"},{"unstructured":"Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proceedings of the International Joint Conference on Artificial Intelligence, vol.\u00a01, pp. 161\u2013163 (1985)","key":"4_CR35"},{"key":"4_CR36","series-title":"SCI","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-01692-4_9","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO 2013)","author":"E. Osaba","year":"2014","unstructured":"Osaba, E., Onieva, E., Carballedo, R., Diaz, F., Perallos, A.: An adaptive multi-crossover population algorithm for solving routing problems. In: Terrazas, G., Otero, F.E.B., Masegosa, A.D. (eds.) NICSO 2013. SCI, vol.\u00a0512, pp. 123\u2013135. Springer, Heidelberg (2014)"},{"unstructured":"Syswerda, G.: Schedule optimization using genetic algorithms. In: Handbook of Genetic Algorithms, pp. 332\u2013349 (1991)","key":"4_CR37"},{"doi-asserted-by":"crossref","unstructured":"Ray, S., Bandyopadhyay, S., Pal, S.: New operators of genetic algorithms for traveling salesman problem. In: Proceedings of the 17th International Conference on Pattern Recognition, vol.\u00a02, pp. 497\u2013500 (2004)","key":"4_CR38","DOI":"10.1109\/ICPR.2004.1334276"},{"issue":"1","key":"4_CR39","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0360-8352(99)00099-6","volume":"37","author":"E. Burke","year":"1999","unstructured":"Burke, E., Kendall, G.: Comparison of meta-heuristic algorithms for clustering rectangles. Computers & Industrial Engineering\u00a037(1), 383\u2013386 (1999)","journal-title":"Computers & Industrial Engineering"},{"issue":"6","key":"4_CR40","first-page":"96","volume":"3","author":"Z.H. Ahmed","year":"2010","unstructured":"Ahmed, Z.H.: Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. International Journal of Biometrics and Bioinformatics\u00a03(6), 96 (2010)","journal-title":"International Journal of Biometrics and Bioinformatics"},{"issue":"3","key":"4_CR41","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M. Albayrak","year":"2011","unstructured":"Albayrak, M., Allahverdi, N.: Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Systems with Applications\u00a038(3), 1313\u20131320 (2011)","journal-title":"Expert Systems with Applications"},{"doi-asserted-by":"crossref","unstructured":"Osaba, E., Carballedo, R.: A methodological proposal to eliminate ambiguities in the comparison of vehicle routing problem solving techniques. In: Proceedings of the 4th International Joint Conference on Computational Intelligence, pp. 310\u2013313 (2012)","key":"4_CR42","DOI":"10.5220\/0004171503100313"},{"issue":"4","key":"4_CR43","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: Tsplib, a traveling salesman problem library. INFORMS Journal on Computing\u00a03(4), 376\u2013384 (1991)","journal-title":"INFORMS Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Wang, L., Zhang, J., Li, H.: An improved genetic algorithm for tsp. In: International Conference on Machine Learning and Cybernetics, vol.\u00a02, pp. 925\u2013928 (2007)","key":"4_CR44","DOI":"10.1109\/ICMLC.2007.4370274"},{"issue":"1","key":"4_CR45","first-page":"607","volume":"1","author":"R. Thamilselvan","year":"2009","unstructured":"Thamilselvan, R., Balasubramanie, P.: A genetic algorithm with a tabu search (gta) for traveling salesman problem. International Journal of Recent Trends in Engineering\u00a01(1), 607\u2013610 (2009)","journal-title":"International Journal of Recent Trends in Engineering"},{"issue":"2","key":"4_CR46","first-page":"264","volume":"9","author":"X. Yan","year":"2012","unstructured":"Yan, X., Zhang, C., Luo, W., Li, W., Chen, W., Liu, H.: Solve traveling salesman problem using particle swarm optimization algorithm. International Journal of Computer Science Issues\u00a09(2), 264\u2013271 (2012)","journal-title":"International Journal of Computer Science Issues"},{"key":"4_CR47","first-page":"471","volume":"52","author":"O.M. Sallabi","year":"2009","unstructured":"Sallabi, O.M., El-Haddad, Y.: An improved genetic algorithm to solve the traveling salesman problem. World Academy of Science, Engineering and Technology\u00a052, 471\u2013474 (2009)","journal-title":"World Academy of Science, Engineering and Technology"},{"issue":"10","key":"4_CR48","first-page":"540","volume":"5","author":"K. Nemati","year":"2011","unstructured":"Nemati, K., Shamsuddin, S., Kamarposhti, M.: Using imperial competitive algorithm for solving traveling salesman problem and comparing the efficiency of the proposed algorithm with methods in use. Australian Journal of Basic and Applied Sciences\u00a05(10), 540\u2013543 (2011)","journal-title":"Australian Journal of Basic and Applied Sciences"},{"issue":"2","key":"4_CR49","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0305-0548(97)00030-0","volume":"25","author":"S. Tsubakitani","year":"1998","unstructured":"Tsubakitani, S., Evans, J.R.: Optimizing tabu list size for the traveling salesman problem. Computers & Operations Research\u00a025(2), 91\u201397 (1998)","journal-title":"Computers & Operations Research"},{"key":"4_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/11590316_98","volume-title":"Pattern Recognition and Machine Intelligence","author":"S.S. Ray","year":"2005","unstructured":"Ray, S.S., Bandyopadhyay, S., Pal, S.K.: New genetic operators for solving TSP: Application to microarray gene ordering. In: Pal, S.K., Bandyopadhyay, S., Biswas, S. (eds.) PReMI 2005. LNCS, vol.\u00a03776, pp. 617\u2013622. Springer, Heidelberg (2005)"},{"issue":"11","key":"4_CR51","doi-asserted-by":"publisher","first-page":"4609","DOI":"10.1016\/j.eswa.2013.01.063","volume":"40","author":"M. Nikoli\u0107","year":"2013","unstructured":"Nikoli\u0107, M., Teodorovi\u0107, D.: Empirical study of the bee colony optimization (bco) algorithm. Expert Systems with Applications\u00a040(11), 4609\u20134620 (2013)","journal-title":"Expert Systems with Applications"},{"issue":"11","key":"4_CR52","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1631\/jzus.C1300184","volume":"14","author":"E. Osaba","year":"2013","unstructured":"Osaba, E., Onieva, E., Carballedo, R., Diaz, F., Perallos, A., Zhang, X.: A multi-crossover and adaptive island based population algorithm for solving routing problems. Journal of Zhejiang University Science C\u00a014(11), 815\u2013821 (2013)","journal-title":"Journal of Zhejiang University Science C"},{"doi-asserted-by":"crossref","unstructured":"Pullan, W.: Adapting the genetic algorithm to the travelling salesman problem. In: IEEE Congress on Evolutionary Computation, vol.\u00a02, pp. 1029\u20131035 (2003)","key":"4_CR53","DOI":"10.1109\/CEC.2003.1299781"},{"doi-asserted-by":"crossref","unstructured":"Osaba, E., Onieva, E., Diaz, F., Carballedo, R., Perallos, A.: Comments on \u201dAlbayrak, M., & Allahverdy N. Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Systems with Applications\u00a038(3), 1313\u20131320 (2011), A proposal of good practice. Expert Systems with Applications 41(4), 1530\u20131531 (2014)","key":"4_CR54","DOI":"10.1016\/j.eswa.2013.08.049"},{"doi-asserted-by":"crossref","unstructured":"Osaba, E., Carballedo, R., Diaz, F., Perallos, A.: Discussion related to \u201dWang, C.-H., & Lu, J.-Z. A hybrid genetic algorithm that optimizes capacitated vehicle routing problem. Expert Systems with Applications\u00a036(2), 2921\u20132936 (2009), Expert Systems with Applications 40(14), 5425\u20135426 (2013)","key":"4_CR55","DOI":"10.1016\/j.eswa.2013.04.008"},{"issue":"1","key":"4_CR56","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.neucom.2011.01.027","volume":"75","author":"E. Corchado","year":"2012","unstructured":"Corchado, E., Baruque, B.: Wevos-visom: An ensemble summarization algorithm for enhanced data visualization. Neurocomputing\u00a075(1), 171\u2013184 (2012)","journal-title":"Neurocomputing"},{"key":"4_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.neucom.2013.07.001","volume":"126","author":"E. Corchado","year":"2014","unstructured":"Corchado, E., Wozniak, M., Abraham, A., de Carvalho, A.C.P.L.F., Sn\u00e1sel, V.: Recent trends in intelligent data analysis. Neurocomputing\u00a0126, 1\u20132 (2014)","journal-title":"Neurocomputing"}],"container-title":["Advances in Intelligent Systems and Computing","International Joint Conference SOCO\u201914-CISIS\u201914-ICEUTE\u201914"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07995-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:15:50Z","timestamp":1746263750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07995-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079943","9783319079950"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07995-0_4","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}