{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:13:23Z","timestamp":1761293603958},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T00:00:00Z","timestamp":1501200000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00500-017-2738-9","type":"journal-article","created":{"date-parts":[[2017,7,27]],"date-time":"2017-07-27T23:55:32Z","timestamp":1501199732000},"page":"7633-7648","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Adjustability of a discrete particle swarm optimization for the dynamic TSP"],"prefix":"10.1007","volume":"22","author":[{"given":"\u0141ukasz","family":"Str\u0105k","sequence":"first","affiliation":[]},{"given":"Rafa\u0142","family":"Skinderowicz","sequence":"additional","affiliation":[]},{"given":"Urszula","family":"Boryczka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,28]]},"reference":[{"key":"2738_CR1","unstructured":"Applegate D, Bixby R, Chvatal V, Cook W (2006) Concorde TSP solver. http:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html . Accessed 24 Jul 2017"},{"issue":"5","key":"2738_CR2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1017\/S0963548312000193","volume":"21","author":"Y Bilu","year":"2012","unstructured":"Bilu Y, Linial N (2012) Are stable instances easy? Comb Probab Comput 21(5):643\u2013660","journal-title":"Comb Probab Comput"},{"key":"2738_CR3","doi-asserted-by":"crossref","unstructured":"Blackwell T, Branke J, Li X (2008) Particle swarms for dynamic optimization problems. In: Blum C, Merkle D (eds) Swarm Intelligence. Natural computing series. Springer, Berlin, Heidelberg, pp 193\u2013217","DOI":"10.1007\/978-3-540-74089-6_6"},{"key":"2738_CR4","doi-asserted-by":"crossref","unstructured":"Boryczka U, Str\u0105k \u0141 (2012) A hybrid discrete particle swarm optimization with pheromone for dynamic traveling salesman problem. In: Computational collective intelligence. Technologies and applications, lecture notes in computer science, vol 7654. Springer, Berlin, Heidelberg, pp 503\u2013512","DOI":"10.1007\/978-3-642-34707-8_51"},{"key":"2738_CR5","doi-asserted-by":"crossref","unstructured":"Boryczka U, Str\u0105k \u0141 (2013) Efficient DPSO neighbourhood for dynamic traveling salesman problem. In: Computational collective intelligence. Proceedings on Technologies and applications\u20145th international conference, ICCCI 2013, Craiova, Romania, September 11\u201313, pp 721\u2013730","DOI":"10.1007\/978-3-642-40495-5_72"},{"key":"2738_CR6","doi-asserted-by":"crossref","unstructured":"Boryczka U, Str\u0105k \u0141 (2015a) Diversification and entropy improvement on the dpso algorithm for dtsp. In: Intelligent information and database systems, lecture notes in computer science, vol 9011. Springer International Publishing, Berlin, pp 337\u2013347","DOI":"10.1007\/978-3-319-15702-3_33"},{"key":"2738_CR7","doi-asserted-by":"crossref","unstructured":"Boryczka U, Str\u0105k \u0141 (2015b) Heterogeneous dpso algorithm for dtsp. In: Computational collective intelligence, lecture notes in computer science, vol 9330. Springer International Publishing, pp 119\u2013128","DOI":"10.1007\/978-3-319-24306-1_12"},{"key":"2738_CR8","doi-asserted-by":"crossref","unstructured":"C\u00e1ceres LP, L\u00f3pez-Ib\u00e1nez M, St\u00fctzle T (2014) Ant colony optimization on a budget of 1000. In: Swarm intelligence, Springer, pp 50\u201361","DOI":"10.1007\/978-3-319-09952-1_5"},{"key":"2738_CR9","doi-asserted-by":"crossref","unstructured":"Demirta\u015f YE, \u00d6zdemir E, Demirta\u015f U (2015) A particle swarm optimization for the dynamic vehicle routing problem. In: 2015 6th International conference on modeling, simulation, and applied optimization (ICMSAO). IEEE, pp 1\u20135","DOI":"10.1109\/ICMSAO.2015.7152224"},{"key":"2738_CR10","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2010) Ant colony optimization: overview and recent advances. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics. Springer, pp 227\u2013263","DOI":"10.1007\/978-1-4419-1665-5_8"},{"key":"2738_CR11","doi-asserted-by":"crossref","unstructured":"Eyckelhof CJ, Snoek M, Vof M (2002) Ant systems for a dynamic tsp: ants caught in a traffic jam. In: Ant algorithms: third international workshop, ANTS 2002, vol 2463\/2002 of lecture notes in computer science. Springer, pp 88\u201399","DOI":"10.1007\/3-540-45724-0_8"},{"key":"2738_CR12","volume-title":"Particle swarm optimization algorithm for the traveling salesman problem","author":"E Goldbarg","year":"2008","unstructured":"Goldbarg E, de Souza G, Goldbarg M (2008) Particle swarm optimization algorithm for the traveling salesman problem. INTECH Open Access Publisher, Rijeka"},{"key":"2738_CR13","doi-asserted-by":"crossref","unstructured":"Guntsch M, Middendorf M (2001) Pheromone modification strategies for ant algorithms applied to dynamic tsp. In: Boers EJW (ed) Applications of evolutionary computing. Springer, pp 213\u2013222","DOI":"10.1007\/3-540-45365-2_22"},{"key":"2738_CR14","doi-asserted-by":"crossref","unstructured":"Guntsch M, Middendorf M (2002) Applying population based aco to dynamic optimization problems. In: Ant Algorithms, Springer, pp 111\u2013122","DOI":"10.1007\/3-540-45724-0_10"},{"key":"2738_CR15","unstructured":"Guntsch M, Middendorf M, Schmeck H (2001) An ant colony optimization approach to dynamic tsp. In: Proceedings of the 3rd annual conference on genetic and evolutionary computation. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, GECCO\u201901, pp 860\u2013867. http:\/\/dl.acm.org\/citation.cfm?id=2955239.2955396"},{"key":"2738_CR16","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An effective implementation of the Lin\u2013Kernighan traveling salesman heuristic. Eur J Oper Res 126:106\u2013130","journal-title":"Eur J Oper Res"},{"key":"2738_CR17","unstructured":"Hu X, Shi Y, Russell E (2004) Recent advances in particle swarm. In: Congress on evolutionary computation, CEC2004, vol 1, pp 90\u201397"},{"issue":"4","key":"2738_CR18","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s00158-008-0240-9","volume":"37","author":"V Kalivarapu","year":"2009","unstructured":"Kalivarapu V, Foo JL, Winer E (2009) Improving solution characteristics of particle swarm optimization using digital pheromones. Struct Multidiscip Optim 37(4):415\u2013427","journal-title":"Struct Multidiscip Optim"},{"key":"2738_CR19","unstructured":"Kang L, Zhou A, McKay RI, Li Y, Kang Z (2004) Benchmarking algorithms for dynamic travelling salesman problems. In: Proceedings of the IEEE congress on evolutionary computation, CEC 2004, 19\u201323 June 2004, Portland, OR, USA, pp 1286\u20131292"},{"key":"2738_CR20","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"2738_CR21","doi-asserted-by":"crossref","unstructured":"Khouadjia MR, Jourdan L, Talbi EG (2010) Adaptive particle swarm for solving the dynamic vehicle routing problem. In: 2010 IEEE\/ACS international conference on computer systems and applications (AICCSA). IEEE, pp 1\u20138","DOI":"10.1109\/AICCSA.2010.5586976"},{"key":"2738_CR22","doi-asserted-by":"crossref","unstructured":"Li W (2011) A parallel multi-start search algorithm for dynamic traveling salesman problem. In: Proceedings of the 10th international conference on experimental algorithms","DOI":"10.1007\/978-3-642-20662-7_6"},{"key":"2738_CR23","doi-asserted-by":"crossref","unstructured":"Li C, Yang M, Kang L (2006) A new approach to solving dynamic traveling salesman problems. In: Proceedings of the 6th international conference on simulated evolution and learning. Springer, Berlin, Heidelberg, SEAL\u201906, pp 236\u2013243","DOI":"10.1007\/11903697_31"},{"key":"2738_CR24","doi-asserted-by":"crossref","unstructured":"Mavrovouniotis M, Yang S (2010) Ant colony optimization with immigrants schemes in dynamic environments. In: Schaefer R, Cotta C, Ko\u0142odziej J, Rudolph G (eds) Parallel problem solving from nature, PPSN XI, lecture notes in computer science, vol 6239. Springer, Berlin, Heidelberg, pp 371\u2013380","DOI":"10.1007\/978-3-642-15871-1_38"},{"key":"2738_CR25","volume-title":"A benchmark generator for dynamic permutation-encoded problems","author":"M Mavrovouniotis","year":"2012","unstructured":"Mavrovouniotis M, Yang S, Yao X (2012) A benchmark generator for dynamic permutation-encoded problems. Springer, Berlin"},{"key":"2738_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2016.12.005","volume":"33","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis M, Li C, Yang S (2017) A survey of swarm intelligence for dynamic optimization: algorithms and applications. Swarm Evolut Comput 33:1\u201317","journal-title":"Swarm Evolut Comput"},{"key":"2738_CR27","unstructured":"Mori N, Kita H (2000) Genetic algorithms for adaptation to dynamic environments\u2014a survey. In: Industrial electronics society, 2000. IECON 2000, 26th annual conference of the IEEE, vol 4, pp 2947\u20132952"},{"key":"2738_CR28","doi-asserted-by":"crossref","unstructured":"Okulewicz M, Ma\u0144dziuk J (2013) Application of particle swarm optimization algorithm to dynamic vehicle routing problem. In: International conference on artificial intelligence and soft computing. Springer, pp 547\u2013558","DOI":"10.1007\/978-3-642-38610-7_50"},{"key":"2738_CR29","doi-asserted-by":"crossref","unstructured":"Oliveira SM, Hussin MS, St\u00fctzle T, Roli A, Dorigo M (2011) A detailed analysis of the population-based ant colony optimization algorithm for the tsp and the qap. In: Proceedings of the 13th annual conference companion on Genetic and evolutionary computation. ACM, pp 13\u201314","DOI":"10.1145\/2001858.2001866"},{"issue":"8","key":"2738_CR30","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 (2011) A survey on parallel ant colony optimization. Appl Soft Comput 11(8):5181\u20135197. doi: 10.1016\/j.asoc.2011.05.042","journal-title":"Appl Soft Comput"},{"key":"2738_CR31","unstructured":"Pintea CM, Pop PC, Dumitrescu D (2007) An ant-based technique for the dynamic generalized traveling salesman problem. In: Proceedings of the 7-th WSEAS international conference on systems theory and scientific computation, pp 257\u2013261"},{"issue":"4","key":"2738_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jitr.2012100101","volume":"5","author":"C Pintea","year":"2012","unstructured":"Pintea C, Crisan GC, Manea M (2012) Parallel ACO with a ring neighborhood for dynamic TSP. JITR 5(4):1\u201313. doi: 10.4018\/jitr.2012100101","journal-title":"JITR"},{"issue":"11","key":"2738_CR33","first-page":"373","volume":"1","author":"PC Pop","year":"2009","unstructured":"Pop PC, Pintea C, Dumitrescu D (2009) An ant colony algorithm for solving the dynamic generalized vehicle routing problem. Civil Eng 1(11):373\u2013382","journal-title":"Civil Eng"},{"key":"2738_CR34","first-page":"223","volume":"16","author":"H Psaraftis","year":"1988","unstructured":"Psaraftis H (1988) Dynamic vehicle routing problems. Veh Routing Methods Stud 16:223\u2013248","journal-title":"Veh Routing Methods Stud"},{"key":"2738_CR35","unstructured":"Reinelt G (1995) TSPLIB95. Interdisziplin\u00e4res Zentrum f\u00fcr Wissenschaftliches Rechnen (IWR). Heidelberg"},{"issue":"8","key":"2738_CR36","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) Max-min ant system. Future Gener Comput Syst 16(8):889\u2013914","journal-title":"Future Gener Comput Syst"},{"key":"2738_CR37","doi-asserted-by":"publisher","unstructured":"Tin\u00f3s R, Whitley D, Howe A (2014) Use of explicit memory in the dynamic traveling salesman problem. In: Proceedings of the 2014 annual conference on genetic and evolutionary computation. ACM, New York, NY, USA, GECCO \u201914, pp 999\u20131006. doi: 10.1145\/2576768.2598247","DOI":"10.1145\/2576768.2598247"},{"key":"2738_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-38416-5","volume-title":"Evolutionary computation for dynamic optimization problems","author":"S Yang","year":"2013","unstructured":"Yang S, Yao X (2013) Evolutionary computation for dynamic optimization problems. Springer, Berlin"},{"key":"2738_CR39","unstructured":"Younes A, Basir O, Calamai P (2003) A benchmark generator for dynamic optimization. In: Digest of the Proceedings of the wseas conferences"},{"key":"2738_CR40","doi-asserted-by":"publisher","unstructured":"Younes A, Calamai P, Basir O (2005) Generalized benchmark generation for dynamic combinatorial problems. In: Proceedings of the 7th annual workshop on genetic and evolutionary computation ACM, New York, NY, USA, GECCO \u201905, pp 25\u201331. doi: 10.1145\/1102256.1102262","DOI":"10.1145\/1102256.1102262"},{"key":"2738_CR41","unstructured":"Zhong Wl, Zhang J, Chen Wn (1997) A novel set-based particle swarm optimization method for discrete optimization problems. In: Evolutionary computation, 2007. CEC 2007, vol 14. IEEE, pp 3283\u20133287"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2738-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2738-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2738-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T14:48:43Z","timestamp":1569941323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2738-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,28]]},"references-count":41,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["2738"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2738-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,28]]}}}