{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T16:10:09Z","timestamp":1736525409097,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540384823"},{"type":"electronic","value":"9783540384830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11839088_42","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T14:22:12Z","timestamp":1156515732000},"page":"428-435","source":"Crossref","is-referenced-by-count":1,"title":["Higher Order Pheromone Models in Ant Colony Optimisation"],"prefix":"10.1007","author":[{"given":"James","family":"Montgomery","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/3-540-45712-7_63","volume-title":"Parallel Problem Solving from Nature - PPSN VII","author":"M. Zlochin","year":"2002","unstructured":"Zlochin, M., Dorigo, M.: Model-based search for combinatorial optimization: A comparative study. In: Guerv\u00f3s, J.J.M., Adamidis, P.A., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol.\u00a02439, pp. 651\u2013662. Springer, Heidelberg (2002)"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1162\/1064546054407149","volume":"11","author":"J. Montgomery","year":"2005","unstructured":"Montgomery, J., Randall, M., Hendtlass, T.: Automated selection of appropriate pheromone representations in ant colony optimisation. Artificial Life\u00a011, 269\u2013291 (2005)","journal-title":"Artificial Life"},{"key":"42_CR3","series-title":"Dissertations in Artificial Intelligence","volume-title":"Theoretical and practical aspects of ant colony optimization","author":"C. Blum","year":"2004","unstructured":"Blum, C.: Theoretical and practical aspects of ant colony optimization. Dissertations in Artificial Intelligence, vol.\u00a0282. IOS Press, Nieuwe Hemweg (2004)"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Blum, C., Sampels, M.: Ant colony optimization for FOP shop scheduling: A case study on different pheromone representations. In: 2002 Congress on Evolutionary Computation, pp. 1558\u20131563 (2002)","DOI":"10.1109\/CEC.2002.1004474"},{"key":"42_CR5","unstructured":"Montgomery, E.J.: Solution Biases and Pheromone Representation Selection in Ant Colony Optimisation. Ph.D thesis, Bond University (2005)"},{"key":"42_CR6","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.: $\\mathcal{MAX-MIN}$ ant system. Future Gen. Comp. Sys.\u00a016, 889\u2013914 (2000)","journal-title":"Future Gen. Comp. Sys."},{"key":"42_CR7","unstructured":"Roli, A., Blum, C., Dorigo, M.: ACO for maximal constraint satisfaction problems. In: 4th Metaheuristics International Conference, Porto, Portugal, pp. 187\u2013192 (2001)"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Trans. Evol. Comput.\u00a06 (2002)","DOI":"10.1109\/TEVC.2002.802449"},{"key":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-36605-9_22","volume-title":"Applications of Evolutionary Computing","author":"S. Fenet","year":"2003","unstructured":"Fenet, S., Solnon, C.: Searching for maximum cliques with ant colony optimization. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol.\u00a02611, pp. 236\u2013245. Springer, Heidelberg (2003)"},{"key":"42_CR10","first-page":"27","volume-title":"Genetic and Evolutionary Computation Conference","author":"C. Blum","year":"2002","unstructured":"Blum, C.: Ant colony optimization for the edge-weighted k-cardinality tree problem. In: Langdon, W. (ed.) Genetic and Evolutionary Computation Conference, pp. 27\u201334. Morgan Kaufmann Publishers, San Francisco (2002)"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"Costa, D., Hertz, A.: Ants can colour graphs. J. Oper. Res. Soc.\u00a048, 295\u2013305 (1997)","journal-title":"J. Oper. Res. Soc."},{"key":"42_CR12","unstructured":"Schoofs, L., Naudts, B.: Solving CSPs with ant colonies. In: Abstract Proceedings of ANTS 2000, Brussels, Belgium (2000)"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1057\/palgrave.jors.2601771","volume":"55","author":"F. Ducatelle","year":"2004","unstructured":"Ducatelle, F., Levine, J.: Ant colony optimisation and local search for bin packing and cutting stock problems. J. Oper. Res. Soc.\u00a055, 705\u2013716 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"42_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45724-0_1","volume-title":"Ant Algorithms","author":"K. Socha","year":"2002","unstructured":"Socha, K., Knowles, J.D., Sampels, M.: A $\\cal{MAX-MIN}$ ant system for the university course timetabling problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 1\u201313. Springer, Heidelberg (2002)"},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/B:JMMA.0000038614.39977.6f","volume":"3","author":"C. Blum","year":"2004","unstructured":"Blum, C., Sampels, M.: An ant colony optimization algorithm for shop scheduling problems. J. Math. Model. Algorithms\u00a03, 285\u2013308 (2004)","journal-title":"J. Math. Model. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Ant Colony Optimization and Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11839088_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T15:39:44Z","timestamp":1736523584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11839088_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540384823","9783540384830"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11839088_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}