{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:02:45Z","timestamp":1771700565282,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642238567","type":"print"},{"value":"9783642238574","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23857-4_40","type":"book-chapter","created":{"date-parts":[[2011,9,23]],"date-time":"2011-09-23T23:46:40Z","timestamp":1316821600000},"page":"416-427","source":"Crossref","is-referenced-by-count":16,"title":["Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"M\u00fchlenthaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabine","family":"Helwig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Wanka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2007.10.044","volume":"193","author":"D. Anghinolfi","year":"2009","unstructured":"Anghinolfi, D., Paolucci, M.: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. European Journal of Operational Research\u00a0193, 73\u201385 (2009), doi:10.1016\/j.ejor.2007.10.044","journal-title":"European Journal of Operational Research"},{"key":"40_CR2","unstructured":"Clerc, M.: Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem. Website (2000), http:\/\/clerc.maurice.free.fr\/pso\/pso_tsp\/Discrete_PSO_TSP.zip"},{"key":"40_CR3","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-39930-8_8","volume-title":"New Optimization Techniques in Engineering","author":"M. Clerc","year":"2004","unstructured":"Clerc, M.: Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, pp. 219\u2013239. Springer, Heidelberg (2004)"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M. Clerc","year":"2002","unstructured":"Clerc, M., Kennedy, J.: The particle swarm \u2013 Explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation\u00a06, 58\u201373 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proc. 6th International Symposium on Micro Machine and Human Science, pp. 39\u201343 (1995)","DOI":"10.1109\/MHS.1995.494215"},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/11730095_9","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"E.F.G. Goldbarg","year":"2006","unstructured":"Goldbarg, E.F.G., de Souza, G.R., Goldbarg, M.C.: Particle swarm for the traveling salesman problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol.\u00a03906, pp. 99\u2013110. Springer, Heidelberg (2006)"},{"key":"40_CR7","series-title":"Combinatorial Optimization","volume-title":"The Traveling Salesman Problem and Its Variations","year":"2002","unstructured":"Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol.\u00a012. Springer, Heidelberg (2002)"},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/978-3-540-87700-4_88","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"S. Helwig","year":"2008","unstructured":"Helwig, S., Wanka, R.: Theoretical analysis of initial particle swarm behavior. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol.\u00a05199, pp. 889\u2013898. Springer, Heidelberg (2008)"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ipl.2006.10.005","volume":"102","author":"M. Jiang","year":"2007","unstructured":"Jiang, M., Luo, Y.P., Yang, S.Y.: Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. Inf. Process. Lett.\u00a0102, 8\u201316 (2007)","journal-title":"Inf. Process. Lett."},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01188586","volume":"13","author":"J. Kececioglu","year":"1995","unstructured":"Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica\u00a013, 180\u2013210 (1995)","journal-title":"Algorithmica"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE International Conference on Neural Networks, vol.\u00a04, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics, vol.\u00a05, pp. 4104\u20134108 (1997)","DOI":"10.1109\/ICSMC.1997.637339"},{"issue":"4","key":"40_CR13","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB \u2013 A traveling salesman problem library. ORSA Journal on Computing\u00a03(4), 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"},{"key":"40_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"X.H. 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.\u00a0103, 169\u2013176 (2007)","journal-title":"Inf. Process. Lett."},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Shi, X.H., Zhou, Y., Wang, L.M., Wang, Q.X., Liang, Y.C.: A discrete particle swarm optimization algorithm for travelling salesman problem. In: Proc. 1st Int. Conf. on Computation Methods (ICCM), vol.\u00a02, pp. 1063\u20131068 (2004)","DOI":"10.1007\/978-1-4020-3953-9_8"},{"key":"40_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-45078-8_28","volume-title":"Algorithms and Data Structures","author":"A. Solomon","year":"2003","unstructured":"Solomon, A., Sutcliffe, P., Lister, R.: Sorting circular permutations by reversal. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 319\u2013328. Springer, Heidelberg (2003)"},{"key":"40_CR17","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0020-0190(02)00447-7","volume":"85","author":"I.C. Trelea","year":"2003","unstructured":"Trelea, I.C.: The particle swarm optimization algorithm: Convergence analysis and parameter selection. Inf. Process. Lett.\u00a085, 317\u2013325 (2003)","journal-title":"Inf. Process. Lett."},{"key":"40_CR18","unstructured":"Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: Proc. 2nd Int. Conf. on Machine Learning and Cybernetics, vol.\u00a03, pp. 1583\u20131585 (2003)"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Zhong, W., Zhang, J., Chen, W.: A novel discrete particle swarm optimization to solve traveling salesman problem. In: Proc. IEEE Congress on Evolutionary Computation (CEC), pp. 3283\u20133287 (2007)","DOI":"10.1109\/CEC.2007.4424894"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23857-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T23:05:42Z","timestamp":1741734342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23857-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642238567","9783642238574"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23857-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}