{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T09:04:26Z","timestamp":1780563866039,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":44,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811046414","type":"print"},{"value":"9789811046421","type":"electronic"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-4642-1_10","type":"book-chapter","created":{"date-parts":[[2017,4,15]],"date-time":"2017-04-15T05:18:49Z","timestamp":1492233529000},"page":"103-119","source":"Crossref","is-referenced-by-count":15,"title":["Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Indadul","family":"Khan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manas Kumar","family":"Maiti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manoranjan","family":"Maiti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,4,16]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Akhand, M.A.H., Akter, S., Rashid, M.A.: Velocity tentative particle swarm optimization to solve TSP. In: 2013 International Conference on Electrical Information and Communication Technology (EICT), pp. 1\u20136. IEEE Conference Publications (2014)","DOI":"10.1109\/EICT.2014.6777868"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/BFb0040811","volume-title":"Evolutionary Programming VII","author":"PJ Angeline","year":"1998","unstructured":"Angeline, P.J.: Evolutionary optimization versus particle swarm optimization: philosophy and performance differences. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds.) EP 1998. LNCS, vol. 1447, pp. 601\u2013610. Springer, Heidelberg (1998). doi:\n10.1007\/BFb0040811"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.cor.2006.03.023","volume":"35","author":"B Bontoux","year":"2008","unstructured":"Bontoux, B., Feillet, D.: Ant colony optimization for the traveling purchaser problem. Comput. Oper. Res. 35(2), 628\u2013637 (2008)","journal-title":"Comput. Oper. Res."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.swevo.2013.11.001","volume":"15","author":"C Changdar","year":"2014","unstructured":"Changdar, C., Mahapatra, G.S., Pal, R.: An efficient genetic algorithm for multi-objective solid traveling salesman problem under fuzziness. Swarm Evol. Comput. 15, 27\u201337 (2014)","journal-title":"Swarm Evol. Comput."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","volume":"38","author":"SM Chen","year":"2011","unstructured":"Chen, S.M., Chien, C.Y.: Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst. Appl. 38, 14439\u201314450 (2011)","journal-title":"Expert Syst. Appl."},{"key":"10_CR6","first-page":"393","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of large scale traveling salesman problem. Oper. Res. 2, 393\u2013410 (1954)","journal-title":"Oper. Res."},{"key":"10_CR7","first-page":"11","volume-title":"New Ideas in Optimization","author":"M Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11\u201332. McGraw-Hill, London (1999)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. Biosystems 43, 73\u201381 (1997)","journal-title":"Biosystems"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part-B Cybern. 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. Part-B Cybern."},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Eberhart, R., Kennedy, J.: A new optimizer using particles swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine, Human Science, Nagoya, Japan, pp. 39\u201343. IEEE Service Center, Piscataway (1995)","DOI":"10.1109\/MHS.1995.494215"},{"key":"10_CR11","first-page":"3407","volume":"6","author":"H Fan","year":"2010","unstructured":"Fan, H.: Discrete particle swarm optimization for TSP based on neighborhood. J. Comput. Inf. Syst. (JCIS) 6, 3407\u20133414 (2010)","journal-title":"J. Comput. Inf. Syst. (JCIS)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1287\/ijoc.14.4.403.2827","volume":"14","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. 14, 403\u2013417 (2002)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","volume":"11","author":"XT Geng","year":"2011","unstructured":"Geng, X.T., Chen, Z.H., Yang, W., Shi, D.Q., Zhao, K.: Solving the traveling sales-man problem based on an adaptive simulated annealing algorithm with greedy search. Appl. Soft Comput. 11(4), 3680\u20133689 (2011)","journal-title":"Appl. Soft Comput."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.asoc.2012.07.028","volume":"13","author":"P Guchhait","year":"2013","unstructured":"Guchhait, P., Maiti, M.K., Maitia, M.: Two storage inventory model of a deteriorating item with variable demand under partial credit period. Appl. Soft Comput. 13, 428\u2013448 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10_CR15","first-page":"321","volume":"51","author":"P Guchhait","year":"2013","unstructured":"Guchhait, P., Maiti, M.K., Maitia, M.: Inventory model of a deteriorating item with price and credit linked fuzzy demand: a fuzzy differential equation approach. Oper. Res. Soc. India 51(3), 321\u2013353 (2013)","journal-title":"Oper. Res. Soc. India"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.3906\/elk-1210-147","volume":"23","author":"M Gunduz","year":"2015","unstructured":"Gunduz, M., Kiran, M.S., Ozceylan, E.: A hierarchic approach based on swarm intelligence to solve traveling salesman problem. Turk. J. Electr. Eng. Comput. Sci. 23, 103\u2013117 (2015)","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic. Math. Program. Comput. 1, 119\u2013163 (2009)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1287\/trsc.1030.0085","volume":"39","author":"T Ibaraki","year":"2005","unstructured":"Ibaraki, T., Imahori, S., Kubo, M., Masuda, T., Uno, T., Yagiura, M.: Effective local search algorithm for routing and scheduling problems with general time window constraints. Transp. Sci. 39(2), 206\u2013232 (2005)","journal-title":"Transp. Sci."},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Junqiang, W., Aijia, O.: A hybrid algorithm of ACO and delete-cross method for TSP. In: 2012 International Conference on Industrial Control and Electronics Engineering (ICICEE), pp. 1694\u20131696. IEEE (2012)","DOI":"10.1109\/ICICEE.2012.448"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"5331","DOI":"10.1016\/j.eswa.2010.01.002","volume":"37","author":"F Jolai","year":"2010","unstructured":"Jolai, F., Ghanbari, A.: Integrating data transformation techniques with Hopfield neural networks for solving traveling salesman problem. Expert Syst. Appl. 37, 5331\u20135335 (2010)","journal-title":"Expert Syst. Appl."},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Karaboga, D., Gorkemli, B.: A combinatorial artificial bee colony algorithm for traveling salesman problem. In: 2011 International Symposium on Innovations in Intelligent Systems and Applications, Istanbul, Turkey","DOI":"10.1109\/INISTA.2011.5946125"},{"key":"10_CR22","first-page":"1942","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. IEEE Int. Conf. Neural Netw. 4, 1942\u20131948 (1995)","journal-title":"IEEE Int. Conf. Neural Netw."},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.cie.2015.06.018","volume":"88","author":"A Khanra","year":"2015","unstructured":"Khanra, A., Maiti, M.K., Maiti, M.: Profit maximization of TSP through a hybrid algorithm. Comput. Ind. Eng. 88, 229\u2013236 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"9","key":"10_CR24","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1016\/j.cor.2009.11.015","volume":"37","author":"M Lopez-Ibanez","year":"2010","unstructured":"Lopez-Ibanez, M., Blum, C.: Beam-ACO for the traveling salesman problem with time windows. Comput. Oper. Res. 37(9), 1570\u20131583 (2010)","journal-title":"Comput. Oper. Res."},{"key":"10_CR25","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"EL Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York (1985)"},{"issue":"3","key":"10_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. J. Evol. Comput. 10(3), 281\u2013295 (2006)","journal-title":"J. Evol. Comput."},{"issue":"2","key":"10_CR27","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"issue":"9","key":"10_CR28","doi-asserted-by":"publisher","first-page":"3063","DOI":"10.1016\/j.cam.2010.12.027","volume":"235","author":"J Majumdar","year":"2011","unstructured":"Majumdar, J., Bhunia, A.K.: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J. Comput. Appl. Math. 235(9), 3063\u20133078 (2011)","journal-title":"J. Comput. Appl. Math."},{"issue":"10","key":"10_CR29","doi-asserted-by":"publisher","first-page":"4023","DOI":"10.1016\/j.asoc.2013.05.022","volume":"13","author":"M Mavrovouniotis","year":"2013","unstructured":"Mavrovouniotis, M., Yang, S.: Ant colony optimization with immigrants schemes for the dynamic traveling salesman problem with traffic factors. Appl. Soft Comput. 13(10), 4023\u20134037 (2013)","journal-title":"Appl. Soft Comput."},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi, M., Baykan, O.K., Kodaz, H.: A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem. Appl. Soft Comput. 30, 484\u2013490 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"10_CR31","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1016\/j.ins.2008.12.016","volume":"179","author":"TAS Masutti","year":"2009","unstructured":"Masutti, T.A.S., de Castro, L.N.: A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Inf. Sci. 179(10), 1454\u20131468 (2009)","journal-title":"Inf. Sci."},{"key":"10_CR32","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01609016","volume":"15","author":"P Miliotis","year":"1978","unstructured":"Miliotis, P.: Using cutting planes to solve the symmetric travelling salesman problem. Math. Program. 15, 177\u2013188 (1978). North-Holland Publishing Company","journal-title":"Math. Program."},{"key":"10_CR33","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/S0377-2217(01)00227-2","volume":"140","author":"C Moon","year":"2002","unstructured":"Moon, C., Kim, J., Choi, G., Seo, Y.: An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur. J. Oper. Res. 140, 606\u2013617 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10_CR34","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TSMCB.2006.880136","volume":"37","author":"HD Nguyen","year":"2007","unstructured":"Nguyen, H.D., Yoshihara, I., Yamamori, K., Yasunaga, M.: Implementation of an effective hybrid GA for large scale traveling salesman problem. IEEE Trans. Syst. Man Cybern. Part-B Cybern. 37(1), 92\u201399 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern. Part-B Cybern."},{"issue":"14","key":"10_CR35","first-page":"126","volume":"5","author":"ZA Othman","year":"2013","unstructured":"Othman, Z.A., Srour, A.I., Hamdan, A.R., Ling, P.Y.: Performance water flow-like algorithm for TSP by improving its local search. Int. J. Adv. Comput. Technol. 5(14), 126 (2013)","journal-title":"Int. J. Adv. Comput. Technol."},{"key":"10_CR36","first-page":"87","volume":"12","author":"MW Petberg","year":"1980","unstructured":"Petberg, M.W., Homg, S.: On the symmetric traveling salesman problems: a computational study. Math. Program. Stud. 12, 87\u2013107 (1980)","journal-title":"Math. Program. Stud."},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Pasti, R., De Castro, L.N.: A Neuro-immune network for solving the traveling salesman problem. In: Proceedings of International Joint Conference on Neural Networks, IJCNN 2006, pp. 3760\u20133766 (2006)","DOI":"10.1109\/IJCNN.2006.247394"},{"key":"10_CR38","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.ejor.2008.08.009","volume":"198","author":"HL Petersen","year":"2009","unstructured":"Petersen, H.L., Madsen, O.B.G.: The double traveling salesman problem within multiple stack formulation and heuristic solution approaches. Eur. J. Oper. Res. 198, 339\u2013347 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M Padberg","year":"1987","unstructured":"Padberg, M., Rinaldi, G.: Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper. Res. Lett. 6(1), 1\u20137 (1987)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"10_CR40","first-page":"351","volume":"22","author":"G Sierksma","year":"2014","unstructured":"Sierksma, G.: Hamiltonicity and the 3-OPT procedure for the traveling salesman problem. Appl. Math. 22(2), 351\u2013358 (2014)","journal-title":"Appl. Math."},{"issue":"5","key":"10_CR41","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH 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. 103(5), 169\u2013176 (2007)","journal-title":"Inf. Process. Lett."},{"key":"10_CR42","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2003.11.008","volume":"166","author":"CF Tsai","year":"2004","unstructured":"Tsai, C.F., Tsai, C.W., Tseng, C.C.: A new hybrid heuristic approach for solving large traveling salesman problem. Inf. Sci. 166, 67\u201381 (2004)","journal-title":"Inf. Sci."},{"key":"10_CR43","first-page":"1583","volume":"3","author":"KP Wang","year":"2003","unstructured":"Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle swarm optimization for traveling salesman problem. Int. Conf. Mach. Learn. Cybern. 3, 1583\u20131585 (2003)","journal-title":"Int. Conf. Mach. Learn. Cybern."},{"issue":"6","key":"10_CR44","first-page":"264","volume":"9","author":"X Yan","year":"2012","unstructured":"Yan, X., Zhang, C., Luo, W., Li, W., Chen, W., Liu, H.: Solve traveling salesman problem using particle swarm optimization algorithm. Int. J. Comput. Sci. Issues 9(6), 264\u2013271 (2012)","journal-title":"Int. J. Comput. Sci. Issues"}],"container-title":["Communications in Computer and Information Science","Mathematics and Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-4642-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,15]],"date-time":"2017-04-15T05:21:49Z","timestamp":1492233709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-4642-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811046414","9789811046421"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-4642-1_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}