{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:48:15Z","timestamp":1766065695514},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617235"},{"type":"electronic","value":"9783540706687"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61723-x_1052","type":"book-chapter","created":{"date-parts":[[2006,7,12]],"date-time":"2006-07-12T10:34:58Z","timestamp":1152700498000},"page":"890-899","source":"Crossref","is-referenced-by-count":77,"title":["New genetic local search operators for the traveling salesman problem"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Freisleben","sequence":"first","affiliation":[]},{"given":"Peter","family":"Merz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,11]]},"reference":[{"key":"89_CR1","unstructured":"K. Boese, \u201cCost versus Distance in the Traveling Salesman Problem,\u201d Tech. Rep. TR-950018, UCLA CS Department, 1995."},{"key":"89_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K.D. Boese","year":"1994","unstructured":"K.D. Boese and S. Muddu, \u201cA New Adaptive Multi-Start Technique for Combinatorial Global Optimizations,\u201d Operations Research Letters 16, pp. 101\u2013113, 1994.","journal-title":"Operations Research Letters"},{"key":"89_CR3","first-page":"176","volume-title":"Combinatorial Optimization with Parallel Adaptive Threshold Accepting","author":"B. Freisleben","year":"1992","unstructured":"B. Freisleben and M. Schulte, \u201cCombinatorial Optimization with Parallel Adaptive Threshold Accepting,\u201d in Proceedings of the 1992 European Workshop on Parallel Computing, Barcelona, pp. 176\u2013179. IOS Press, 1992."},{"key":"89_CR4","doi-asserted-by":"crossref","unstructured":"B. Freisleben and P. Merz, \u201cA Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems,\u201d in Proc. 1996 IEEE Int. Conf. on Evolutionary Computation, Nagoya, Japan, pp. 616\u2013621, 1996.","DOI":"10.1109\/ICEC.1996.542671"},{"key":"89_CR5","unstructured":"D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989."},{"key":"89_CR6","unstructured":"M. Gorges-Schleuter, \u201cASPARAGOS: An Asynchronous Parallel Genetic Optimization Strategy,\u201d in Proc. of the 3rd Int. Conf. on Genetic Algorithms, Morgan Kaufmann, 1989."},{"key":"89_CR7","doi-asserted-by":"crossref","unstructured":"M. Gorges-Schleuter, \u201cExplicit Parallelism of Genetic Algorithms through Population Structures,\u201d in Parallel Problem Solving from Nature, (H. Schwefel and R. M\u00e4nner, Eds.), pp. 150\u2013159, Springer-Verlag, 1991.","DOI":"10.1007\/BFb0029746"},{"key":"89_CR8","unstructured":"J. J. Grefenstette, \u201cIncorporating Problem Specific Knowledge into Genetic Algorithms,\u201d in Genetic Algorithms and Simulated Annealing, (L. Davis, ed.), pp. 42\u201360, Morgan Kaufmann, 1987."},{"key":"89_CR9","unstructured":"J. Grefenstette, R. Gopal, B. Rosimaita, and D. van Gucht, \u201c Genetic Algorithms for the Traveling Salesman Problem,\u201d in Proc. of an Int. Conf. on Genetic Algorithms and their Applications, pp. 160\u2013168, 1985."},{"key":"89_CR10","unstructured":"L. Homaifar, C. Guan, and G. Liepins, \u201cA New Approach to the Traveling Salesman Problem by Genetic Algorithms,\u201d in Proc. of the 5th Int. Conf. on Genetic Algorithms, pp. 460\u2013466, Morgan Kaufmann, 1993."},{"key":"89_CR11","unstructured":"P. Jog, J. Y. Suh, and D. van Gucht, \u201cThe Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Travelling Salesman Problem,\u201d in Proc. of the 3rd Int. Conf. on Genetic Algorithms, pp. 110\u2013115, Morgan Kaufmann, 1989."},{"key":"89_CR12","unstructured":"D. S. Johnson, \u201cLocal Optimization and the Traveling Salesman Problem,\u201d in Annual Int. Colloquium on Automata, Languages and Programming, 1990."},{"key":"89_CR13","doi-asserted-by":"crossref","unstructured":"D. S. Johnson and L. A. McGeoch, \u201cThe Traveling Salesman Problem: A Case Study in Local Optimization,\u201d in (E. H. L. Aarts and J. K. Lenstra, eds.) Local Search in Combinatorial Optimization, Wiley & Sons, New York, to appear.","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"89_CR14","doi-asserted-by":"crossref","unstructured":"P. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications. Kluwer Academic Publ., 1987.","DOI":"10.1007\/978-94-015-7744-1"},{"key":"89_CR15","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E. L. Lawler","year":"1985","unstructured":"E. L. Lawler, J. K. Lenstra and D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley and Sons, New York, 1985."},{"key":"89_CR16","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"S. Lin, \u201cComputer Solutions of the Travelling Salesman Problem,\u201d Bell System Tech. Journal, Vol. 44, pp. 2245\u20132269, 1965.","journal-title":"Bell System Tech. Journal"},{"key":"89_CR17","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin and B. Kernighan, \u201cAn Effective Heuristic Algorithm for the Traveling Salesman Problem,\u201d Operations Research, Vol. 21, pp. 498\u2013516, 1973.","journal-title":"Operations Research"},{"key":"89_CR18","unstructured":"K. Mathias and D. Whitley, \u201cGenetic Operators, the Fitness Landscape and the Traveling Salesman Problem,\u201d in Parallel Problem Solving from Nature, (R. M\u00e4nner and B. Manderick, Eds.), pp. 219\u2013228, Elsevier, 1992."},{"key":"89_CR19","unstructured":"H. M\u00fchlenbein, \u201cParallel Genetic Algorithms, Population Genetics and Combinatorial Optimization,\u201d in Proc. of the 3rd Int. Conf. on Genetic Algorithms, (J. D. Schaffer, ed.), pp. 416\u2013421, Morgan Kaufmann, 1989."},{"key":"89_CR20","doi-asserted-by":"crossref","unstructured":"H. M\u00fchlenbein, \u201cEvolution in Time and Space \u2014 The Parallel Genetic Algorithm,\u201d in Foundations of Genetic Algorithms, (G. J. E. Rawlins, ed.), M. Kaufmann, 1991.","DOI":"10.1016\/B978-0-08-050684-5.50023-9"},{"key":"89_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","volume":"7","author":"H. M\u00fchlenbein","year":"1988","unstructured":"H. M\u00fchlenbein, M. Gorges-Schleuter, and O. Kr\u00e4mer, \u201cEvolution Algorithms in Combinatorial Optimization,\u201d Parallel Computing, Vol. 7, pp. 65\u201388, 1988.","journal-title":"Parallel Computing"},{"key":"89_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M. Padberg","year":"1987","unstructured":"M. Padberg and G. Rinaldi, \u201cOptimization of a 532-city Symmetric Traveling Salesman Problem by Branch & Cut,\u201d Operations Research Lett. 6, pp. 1\u20137, 1987.","journal-title":"Operations Research Lett."},{"issue":"No.4","key":"89_CR23","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"G. Reinelt, \u201cTSPLIB \u2014 A Traveling Salesman Problem Library,\u201d ORSA Journal on Computing, Vol. 3, No. 4, pp. 376\u2013384, 1991.","journal-title":"ORSA Journal on Computing"},{"key":"89_CR24","unstructured":"G. Reinelt, The Traveling Salesman: Computational Solutions for TSP Applications. Vol. 840 of Lecture Notes in Computer Science, Springer-Verlag, 1994."},{"key":"89_CR25","unstructured":"J. Y. Suh and D. van Gucht, \u201cIncorporating Heuristic Information into Genetic Search,\u201d in Proc. of the 2nd Int. Conf. on Genetic Algorithms, pp. 100\u2013107, Lawrence Erlbaum, 1987."},{"key":"89_CR26","doi-asserted-by":"crossref","unstructured":"A. Y. C. Tang and K. S. Leung, \u201cA Modified Edge Recombination Operator for the Travelling Salesman Problem,\u201d in Parallel Problem Solving from Nature, (H.-P. Schwefel and R. M\u00e4nner, Eds.), pp. 180\u2013188, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58484-6_262"},{"key":"89_CR27","doi-asserted-by":"crossref","unstructured":"N. L. J. Ulder, E. H. L. Aarts, H. J. Bandelt, P. J. M. van Laarhoven, and E. Pesch, \u201cGenetic Local Search Algorithms for the Traveling Salesman Problem,\u201d in Parallel Problem Solving from Nature, (H. P. Schwefel and R. M\u00e4nner, Eds.), pp. 109\u2013116, Springer-Verlag, 1991.","DOI":"10.1007\/BFb0029740"},{"key":"89_CR28","unstructured":"M. Wall, \u201cGALIB 2.3.2,\u201d http:\/\/lancet.mit.edu\/ga, 1995."},{"key":"89_CR29","unstructured":"D. Whitley, T. Starkweather, and D. Fuquay, \u201cScheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator,\u201d in Proc. of the 3rd Int. Conf. on Genetic Algorithms, pp. 133\u2013140, Morgan Kaufmann, 1989."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61723-X_1052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T20:22:13Z","timestamp":1555705333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61723-X_1052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617235","9783540706687"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-61723-x_1052","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}