{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:12:35Z","timestamp":1725991955629},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002640"},{"type":"electronic","value":"9783030002657"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00265-7_9","type":"book-chapter","created":{"date-parts":[[2018,9,14]],"date-time":"2018-09-14T13:14:01Z","timestamp":1536930841000},"page":"99-113","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ACORD: Ant Colony Optimization and BNF Grammar Rule Derivation"],"prefix":"10.1007","author":[{"given":"Luis Fernando","family":"de Mingo L\u00f3pez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nuria G\u00f3mez","family":"Blas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Castellanos","family":"Pe\u00f1uela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto Arteta","family":"Albert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,15]]},"reference":[{"issue":"7","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.1166\/jctn.2009.1230","volume":"6","author":"Z Wang","year":"2009","unstructured":"Wang, Z., Geng, X., Shao, Z.: An effective simulated annealing algorithm for solving the traveling salesman problem. J. Comput. Theor. Nanosci. 6(7), 1680\u20131686 (2009)","journal-title":"J. Comput. Theor. Nanosci."},{"issue":"6","key":"9_CR2","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ipl.2007.06.016","volume":"104","author":"K Meer","year":"2007","unstructured":"Meer, K.: Simulated annealing versus metropolis for a TSP instance. Inf. Process. Lett. 104(6), 216\u2013219 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"2\u20133","key":"9_CR3","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0377-2217(97)00289-0","volume":"106","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., Semet, F.: A tabu search heuristic for the undirected selective travelling salesman problem. Eur. J. Oper. Res. 106(2\u20133), 539\u2013545 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"F Liu","year":"2009","unstructured":"Liu, F., Zeng, G.: Study of genetic algorithm with reinforcement learning to solve the TSP. Expert. Syst. Appl. 36(3), 6995\u20137001 (2009)","journal-title":"Expert. Syst. Appl."},{"issue":"5","key":"9_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf. Process. Lett. 103(5), 169\u2013176 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","volume":"211","author":"C Rego","year":"2011","unstructured":"Rego, C., Gamboa, D., Glover, F., Osterman, C.: Traveling salesman problem heuristics: leading methods, implementations and latest advances. Eur. J. Oper. Res. 211(3), 427\u2013441 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR7","unstructured":"Kollin, F., Bavey, A.: Ant colony optimization Algorithms: pheromone techniques for TSP. Technical report, KTH, School of Computer Science and Communication (CSC) (2017)"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.asoc.2006.10.012","volume":"8","author":"ZJ Lee","year":"2008","unstructured":"Lee, Z.J., Su, S.F., Chuang, C.C., Liu, K.H.: Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment. Appl. Soft Comput. 8(1), 55\u201378 (2008)","journal-title":"Appl. Soft Comput."},{"issue":"PB","key":"9_CR9","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cor.2013.09.014","volume":"52","author":"G Moslehi","year":"2014","unstructured":"Moslehi, G., Khorasanian, D.: A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion. Comput. Oper. Res. 52(PB), 260\u2013268 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"9_CR10","doi-asserted-by":"publisher","first-page":"11072","DOI":"10.1016\/j.eswa.2011.02.151","volume":"38","author":"J Xiao","year":"2011","unstructured":"Xiao, J., Li, L.: A hybrid ant colony optimization for continuous domains. Expert Syst. Appl. 38(9), 11072\u201311077 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"C","key":"9_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.cie.2015.04.010","volume":"85","author":"W Xiang","year":"2015","unstructured":"Xiang, W., Yin, J., Lim, G.: An ant colony optimization approach for solving an operating room surgery scheduling problem. Comput. Ind. Eng. 85(C), 335\u2013345 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-87527-7_12","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"F Neumann","year":"2008","unstructured":"Neumann, F., Sudholt, D., Witt, C.: Rigorous analyses for the combination of ant\u00a0colony\u00a0optimization and local search. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., St\u00fctzle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 132\u2013143. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87527-7_12"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.3969\/j.issn.1004-4132.2010.02.025","volume":"21","author":"R Gan","year":"2010","unstructured":"Gan, R., Guo, Q., Chang, H., Yi, Y.: Improved ant colony optimization algorithm for the traveling salesman problems. J. Syst. Eng. Electron. 21(2), 329\u2013333 (2010)","journal-title":"J. Syst. Eng. Electron."},{"issue":"1","key":"9_CR14","first-page":"83","volume":"9","author":"R Jovanovic","year":"2010","unstructured":"Jovanovic, R., Tuba, M., Simian, D.: Comparison of different topologies for island-based multi-colony ant algorithms for the minimum weight vertex cover problem. WSEAS Trans. Comput. 9(1), 83\u201392 (2010)","journal-title":"WSEAS Trans. Comput."},{"key":"9_CR15","unstructured":"Stutzle, T., Dorigo, M.: ACO algorithms for the traveling salesman problem. In: Evolutionary Algorithms in Engineering and Computer Science: Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming and Industrial Applications. Wiley, Hoboken (1999)"},{"issue":"9","key":"9_CR16","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: MAX-MIN ant system. Futur. Gener. Comput. Syst. 16(9), 889\u2013914 (2000)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.asoc.2008.11.011","volume":"9","author":"KY Wong","year":"2009","unstructured":"Wong, K.Y., See, P.C.: A new minimum pheromone threshold strategy (MPTS) for max-min ant system. Appl. Soft Comput. 9(3), 882\u2013888 (2009)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"9_CR18","first-page":"228","volume":"6","author":"CM Pintea","year":"2012","unstructured":"Pintea, C.M., Chira, C., Dumitrescu, D., Pop, P.C.: Sensitive ants in solving the generalized vehicle routing problem. J. Comput., Commun. Control. 6(4), 228\u2013231 (2012)","journal-title":"J. Comput., Commun. Control."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BFb0055930","volume-title":"Genetic Programming","author":"C Ryan","year":"1998","unstructured":"Ryan, C., Collins, J.J., Neill, M.O.: Grammatical evolution: evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83\u201396. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055930"},{"key":"9_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0447-4","volume-title":"Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language","author":"M O\u2019Neill","year":"2003","unstructured":"O\u2019Neill, M., Ryan, C.: Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language. Kluwer Academic Publishers, Norwell (2003)"},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10710-017-9309-9","volume":"18","author":"M Nicolau","year":"2017","unstructured":"Nicolau, M.: Understanding grammatical evolution: initialisation. Genet. Program. Evolvable Mach. 18(4), 467\u2013507 (2017)","journal-title":"Genet. Program. Evolvable Mach."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-24854-5_15","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"M O\u2019Neill","year":"2004","unstructured":"O\u2019Neill, M., Brabazon, A.: Grammatical swarm. In: Deb, K. (ed.) GECCO 2004. LNCS, vol. 3102, pp. 163\u2013174. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24854-5_15"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s11047-006-9007-7","volume":"5","author":"M O\u2019Neill","year":"2006","unstructured":"O\u2019Neill, M., Brabazon, A.: Grammatical swarm: the generation of programs by social programming. Nat. Comput. 5(4), 443\u2013462 (2006)","journal-title":"Nat. Comput."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Grimme, C., Schmitt, K.: Inside a predator-prey model for multi-objective optimization: a second study. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation. GECCO 2006, pp. 707\u2013714. ACM, New York (2006)","DOI":"10.1145\/1143997.1144121"},{"issue":"3","key":"9_CR25","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/cplx.21507","volume":"20","author":"M Alfonseca","year":"2015","unstructured":"Alfonseca, M., Soler Gil, F.J.: Evolving a predator-prey ecosystem of mathematical expressions with grammatical evolution. Complexity 20(3), 66\u201383 (2015)","journal-title":"Complexity"},{"key":"9_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00314-1","volume-title":"Foundations in Grammatical Evolution for Dynamic Environments","author":"I Dempsey","year":"2009","unstructured":"Dempsey, I., O\u2019Neill, M., Brabazon, A.: Foundations in Grammatical Evolution for Dynamic Environments, 1st edn. Springer Publishing Company, Incorporated, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00314-1","edition":"1"},{"key":"9_CR27","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm Intelligence: From Natural to Artificial Systems","author":"E Bonabeau","year":"1999","unstructured":"Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, Oxford (1999)"},{"issue":"1","key":"9_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"9_CR29","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. Bradford Company, Scituate (2004)"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02223791","volume":"6","author":"PP Grass\u00e9","year":"1959","unstructured":"Grass\u00e9, P.P.: La reconstruction du nid et les coordinations interindividuelles chez Bellicositermes natalensis et Cubitermes sp. La th\u00e9orie de la stigmergie: essai d\u2019interpr\u00e9tation du comportement des termites constructeurs. Insectes Sociaux 6, 41\u201383 (1959)","journal-title":"Insectes Sociaux"},{"issue":"12","key":"9_CR31","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF00462870","volume":"76","author":"S Goss","year":"1989","unstructured":"Goss, S., Aron, S., Deneubourg, J., Pasteels, J.: Self-organized shortcuts in the Argentine ant. Naturwissenschaften 76(12), 579\u2013581 (1989)","journal-title":"Naturwissenschaften"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Oplatkov\u00e1, Z., Zelinka, I.: Investigation on artificial ant using analytic programming. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation. GECCO 2006, pp. 949\u2013950. ACM, New York (2006)","DOI":"10.1145\/1143997.1144164"},{"key":"9_CR33","unstructured":"Georgiou, L., Teahan, W.J.: Constituent grammatical evolution. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence - Volume. IJCAI 2011, vol. 2, pp. 1261\u20131268. AAAI Press (2011)"},{"issue":"5","key":"9_CR34","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TEVC.2002.805038","volume":"6","author":"I Kushchu","year":"2002","unstructured":"Kushchu, I.: Genetic programming and evolutionary generalization. Trans. Evol. Comput. 6(5), 431\u2013442 (2002)","journal-title":"Trans. Evol. Comput."},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Poli, R., Vanneschi, L.: Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation. GECCO 2007, pp. 1335\u20131342. ACM, New York (2007)","DOI":"10.1145\/1276958.1277209"},{"issue":"4","key":"9_CR36","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/4235.942529","volume":"5","author":"M O\u2019Neill","year":"2001","unstructured":"O\u2019Neill, M., Ryan, C.: Grammatical evolution. IEEE Trans. Evol. Comput. 5(4), 349\u2013358 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"9_CR37","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF00175355","volume":"4","author":"JR Koza","year":"1994","unstructured":"Koza, J.R.: Genetic programming as a means for programming computers by natural selection. Stat. Comput. 4(2), 87\u2013112 (1994)","journal-title":"Stat. Comput."},{"key":"9_CR38","unstructured":"Georgiou, L., Teahan, W.J.: Grammatical evolution and the santa fe trail problem. In: Filipe, J., Kacprzyk, J. (eds.) ICEC 2010 - Proceedings of the International Conference on Evolutionary Computation, (part of the International Joint Conference on Computational Intelligence IJCCI 2010), Valencia, Spain, 24\u201326 October 2010, pp. 10\u201319. SciTePress (2010)"},{"issue":"8","key":"9_CR39","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"WJ Gutjahr","year":"2000","unstructured":"Gutjahr, W.J.: A graph-based ant system and its convergence. Futur. Gener. Comput. Syst. 16(8), 873\u2013888 (2000)","journal-title":"Futur. Gener. Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Enjoying Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00265-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T11:33:20Z","timestamp":1662032000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00265-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002640","9783030002657"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00265-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}