{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:19:40Z","timestamp":1758709180146,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319670737"},{"type":"electronic","value":"9783319670744"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67074-4_27","type":"book-chapter","created":{"date-parts":[[2017,9,6]],"date-time":"2017-09-06T23:01:15Z","timestamp":1504738875000},"page":"277-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving Dynamic Traveling Salesman Problem with Ant Colony Communities"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Siemi\u0144ski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,7]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"27_CR2","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2011","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2011)"},{"issue":"1","key":"27_CR3","first-page":"46","volume":"7","author":"M Antosiewicz","year":"2013","unstructured":"Antosiewicz, M., Koloch, G., Kami\u0144skim, B.: Choice of best possible metaheuristic algorithm for the Travelling Salesman Problem with limited computational time: quality, uncertainty and speed. J. Theor. Appl. Comput. Sci. 7(1), 46\u201355 (2013)","journal-title":"J. Theor. Appl. Comput. Sci."},{"key":"27_CR4","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. thesis, Politecnico di Milano, Italie (1992)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"HN Psarafits","year":"1995","unstructured":"Psarafits, H.N.: Dynamic vehicle routing: status and prospects. Nat. Tech. Annal. Oper. Res. 61, 143\u2013164 (1995)","journal-title":"Nat. Tech. Annal. Oper. Res."},{"key":"27_CR6","first-page":"213","volume-title":"Lecture Notes in Computer Science","author":"Michael Guntsch","year":"2001","unstructured":"Guntsch, M., Middendorf, M.: Pheromone modifcation strategies for ant algorithms applied to dynamic TSP. In: EvoWorkshops 2001: Applications of Evolutionary Computation, pp. 213\u2013222 (2001)"},{"key":"27_CR7","first-page":"72","volume-title":"Lecture Notes in Computer Science","author":"Michael Guntsch","year":"2002","unstructured":"Guntsch, M., Middendorf, M.: A population based approach for ACO. In: Proceeding of 2nd European Workshop on Evolutionary Computation in Combinatorial Optimization (EvoCOP-2002), vol. 2279, pp. 72\u201381 (2002)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-642-15871-1_38","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"M Mavrovouniotis","year":"2010","unstructured":"Mavrovouniotis, M., Yang, S.: Ant colony optimization with immigrants schemes in dynamic environments. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6239, pp. 371\u2013380. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-15871-1_38"},{"key":"27_CR9","unstructured":"Dorigo, M., Stuetzle, T.: Ant Colony Optimization: overview and recent advances. IRIDIA - Technical Report Series, Technical Report No. TR\/IRIDIA\/2009-013, May 2009"},{"key":"27_CR10","unstructured":"Siemi\u0144ski, A.: TSP\/ACO Partameter Optimization; Information Systems Architecture and Technology; System Analysis Approach to the Design, Control and Decision Support; pp. 151\u2013161. Oficyna Wydawnicza Politechniki Wroc\u0142awskiej Wroc\u0142aw (2011)"},{"key":"27_CR11","unstructured":"Gaertner, D., Clark, K.L.: On optimal parameters for Ant Colony Optimization algorithms. In: IC-AI, pp. 83\u201389 (2005)"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"5181","DOI":"10.1016\/j.asoc.2011.05.042","volume":"11","author":"M Pedemonte","year":"2011","unstructured":"Pedemonte, M., Nesmachnow, S., Cancela, H.: A survey on parallel Ant Colony Optimization. Appl. Soft Comput. 11, 5181\u20135197 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"27_CR13","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.3233\/JIFS-169135","volume":"32","author":"A Siemi\u0144ski","year":"2017","unstructured":"Siemi\u0144ski, A., Kopel, M.: Comparing efficiency of ACO parallel implementations. J. Intell. Fuzzy Syst. 32(2), 1377\u20131388 (2017)","journal-title":"J. Intell. Fuzzy Syst."},{"key":"27_CR14","unstructured":"Chirico, U.: A Java framework for ant colony systems. In: Ants2004: Forth International Workshop on Ant Colony Optimization and Swarm Intelligence, Brussels (2004)"},{"key":"27_CR15","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-43982-2_18","volume-title":"Multimedia and Network Information Systems","author":"A Siemi\u0144ski","year":"2017","unstructured":"Siemi\u0144ski, A.: Measuring efficiency of Ant Colony Communities. In: Zgrzywa, A., Choro\u015b, K., Siemi\u0144ski, Aj (eds.) Multimedia and Network Information Systems. AISC, vol. 506, pp. 203\u2013213. Springer, Cham (2017). doi:10.1007\/978-3-319-43982-2_18"},{"issue":"1","key":"27_CR16","first-page":"66","volume":"1","author":"T-P Hong","year":"2017","unstructured":"Hong, T.-P., Peng, Y.-C., Lin, W.-Y., Wang, S.-L.: Empirical comparison of level-wise hierarchical multi-population genetic algorithm. J. Inf. Telecommun. 1(1), 66\u201378 (2017)","journal-title":"J. Inf. Telecommun."}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67074-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:20:57Z","timestamp":1710361257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-67074-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319670737","9783319670744"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67074-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"7 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}