{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:25:08Z","timestamp":1747153508046,"version":"3.40.5"},"publisher-location":"Singapore","reference-count":11,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811081224"},{"type":"electronic","value":"9789811081231"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-981-10-8123-1_14","type":"book-chapter","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T04:11:46Z","timestamp":1519359106000},"page":"155-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Improved Genetic Algorithms for Multiple Maximum Scatter Traveling Salesperson Problems"],"prefix":"10.1007","author":[{"given":"Wenyong","family":"Dong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3859-5957","authenticated-orcid":false,"given":"Xueshi","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Yufeng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,24]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1137\/S0097539797320281","volume":"29","author":"EM Arkin","year":"1999","unstructured":"Arkin, E.M., Chiang, Y.J., Mitchell, J.S.B., et al.: On the maximum scatter traveling salesperson problem. SIAM J. Comput. 29(2), 515\u2013544 (1999)","journal-title":"SIAM J. Comput."},{"key":"14_CR2","first-page":"585","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations, pp. 585\u2013607. Kluwer Academic Publishers, Boston, Dordrecht, London (2002)"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s00453-004-1124-z","volume":"41","author":"YJ Chiang","year":"2005","unstructured":"Chiang, Y.J.: New approximation results for the maximum scatter TSP. Algorithmica 41, 309\u2013341 (2005)","journal-title":"Algorithmica"},{"key":"14_CR4","unstructured":"John, L.R.: The bottleneck traveling salesman problem and some variants. Master of Science of Simon Fraser University, Canada, pp. 21\u201323 (2010)"},{"issue":"11","key":"14_CR5","doi-asserted-by":"crossref","first-page":"2390","DOI":"10.1109\/TCYB.2014.2371918","volume":"45","author":"J Li","year":"2015","unstructured":"Li, J., Zhou, M., Sun, Q., Dai, X., Yu, X.: Colored traveling salesman problem. IEEE Trans. Cybern. 45(11), 2390\u20132401 (2015)","journal-title":"IEEE Trans. Cybern."},{"key":"14_CR6","unstructured":"Li, J., Qiru, S., Zhou, M., Dai, X.: A new multiple traveling salesman problem and its genetic algorithm-based solution. In: Proceedings of the 2013 IEEE International Conference on Systems Man and Cybernetics, Manchester, U.K, pp. 1\u20136 (2013)"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/S0167-6377(03)00050-6","volume":"31","author":"GL Vairaktarakis","year":"2003","unstructured":"Vairaktarakis, G.L.: On gilmore-gomorys open question for the bottleneck TSP. Oper. Res. Lett. 31, 483\u2013491 (2003)","journal-title":"Oper. Res. Lett."},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.jda.2008.11.007","volume":"7","author":"MY Kao","year":"2009","unstructured":"Kao, M.Y., Sanghi, M.: An approximation algorithm for a bottleneck traveling salesman problem. J. Discrete Algorithms 7, 315\u2013326 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/11758471_23","volume-title":"Algorithms and Complexity","author":"MY Kao","year":"2006","unstructured":"Kao, M.Y., Sanghi, M.: An approximation algorithm for a bottleneck traveling salesman problem. In: Calamoneri, T., Finocchi, I., Italiano, Giuseppe F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 223\u2013235. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11758471_23"},{"issue":"1","key":"14_CR10","doi-asserted-by":"crossref","first-page":"9:1","DOI":"10.1145\/2406336.2406345","volume":"12","author":"ZH Ahmed","year":"2013","unstructured":"Ahmed, Z.H.: A hybrid genetic algorithm for the bottleneck traveling salesman problem. ACM Trans. Embed. Comput. Syst. 12(1), 9:1\u20139:10 (2013)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"issue":"8","key":"14_CR11","first-page":"1751","volume":"54","author":"XS Dong","year":"2017","unstructured":"Dong, X.S., Dong, W.Y., Wang, Y.F.: Hybrid algorithms for multi-objective balanced traveling salesman problem. J. Comput. Res. Dev. 54(8), 1751\u20131762 (2017)","journal-title":"J. Comput. Res. Dev."}],"container-title":["Communications in Computer and Information Science","Wireless Sensor Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-8123-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T04:18:25Z","timestamp":1519359505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-8123-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811081224","9789811081231"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-8123-1_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}