{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:12:39Z","timestamp":1649023959819},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T00:00:00Z","timestamp":1267488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Swarm Intell"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s11721-010-0041-9","type":"journal-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T22:58:12Z","timestamp":1267484292000},"page":"145-171","source":"Crossref","is-referenced-by-count":8,"title":["Trail formation in ants. A\u00a0generalized Polya urn process"],"prefix":"10.1007","volume":"4","author":[{"given":"Sameena","family":"Shah","sequence":"first","affiliation":[]},{"given":"Ravi","family":"Kothari","sequence":"additional","affiliation":[]},{"family":"Jayadeva","sequence":"additional","affiliation":[]},{"given":"Suresh","family":"Chandra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,2]]},"reference":[{"issue":"3","key":"41_CR1","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1239\/jap\/1189717535","volume":"44","author":"R. Abraham","year":"2007","unstructured":"Abraham,\u00a0R., Dhersin, J. S., & Ycart,\u00a0B. (2007). Strong convergence for urn models with reducible replacement policy. Journal of Applied Probability, 44(3), 652\u2013660.","journal-title":"Journal of Applied Probability"},{"issue":"1","key":"41_CR2","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1214\/aos\/1015362187","volume":"30","author":"Z. D. Bai","year":"2002","unstructured":"Bai, Z. D., Hu,\u00a0F., & Rosenberger, W. F. (2002). Asymptotic properties of adaptive designs for clinical trials with delayed response. Annals of Statistics, 30(1), 122\u2013139.","journal-title":"Annals of Statistics"},{"key":"41_CR3","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0022-5193(05)80686-1","volume":"159","author":"R. Beckers","year":"1992","unstructured":"Beckers,\u00a0R., Deneubourg, J.-L., & Goss,\u00a0S. (1992). Trails and U-turns in the selection of a path by the ant Lasius niger. Journal of Theoretical Biology, 159, 397\u2013415.","journal-title":"Journal of Theoretical Biology"},{"key":"41_CR4","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0734-189X(87)80014-2","volume":"37","author":"G. Carpenter","year":"1987","unstructured":"Carpenter,\u00a0G., & Grossberg,\u00a0S. (1987). A\u00a0massively parallel architecture for a self-organizing neural pattern recognition machine. Computer Vision, Graphics and Image Processing, 37, 54\u2013115.","journal-title":"Computer Vision, Graphics and Image Processing"},{"issue":"17","key":"41_CR5","doi-asserted-by":"crossref","first-page":"2777","DOI":"10.1080\/03610920802001888","volume":"37","author":"I. Crimaldi","year":"2008","unstructured":"Crimaldi,\u00a0I., & Leisen,\u00a0F. (2008). Asymptotic results for a generalized Polya urn with \u201cmulti-updating\u201d and applications to clinical trials. Communication in Statistics. Theory and Methods, 37(17), 2777\u20132794.","journal-title":"Communication in Statistics. Theory and Methods"},{"key":"41_CR6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01417909","volume":"3","author":"J.-L. Deneubourg","year":"1990","unstructured":"Deneubourg, J.-L., Aron,\u00a0S., Goss,\u00a0S., & Pasteels, J.-M. (1990). The self-organizing exploratory pattern of the Argentine ant. Journal of Insect Behaviour, 3, 159\u2013168.","journal-title":"Journal of Insect Behaviour"},{"key":"41_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/BFb0056909","volume-title":"Proceedings of PPSN V\u2014fifth international conference on parallel problem solving from nature","author":"G. Caro Di","year":"1998","unstructured":"Di Caro,\u00a0G., & Dorigo,\u00a0M. (1998). Ant colonies for adaptive routing in packet-switched communications networks. In A. E. Eiben, M.\u00a0Schoenauer, & T.\u00a0Back (Eds.), LNCS : Vol. 1498. Proceedings of PPSN V\u2014fifth international conference on parallel problem solving from nature (pp. 673\u2013682). Berlin: Springer."},{"issue":"1","key":"41_CR8","first-page":"43","volume":"62","author":"A. G. Dirienzo","year":"2000","unstructured":"Dirienzo, A. G. (2000). Using urn models for the design of clinical trials. Sankhy\u0101: The Indian Journal of Statistics Series B, 62(1), 43\u201369.","journal-title":"Sankhy\u0101: The Indian Journal of Statistics Series B"},{"key":"41_CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/1276958.1276964","volume-title":"GECCO\u201907: Proceedings of the 9th annual conference on genetic and evolutionary computation","author":"B. Doerr","year":"2007","unstructured":"Doerr,\u00a0B., Neumann,\u00a0F., Sudholt,\u00a0D., & Witt,\u00a0C. (2007). On the runtime analysis of the 1-ANT ACO algorithm. In D.\u00a0Thierens et al. (Eds.), GECCO\u201907: Proceedings of the 9th annual conference on genetic and evolutionary computation (pp. 33\u201340). New York: ACM."},{"key":"41_CR10","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M. Dorigo","year":"2005","unstructured":"Dorigo,\u00a0M., & Blum,\u00a0C. (2005). Ant colony optimization theory: a survey. Theoretical Computer Science, 344, 243\u2013278.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"41_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo,\u00a0M., & Gambardella, L. M. (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1), 53\u201366.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"41_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo,\u00a0M., & St\u00fctzle,\u00a0T. (2004). Ant colony optimization. Cambridge: MIT Press."},{"issue":"4","key":"41_CR13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/zamm.19230030407","volume":"3","author":"F. Eggenberger","year":"1923","unstructured":"Eggenberger,\u00a0F., & P\u00f3lya,\u00a0G. (1923). \u00dcber die Statistik verketteter Vorg\u00e4nge. ZAMM\u2014Journal of Applied Mathematics and Mechanics, 3(4), 279\u2013289.","journal-title":"ZAMM\u2014Journal of Applied Mathematics and Mechanics"},{"key":"41_CR14","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1214\/aoms\/1177700068","volume":"36","author":"B. Friedman","year":"1965","unstructured":"Friedman,\u00a0B. (1965). Bernard Friedman\u2019s urn. Annals of Mathematical Statistics, 36, 956\u2013970.","journal-title":"Annals of Mathematical Statistics"},{"key":"41_CR15","unstructured":"Flajolet,\u00a0P., Dumas,\u00a0P., & Puyhaubert,\u00a0V. (2006). Some exactly solvable models of urn process theory. In P.\u00a0Chassaing (Ed.), Discrete mathematics & theoretical computer science: Vol.\u00a0AG. Fourth colloquium on mathematics and computer science algorithms, trees, combinatorics and probabilities (pp.\u00a059\u2013118). DMTCS Proceedings, Nancy, France."},{"issue":"3","key":"41_CR16","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1214\/aop\/1176989134","volume":"21","author":"R. Gouet","year":"1993","unstructured":"Gouet,\u00a0R. (1993). Martingale functional central limit theorems for a generalized Polya urn. Annals of Probability, 21(3), 1624\u20131639.","journal-title":"Annals of Probability"},{"key":"41_CR17","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"W. J. Gutjahr","year":"2000","unstructured":"Gutjahr, W. J. (2000). A\u00a0graph-based ant system and its convergence. Future Generation Computer Systems, 16, 873\u2013888.","journal-title":"Future Generation Computer Systems"},{"key":"41_CR18","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s11009-007-9047-1","volume":"10","author":"W. J. Gutjahr","year":"2008","unstructured":"Gutjahr, W. J., & Sebastiani,\u00a0G. (2008). Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability, 10, 409\u2013433.","journal-title":"Methodology and Computing in Applied Probability"},{"key":"41_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-642-57576-1_14","volume-title":"MODA6: model oriented data analysis","author":"J. Hardwick","year":"2001","unstructured":"Hardwick,\u00a0J., Oehmke,\u00a0R., & Stout, Q. F. (2001). Optimal adaptive designs for delayed response models: exponential case. In A.\u00a0Atkinson, P.\u00a0Hackl, & W.\u00a0M\u00fcller (Eds.), MODA6: model oriented data analysis (pp. 127\u2013134). Heidelberg: Physica Verlag."},{"key":"41_CR20","doi-asserted-by":"crossref","first-page":"1940","DOI":"10.1016\/j.jspi.2005.08.013","volume":"136","author":"J. Hardwick","year":"2006","unstructured":"Hardwick,\u00a0J., Oehmke,\u00a0R., & Stout, Q. F. (2006). New adaptive designs for delayed response models. Journal of Sequential Planning and Inference, 136, 1940\u20131955.","journal-title":"Journal of Sequential Planning and Inference"},{"issue":"3","key":"41_CR21","doi-asserted-by":"crossref","first-page":"447","DOI":"10.3150\/bj\/1089206406","volume":"10","author":"F. Hu","year":"2004","unstructured":"Hu,\u00a0F., & Zhang, L.-X. (2004). Asymptotic normality of urn models for clinical trials with delayed response. Bernoulli, 10(3), 447\u2013463.","journal-title":"Bernoulli"},{"key":"41_CR22","volume-title":"Urn models and their applications","author":"N. Johnson","year":"1977","unstructured":"Johnson,\u00a0N., & Kotz,\u00a0S. (1977). Urn models and their applications. New York: Wiley."},{"key":"41_CR23","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0167-7152(00)00045-6","volume":"49","author":"S. Kotz","year":"2000","unstructured":"Kotz,\u00a0S., Mahmoud, H. M., & Robert,\u00a0P. (2000). On generalized P\u00f3lya urn models. Statistics and Probability Letters, 49, 163\u2013173.","journal-title":"Statistics and Probability Letters"},{"key":"41_CR24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0376-6357(94)90040-X","volume":"31","author":"A. E. Lamb","year":"1994","unstructured":"Lamb, A. E., & Ollason, J. G. (1994). Trail-laying and recruitment to sugary foods by foraging red wood-ants Formica aquilonia Yarrow (Hymenoptera: Formicidae). Behavioural Processes, 31, 111\u2013124.","journal-title":"Behavioural Processes"},{"key":"41_CR25","unstructured":"Leith,\u00a0C. (2005). Ant algorithms and generalized finite urns. Ph.D. thesis, Queen\u2019s University, Kingston, Ontario, Canada."},{"issue":"1","key":"41_CR26","first-page":"53","volume":"2","author":"H. M. Mahmoud","year":"2003","unstructured":"Mahmoud, H. M. (2003). P\u00f3lya urn models and connection to random trees: a\u00a0review. Journal of the Iranian Statistical Society, 2(1), 53\u2013114.","journal-title":"Journal of the Iranian Statistical Society"},{"key":"41_CR27","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.jinsphys.2004.12.001","volume":"51","author":"A.-C. Mailleux","year":"2004","unstructured":"Mailleux, A.-C., Detrain,\u00a0C., & Deneubourg, J.-L. (2004). Triggering and persistence of trail laying in foragers of the ant Lasius niger. Journal of Insect Physiology, 51, 297\u2013304.","journal-title":"Journal of Insect Physiology"},{"issue":"5","key":"41_CR28","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"Maniezzo,\u00a0V., & Colorni,\u00a0A. (1999). The ant system applied to the quadratic assignment problem. IEEE Transactions on Data and Knowledge Engineering, 11(5), 769\u2013778.","journal-title":"IEEE Transactions on Data and Knowledge Engineering"},{"issue":"3","key":"41_CR29","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1162\/106365602760234090","volume":"10","author":"D. Merkle","year":"2002","unstructured":"Merkle,\u00a0D., & Middendorf,\u00a0M. (2002). Modelling the dynamics of ant colony optimization algorithms. Evolutionary Computation, 10(3), 253\u2013262.","journal-title":"Evolutionary Computation"},{"issue":"4","key":"41_CR30","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","volume":"6","author":"D. Merkle","year":"2002","unstructured":"Merkle,\u00a0D., Middendorf,\u00a0M., & Schmeck,\u00a0H. (2002). Ant colony optimization for resource-constrained project scheduling. IEEE Transactions on Evolutionary Computation, 6(4), 333\u2013346.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"41_CR31","series-title":"LNCS","first-page":"618","volume-title":"Proceedings of the 17th international symposium on algorithms and computation, ISAAC 2006","author":"F. Neumann","year":"2006","unstructured":"Neumann,\u00a0F., & Witt,\u00a0C. (2006). Runtime analysis of a simple ant colony optimization algorithm. In T.\u00a0Asano (Ed.), LNCS : Vol. 4288. Proceedings of the 17th international symposium on algorithms and computation, ISAAC 2006 (pp. 618\u2013627). Berlin: Springer."},{"key":"41_CR32","series-title":"LNCS","first-page":"132","volume-title":"Sixth international conference on ant colony optimization and swarm intelligence, ANTS 2008","author":"F. Neumann","year":"2008","unstructured":"Neumann,\u00a0F., Sudholt,\u00a0D., & Witt,\u00a0C. (2008). Rigorous analyses for the combination of ant colony optimization and local search. In M.\u00a0Dorigo, M.\u00a0Birattari, C.\u00a0Blum, M.\u00a0Clerc, T.\u00a0St\u00fctzle, & A. F. T. Winfield (Eds.), LNCS : Vol. 5217. Sixth international conference on ant colony optimization and swarm intelligence, ANTS 2008 (pp. 132\u2013143). Berlin: Springer."},{"issue":"1","key":"41_CR33","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s11721-008-0023-3","volume":"3","author":"F. Neumann","year":"2009","unstructured":"Neumann,\u00a0F., Sudholt,\u00a0D., & Witt,\u00a0C. (2009). Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence, 3(1), 35\u201368.","journal-title":"Swarm Intelligence"},{"key":"41_CR34","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-36605-9_28","volume-title":"Applications of evolutionary computing: EvoWorkshops","author":"M. Reimann","year":"2003","unstructured":"Reimann,\u00a0M., Doerner,\u00a0K., & Hartl, R. F. (2003). Analyzing a unified ant system for the VRP and some of its variants. In G.\u00a0Raidl, S.\u00a0Cagnoni, J. J. R. Cardalda, D. W. Corne, J.\u00a0Gottlieb, A.\u00a0Guillot, E.\u00a0Hart, C. G. Johnson, E.\u00a0Marchiori, J. A. Meyer, & M.\u00a0Middendorf (Eds.), LNCS : Vol. 2611. Applications of evolutionary computing: EvoWorkshops (pp. 300\u2013310). Berlin: Springer."},{"key":"41_CR35","first-page":"170","volume-title":"Proceedings of the twenty-third AAAI conference on artificial intelligence","author":"S. Shah","year":"2008","unstructured":"Shah,\u00a0S., Kothari,\u00a0R., Jayadeva, & Chandra,\u00a0S. (2008). Mathematical modeling and convergence analysis of trail formation. In D.\u00a0Fox, & C. P. Gomes (Eds.), Proceedings of the twenty-third AAAI conference on artificial intelligence (pp. 170\u2013175). Menlo Park: AAAI Press."},{"issue":"4","key":"41_CR36","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TEVC.2002.802444","volume":"6","author":"T. St\u00fctzle","year":"2002","unstructured":"St\u00fctzle,\u00a0T., & Dorigo,\u00a0M. (2002). A\u00a0short convergence proof for a class of ant colony optimization algorithms. IEEE Transactions on Evolutionary Computation, 6(4), 358\u2013365.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"41_CR37","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1214\/105051605000000746","volume":"16","author":"L.-X. Zhang","year":"2006","unstructured":"Zhang, L.-X., Hu,\u00a0F., & Cheung, S. H. (2006). Asymptotic theorems of sequential estimation-adjusted urn models. The Annals of Applied Probability, 16(1), 340\u2013369.","journal-title":"The Annals of Applied Probability"}],"container-title":["Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-010-0041-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11721-010-0041-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-010-0041-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:27:25Z","timestamp":1559575645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11721-010-0041-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,2]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["41"],"URL":"https:\/\/doi.org\/10.1007\/s11721-010-0041-9","relation":{},"ISSN":["1935-3812","1935-3820"],"issn-type":[{"value":"1935-3812","type":"print"},{"value":"1935-3820","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,2]]}}}