{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T11:32:41Z","timestamp":1775302361892,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642259432","type":"print"},{"value":"9783642259449","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25944-9_3","type":"book-chapter","created":{"date-parts":[[2012,1,3]],"date-time":"2012-01-03T01:15:12Z","timestamp":1325553312000},"page":"17-23","source":"Crossref","is-referenced-by-count":3,"title":["A Modified Inver-over Operator for the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Yuting","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junqing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaizhou","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","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. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. Eur. J. Oper. Res.\u00a0126, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial-time Approximation Schemes for Euclidean TSP and Other Geometric Problems. J. ACM\u00a045, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0167-8191(05)80107-3","volume":"17","author":"C.S. Jeong","year":"1991","unstructured":"Jeong, C.S., Kim, M.H.: Fast Parallel Simulated Annealing for Traveling Salesman Problem on SIMD Machines with Linear Interconnections. Parallel Comput.\u00a017, 221\u2013228 (1991)","journal-title":"Parallel Comput."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.physa.2006.04.052","volume":"371","author":"Y. Chen","year":"2006","unstructured":"Chen, Y., Zhang, P.: Optimized Annealing of Traveling Salesman Problem from the Nth-nearest-neighbor Distribution. Physica A\u00a0371, 627\u2013632 (2006)","journal-title":"Physica A"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"C.-N. Fiechter","year":"1994","unstructured":"Fiechter, C.-N.: A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems. Discrete Appl. Math.\u00a051, 226\u2013243 (1994)","journal-title":"Discrete Appl. Math."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/BFb0056922","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"T. Guo","year":"1998","unstructured":"Guo, T., Michalewicz, Z.: Inver-over Operator for the Tsp. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 803\u2013812. Springer, Heidelberg (1998)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0255(99)00124-3","volume":"122","author":"S.J. Louis","year":"2000","unstructured":"Louis, S.J., Li, G.: Case Injected Genetic Algorithms for Traveling Salesman Problems. Inform. Sci.\u00a0122, 201\u2013225 (2000)","journal-title":"Inform. Sci."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M. Albayrak","year":"2011","unstructured":"Albayrak, M., Allahverdi, N.: Development A New Mutation Operator to Solve the Traveling Salesman Problem by aid of Genetic Algorithms. Expert Syst. Appl.\u00a038, 1313\u20131320 (2011)","journal-title":"Expert Syst. Appl."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable Neighborhood Search. Comput. Oper. Res.\u00a024, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D. Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for Large Traveling Salesman Problems. Informs J. Comput.\u00a015, 82\u201392 (2003)","journal-title":"Informs J. Comput."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2003.11.008","volume":"166","author":"C.F. Tsai","year":"2004","unstructured":"Tsai, C.F., Tsai, C.W., Tseng, C.C.: A New Hybrid Heuristic Approach for Solving Large Traveling Salesman Problem. Inform. Sci.\u00a0166, 67\u201381 (2004)","journal-title":"Inform. Sci."},{"key":"3_CR13","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. Inform. Process. Lett.\u00a0103, 169\u2013176 (2007)","journal-title":"Inform. Process. Lett."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.neucom.2008.01.023","volume":"72","author":"J.C. Cr\u00e9put","year":"2009","unstructured":"Cr\u00e9put, J.C., Koukam, A.: A Memetic Neural Network for the Euclidean Traveling Salesman Problem. Neurocomputing\u00a072, 1250\u20131264 (2009)","journal-title":"Neurocomputing"},{"key":"3_CR15","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\u2014A Traveling Salesman Problem Library. ORSA J. Comput.\u00a03, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25944-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T17:36:41Z","timestamp":1556041001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25944-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642259432","9783642259449"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25944-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}