{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:04:08Z","timestamp":1761807848515},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11704-013-2302-4","type":"journal-article","created":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T04:37:54Z","timestamp":1380602274000},"page":"729-744","source":"Crossref","is-referenced-by-count":6,"title":["An ACO-RFD hybrid method to solve NP-complete problems"],"prefix":"10.1007","volume":"7","author":[{"given":"Pablo","family":"Rabanal","sequence":"first","affiliation":[]},{"given":"Ismael","family":"Rodr\u00edguez","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Rubio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,2]]},"reference":[{"key":"2302_CR1","volume-title":"NATO Advanced Workshop on Robotics and Biological Systems","author":"G Beni","year":"1989","unstructured":"Beni G, Wang J. Swarm intelligence in cellular robotic systems. In: NATO Advanced Workshop on Robotics and Biological Systems. 1989"},{"key":"2302_CR2","volume-title":"Swarm intelligence. TheMorgan Kaufmann series in evolutionary computation","author":"J Kennedy","year":"2001","unstructured":"Kennedy J, Eberhart R. Swarm intelligence. TheMorgan Kaufmann series in evolutionary computation. Morgan Kaufmann Publishers, 2001"},{"key":"2302_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to evolutionary computing","author":"A Eiben","year":"2003","unstructured":"Eiben A, Smith J. Introduction to evolutionary computing. Springer, 2003"},{"key":"2302_CR4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/0-387-27705-6_6","volume-title":"Handbook of nature-inspired and innovative computing","author":"J Kennedy","year":"2006","unstructured":"Kennedy J. Swarm intelligence. In: Zomaya A, ed. Handbook of nature-inspired and innovative computing, 187\u2013219. Springer US, 2006"},{"key":"2302_CR5","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1145\/1388969.1389054","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2008","author":"D K Jong","year":"2008","unstructured":"Jong D K. Evolutionary computation: a unified approach. In: Genetic and Evolutionary Computation Conference, GECCO 2008. 2008, 2245\u20132258"},{"key":"2302_CR6","volume-title":"Nature-inspired algorithms for optimisation, Volume 193 of Studies in Computational Intelligence","year":"2009","unstructured":"Chiong R, ed. Nature-inspired algorithms for optimisation, Volume 193 of Studies in Computational Intelligence. Springer, 2009"},{"key":"2302_CR7","volume-title":"Essentials of metaheuristics","author":"S Luke","year":"2010","unstructured":"Luke S. Essentials of metaheuristics. Lulu, 2010"},{"issue":"1","key":"2302_CR8","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. Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics, Part B, 1996, 26(1): 29\u201341","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part B"},{"issue":"2","key":"2302_CR9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella L. Ant colonies for the traveling salesman problem. BioSystems, 1997, 43(2): 73\u201381","journal-title":"BioSystems"},{"key":"2302_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, St\u00fctzle T. Ant colony optimization. Bradford Company, 2004"},{"key":"2302_CR11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/CI-M.2006.248054","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, St\u00fctzle T. Ant colony optimization-artificial ants as a computational intelligence technique. IEEE Computational Intelligence Magazine, 2006, 1: 28\u201339","journal-title":"IEEE Computational Intelligence Magazine"},{"issue":"4","key":"2302_CR12","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M Reimann","year":"2004","unstructured":"Reimann M, Doerner K, Hartl R F. D-ants: savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research, 2004, 31(4): 563\u2013591","journal-title":"Computers & Operations Research"},{"issue":"4","key":"2302_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","volume":"6","author":"D Merkle","year":"2002","unstructured":"Merkle D, Middendorf M, Schmeck H. Ant colony optimization for resource-constrained project scheduling. IEEE Transactions on Evolutionary Computation, 2002, 6(4): 333\u2013346","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"6","key":"2302_CR14","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum C. Beam-ACO-hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers & Operations Research, 2005, 32(6): 1565\u20131591","journal-title":"Computers & Operations Research"},{"key":"2302_CR15","doi-asserted-by":"crossref","unstructured":"Lessing L, Dumitrescu I, St\u00fctzle T. A comparison between ACO algorithms for the set covering problem. In: Proceedings of the 4th International workshop on Ant Colony Optimization and Swarm Intelligence (ANTS 2004), LNCS, Volume 3172, 1\u201312","DOI":"10.1007\/978-3-540-28646-2_1"},{"key":"2302_CR16","doi-asserted-by":"crossref","unstructured":"Fenet S, Solnon C. Searching for maximum cliques with ant colony optimization. In: Proceedings of Evo Workshops 2003, LNCS, Volume 2611, 236\u2013245","DOI":"10.1007\/3-540-36605-9_22"},{"issue":"4","key":"2302_CR17","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo V. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing, 1999, 11(4): 358\u2013369","journal-title":"INFORMS Journal on Computing"},{"key":"2302_CR18","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-540-73554-0_16","volume-title":"Unconventional Computation, UC\u201907","author":"P Rabanal","year":"2007","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F. Using river formation dynamics to design heuristic algorithms. In: Unconventional Computation, UC\u201907, LNCS 4618. 2007, 163\u2013177"},{"key":"2302_CR19","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-540-87527-7_6","volume-title":"Ant Colony Optimization and Swarm Intelligence, ANTS\u201908","author":"P Rabanal","year":"2008","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F. Finding minimum spanning\/distances trees by using river formation dynamics. In: Ant Colony Optimization and Swarm Intelligence, ANTS\u201908, LNCS 5217. 2008, 60\u201371"},{"issue":"1","key":"2302_CR20","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s12065-011-0049-0","volume":"4","author":"P Rabanal","year":"2011","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F. Studying the application of ant colony optimization and river formation dynamics to the steiner tree problem. Evolutionary Intelligence, 2011, 4(1): 51\u201365","journal-title":"Evolutionary Intelligence"},{"key":"2302_CR21","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-642-00267-0_12","volume-title":"Nature-inspired algorithms for optimisation","author":"P Rabanal","year":"2009","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F. Applying river formation dynamics to solve NP-complete problems. In: Chiong R, ed. Nature-inspired algorithms for optimisation, Volume 193 of Studies in Computational Intelligence, 333\u2013368. Springer, 2009"},{"key":"2302_CR22","volume-title":"Testing restorable systems: formal definition and heuristic solution based on river formation dynamics","author":"P Rabanal","year":"2012","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F. Testing restorable systems: formal definition and heuristic solution based on river formation dynamics. Formal Aspects of Computing, 2012, In press"},{"key":"2302_CR23","first-page":"424","volume-title":"Proceedings of the 10th European Conference on Advances in Artificial Life","author":"P Rabanal","year":"2009","unstructured":"Rabanal P, Rodr\u00edguez I. Hybridizing river formation dynamics and ant colony optimization. In: Proceedings of the 10th European Conference on Advances in Artificial Life. 2009, 424\u2013431"},{"key":"2302_CR24","volume-title":"The traveling salesman problem","author":"G Tech","year":"2012","unstructured":"Tech G. The traveling salesman problem, 2012. Available at http:\/\/www.tsp.gatech.edu"},{"key":"2302_CR25","volume-title":"The traveling salesman problem","author":"K Hoffman","year":"2011","unstructured":"Hoffman K. The traveling salesman problem, 2011. Available at http:\/\/iris.gmu.edu\/?khoffman\/papers\/trav_salesman.html"},{"issue":"1","key":"2302_CR26","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0377-2217(94)90332-8","volume":"72","author":"C Hanen","year":"1994","unstructured":"Hanen C. Study of a np-hard cyclic scheduling problem: the recurrent job-shop. European Journal of Operational Research, 1994, 72(1): 82\u2013101","journal-title":"European Journal of Operational Research"},{"key":"2302_CR27","volume-title":"Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies","author":"S Meguerdichian","year":"2001","unstructured":"Meguerdichian S, Koushanfar F, Potkonjak M, Srivastava M. Coverage problems in wireless ad-hoc sensor networks. In: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies. 2001"},{"key":"2302_CR28","first-page":"155","volume":"173","author":"Z J Lee","year":"2005","unstructured":"Lee Z J, Lee C Y. A hybrid search algorithm with heuristics for resource allocation problem. Information Science-Informatics and Computer Science, 2005, 173: 155\u2013167","journal-title":"Information Science-Informatics and Computer Science"},{"key":"2302_CR29","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010749","volume-title":"Handbook of approximation algorithms and metaheuristics","author":"T Gonzalez","year":"2007","unstructured":"Gonzalez T. Handbook of approximation algorithms and metaheuristics. Chapman & Hall\/CRC, 2007"},{"key":"2302_CR30","volume-title":"The traveling salesman problem: a guide tour of combinatorial optimization","author":"E L Lawler","year":"1986","unstructured":"Lawler E L, Lenstram J K, Rinnooy A H G, Shmoys D B. The traveling salesman problem: a guide tour of combinatorial optimization. John Wiley and Sons, 1986"},{"key":"2302_CR31","volume-title":"The traveling salesman (computational solutions for TSP applications)","author":"G Reinelt","year":"1994","unstructured":"Reinelt G. The traveling salesman (computational solutions for TSP applications). Springer, 1994"},{"issue":"2","key":"2302_CR32","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/nav.3800330209","volume":"33","author":"B Golden","year":"1986","unstructured":"Golden B, Skiscim C. Using simulated annealing to solve routing and location problems. Naval Research Logistics Quarterly, 1986, 33(2): 261\u2013279","journal-title":"Naval Research Logistics Quarterly"},{"key":"2302_CR33","volume-title":"Combining simulated annealing with local search heuristics","author":"O Martin","year":"1993","unstructured":"Martin O, Otto S. Combining simulated annealing with local search heuristics. Technical Report, 1993"},{"key":"2302_CR34","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BFb0029743","volume-title":"Proceedings of the 1st Workshop on Parallel Problem Solving from Nature, PPSN I","author":"H Braun","year":"1991","unstructured":"Braun H. On solving travelling salesman problems by genetic algorithms. In: Proceedings of the 1st Workshop on Parallel Problem Solving from Nature, PPSN I. 1991, 129\u2013133"},{"key":"2302_CR35","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga P, Kuijpers C, Inza R M I, Dizdarevic S. Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artificial Intelligence Review, 1999, 13: 129\u2013170","journal-title":"Artificial Intelligence Review"},{"issue":"1","key":"2302_CR36","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.ejor.2006.03.041","volume":"180","author":"C Garc\u00eda-Mart\u00ednez","year":"2007","unstructured":"Garc\u00eda-Mart\u00ednez C, Cord\u00f3n O, Herrera F. A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. European Journal of Operational Research, 2007, 180(1): 116\u2013148","journal-title":"European Journal of Operational Research"},{"key":"2302_CR37","first-page":"44","volume-title":"ACM SIGCOMM Computer Communication Review","author":"R Perlman","year":"1985","unstructured":"Perlman R. An algorithm for distributed computation of a spanningtree in an extended lan. In: ACM SIGCOMM Computer Communication Review. 1985, 44\u201353"},{"key":"2302_CR38","volume-title":"Computer networks: a systems approach","author":"L Peterson","year":"2007","unstructured":"Peterson L, Davie B. Computer networks: a systems approach. 3rd ed. Morgan Kaufmann, 2007","edition":"3rd ed."},{"key":"2302_CR39","volume-title":"Int.Work Conference on Artificial Neural Networks, IWANN\u201909","author":"P Rabanal","year":"2009","unstructured":"Rabanal P, Rodr\u00edguez I. Testing restorable systems by using RFD. In: Int.Work Conference on Artificial Neural Networks, IWANN\u201909. 2009"},{"issue":"14","key":"2302_CR40","first-page":"1882","volume":"16","author":"P Rabanal","year":"2010","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F. Applying RFD to construct optimal quality-investment trees. J. UCS, 2010, 16(14): 1882\u20131901","journal-title":"J. UCS"},{"issue":"5","key":"2302_CR41","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1109\/TEVC.2009.2016570","volume":"13","author":"Y Zhou","year":"2009","unstructured":"Zhou Y. Runtime analysis of an ant colony optimization algorithm for TSP instances. IEEE Transactions on Evolutionary Computation, 2009, 13(5): 1083\u20131092","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2302_CR42","volume-title":"TSPLIB 95","author":"G Reinelt","year":"1995","unstructured":"Reinelt G. TSPLIB 95. Technical Report, Research Report, Institut f\u00fcr Angewandte Mathematik, Universit\u00e4t Heidelberg, Heidelberg, Germany, 1995. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"},{"key":"2302_CR43","unstructured":"Parejo-Maestre J, Garc\u00eda-Guti\u00e9rrez J, Ruiz-Cort\u00e9s A, Riquelme-Santos J. STATService. http:\/\/moses.us.es\/statservice\/"},{"issue":"1","key":"2302_CR44","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation, 2011, 1(1): 3\u201318","journal-title":"Swarm and Evolutionary Computation"},{"key":"2302_CR45","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M. The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association, 1937, 32: 674\u2013701","journal-title":"Journal of the American Statistical Association"},{"key":"2302_CR46","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman M. A comparison of alternative tests of significance for the problem of m rankings. Annals of Mathematical Statistics, 1940, 11: 86\u201392","journal-title":"Annals of Mathematical Statistics"},{"key":"2302_CR47","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1214\/aoms\/1177704575","volume":"33","author":"J Hodges","year":"1962","unstructured":"Hodges J, Lehmann E. Ranks methods for combination of independent experiments in analysis of variance. Annals of Mathematical Statistics, 1962, 33: 482\u2013497","journal-title":"Annals of Mathematical Statistics"},{"key":"2302_CR48","first-page":"65","volume":"6","author":"S Holm","year":"1979","unstructured":"Holm S. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 1979, 6: 65\u201370","journal-title":"Scandinavian Journal of Statistics"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-013-2302-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-013-2302-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-013-2302-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,27]],"date-time":"2019-07-27T13:45:04Z","timestamp":1564235104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-013-2302-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":48,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["2302"],"URL":"https:\/\/doi.org\/10.1007\/s11704-013-2302-4","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10]]}}}