{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:32:28Z","timestamp":1759667548301},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811036132"},{"type":"electronic","value":"9789811036149"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-981-10-3614-9_34","type":"book-chapter","created":{"date-parts":[[2017,1,7]],"date-time":"2017-01-07T05:02:41Z","timestamp":1483765361000},"page":"278-284","source":"Crossref","is-referenced-by-count":14,"title":["Applying K-means Clustering and Genetic Algorithm for Solving MTSP"],"prefix":"10.1007","author":[{"given":"Zhanqing","family":"Lu","sequence":"first","affiliation":[]},{"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Juanjuan","family":"He","sequence":"additional","affiliation":[]},{"given":"Yunyun","family":"Niu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,8]]},"reference":[{"key":"34_CR1","first-page":"38","volume":"22","author":"S Jin","year":"2002","unstructured":"Jin, S.: The model and algorithm of city vehicles logistic tours. Comput. Eng. Appl. 22, 38\u201340 (2002)","journal-title":"Comput. Eng. Appl."},{"key":"34_CR2","volume-title":"The Traveling Salesman Problem","author":"EL Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Shmoys, D.B.: The Traveling Salesman Problem. Wiley, Chichester (1985)"},{"key":"34_CR3","first-page":"44","volume":"41","author":"RMF Alves","year":"2015","unstructured":"Alves, R.M.F., Lopes, C.R.: Using genetic algorithms to minimize the distance and balance the routes for the multiple traveling salesman problem. Evol. Comput. 41, 44\u201351 (2015). IEEE","journal-title":"Evol. Comput."},{"key":"34_CR4","first-page":"839","volume":"26","author":"J Shengping","year":"2002","unstructured":"Shengping, J.: A hybrid genetic algorithm to solve TSP and MTSP. J. Wuhan Univ. Technol. 26, 839\u2013842 (2002)","journal-title":"J. Wuhan Univ. Technol."},{"key":"34_CR5","unstructured":"Wang, C.: The modelling of the optimal routes for the disaster inspection. J. An-hui Inst. Mech. Electr. Eng. (2000)"},{"key":"34_CR6","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-662-45049-9_96","volume-title":"Bio-Inspired Computing - Theories and Applications","author":"K Zhang","year":"2014","unstructured":"Zhang, K., Yang, S., Li, L., Qiu, M.: Parallel genetic algorithm with OpenCL for traveling salesman problem. In: Pan, L., P\u0103un, G., P\u00e9rez-Jim\u00e9nez, M.J., Song, T. (eds.) BIC-TA 2014. CCIS, vol. 472, pp. 585\u2013590. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45049-9_96"},{"key":"34_CR7","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/3477.764879","volume":"29","author":"K Krishna","year":"1999","unstructured":"Krishna, K., Murty, M.N.: Genetic K-means algorithm. IEEE Trans. Syst. Man Cybern. Part B Cybern. 29, 433\u2013439 (1999)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"key":"34_CR8","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1016\/S0031-3203(99)00137-5","volume":"33","author":"U Maii","year":"2000","unstructured":"Maii, U., Bandyopadhyay, S.: Genetic algorithm-based clustering technique. J. Pattern Recogn. 33, 1455\u20131465 (2000)","journal-title":"J. Pattern Recogn."},{"key":"34_CR9","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-662-49014-3_58","volume-title":"Bio-Inspired Computing \u2013 Theories and Applications","author":"L Li","year":"2015","unstructured":"Li, L., Zhang, K., Yang, S., He, J.: Parallel hybrid genetic algorithm for maximum clique problem on OpenCL. In: Gong, M., Pan, L., Song, T., Tang, K., Zhang, X. (eds.) BIC-TA 2015. CCIS, vol. 562, pp. 653\u2013663. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-49014-3_58"},{"key":"34_CR10","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1016\/j.neucom.2014.10.044","volume":"151","author":"T Song","year":"2015","unstructured":"Song, T., Zeng, X., Liu, X.: Asynchronous spiking neural P systems with rules on synapses. Neurocomputing 151, 1439\u20131445 (2015)","journal-title":"Neurocomputing"},{"key":"34_CR11","doi-asserted-by":"crossref","first-page":"2816","DOI":"10.1109\/TNNLS.2015.2396940","volume":"26","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Pan, L., Pun, A.: On universality of axon P systems. IEEE Trans. Neural Netw. Learn. Syst. 26, 2816\u20132829 (2015)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"34_CR12","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1162\/NECO_a_00238","volume":"24","author":"L Pan","year":"2012","unstructured":"Pan, L., Wang, J., Hoogeboom, H.J.: Spiking neural P systems with astrocytes. Neural Comput. 24, 805\u2013825 (2012)","journal-title":"Neural Comput."},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1109\/TNB.2015.2438257","volume":"14","author":"X Liu","year":"2015","unstructured":"Liu, X., Li, Z., Liu, J., Liu, L., Zeng, X.: Implementation of arithmetic operations with time-free spiking neural P systems. IEEE Trans. NanoBiosci. 14, 617\u2013624 (2015)","journal-title":"IEEE Trans. NanoBiosci."},{"key":"34_CR14","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1162\/NECO_a_00605","volume":"26","author":"X Zeng","year":"2014","unstructured":"Zeng, X., Zhang, X., Song, T., Pan, L.: Spiking neural P systems with thresholds. Neural Comput. 26, 1340\u20131361 (2014)","journal-title":"Neural Comput."},{"key":"34_CR15","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1109\/TNNLS.2016.2555845","volume":"27","author":"J Xu","year":"2016","unstructured":"Xu, J.: Probe machine. IEEE Trans. Neural Netw. Learn. Syst. 27, 1405\u20131416 (2016)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"34_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TEVC.2014.2308305","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Ye, T., Cheng, R., Jin, Y.: An efficient approach to non-dominated sorting for evolutionary multi-objective optimiza-tion. IEEE Trans. Evol. Comput. 19, 201\u2013213 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"34_CR17","doi-asserted-by":"crossref","first-page":"1626","DOI":"10.1631\/jzus.2006.A1626","volume":"7","author":"FA Torkey","year":"2006","unstructured":"Torkey, F.A., Ramadan, M.A.: An efficient enhanced k-means clustering algorithm. J. of Zhejiang Univ. Sci. A 7, 1626\u20131633 (2006)","journal-title":"J. of Zhejiang Univ. Sci. A"},{"key":"34_CR18","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24, 881\u2013892 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"34_CR19","unstructured":"Huang, Z.: A fast clustering algorithm to cluster very large categorical data sets in data mining. In: Research Issues on Data Mining & Knowledge Discovery (1998)"},{"key":"34_CR20","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/j.ins.2016.08.055","volume":"372","author":"T Song","year":"2016","unstructured":"Song, T., Zheng, P., Wong, D.M., Wang, X.: Design of logic gates using spiking neural P systems with homogeneous neurons and astrocytes-like control. Inf. Sci. 372, 380\u2013391 (2016)","journal-title":"Inf. Sci."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing \u2013 Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3614-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:32:00Z","timestamp":1498375920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3614-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9789811036132","9789811036149"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3614-9_34","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}