{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T13:03:25Z","timestamp":1774357405068,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bf00127356","type":"journal-article","created":{"date-parts":[[2004,11,4]],"date-time":"2004-11-04T04:27:34Z","timestamp":1099542454000},"page":"187-200","source":"Crossref","is-referenced-by-count":37,"title":["A tabu search heuristic using genetic diversification for the clustered traveling salesman problem"],"prefix":"10.1007","volume":"2","author":[{"given":"Gilbert","family":"Laporte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Yves","family":"Potvin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florence","family":"Quilleret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BFb0029743","volume-title":"Parallel Problem-Solving from Nature","author":"H. Braun","year":"1991","unstructured":"Braun, H. (1991). ?On Solving Travelling Salesman Problems by Genetic Algorithms.? In H. P.Schwefel and R.Manner (eds.),Parallel Problem-Solving from Nature,Lecture Notes in Computer Science 496, pp. 129?133, Berlin: Springer-Verlag."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","volume":"2","author":"J. A. Chisman","year":"1975","unstructured":"Chisman, J. A. (1975). ?The Clustered Traveling Salesman Problem,?Computers & Operations Research 2, 115?119.","journal-title":"Computers & Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G. Croes","year":"1958","unstructured":"Croes, G. (1958). ?A Method for Solving Traveling Salesman Problems,?Operations Research 6, 791?812.","journal-title":"Operations Research"},{"key":"CR4","unstructured":"Duhamel, C., J. Y. Potvin, and J. M. Rousseau. (1994). ?A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows,? Technical Report CRT-94-51, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"Gendreau, M., A.Hertz, and G.Laporte. (1992). ?New Insertion and Postoptimization Procedures for the Traveling Salesman Problem,?Operations Research 40, 1086?1094.","journal-title":"Operations Research"},{"key":"CR6","unstructured":"Gendreau, M., G. Laporte, and J. Y. Potvin. (1994). ?Heuristics for the Clustered Traveling Salesman Problem? Technical Report CRT-94-54, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al. Forthcoming inCombinatorial Optimization."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"5","author":"F. Glover","year":"1986","unstructured":"Glover, F. (1986). ?Future Paths for Integer Programming and Links to Artificial Intelligence,?Computers & Operations Research 5, 533?549.","journal-title":"Computers & Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). ?Tabu Search?Part I,?ORSA Journal on Computing 1, 190?206.","journal-title":"ORSA Journal on Computing"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). ?Tabu Search?Part II,?ORSA Journal on Computing 2, 4?32.","journal-title":"ORSA Journal on Computing"},{"key":"CR10","volume-title":"Tabu Search Fundamentals and Uses","author":"F. Glover","year":"1995","unstructured":"Glover, F. (1995). ?Tabu Search Fundamentals and Uses,? Working Paper, Graduate School of Business, University of Colorado, Boulder."},{"key":"CR11","volume-title":"Tabu Search and Adaptive Memory Programming: Advances, Applications and Challenges","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). ?Tabu Search and Adaptive Memory Programming: Advances, Applications and Challenges,? Working Paper, Graduate School of Business, University of Colorado, Boulder."},{"key":"CR12","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. E. Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989).Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison Wesley."},{"key":"CR13","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. H. Holland","year":"1975","unstructured":"Holland, J. H. (1975).Adaptation in Natural and Artificial Systems. Ann Arbor: The University of Michigan Press."},{"key":"CR14","volume-title":"Local Search in Combinatorial Optimization","author":"D. S. Johnson","year":"1996","unstructured":"Johnson, D. S., and L. A.McGeoch. (1996). ?The Traveling Salesman Problem: A Case Study in Local Optimization.? Forthcoming in J. K.Lenstra and E. H. L.Aarts (eds.),Local Search in Combinatorial Optimization. New York: Wiley."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(85)90309-1","volume":"19","author":"K. Jongens","year":"1985","unstructured":"Jongens, K., and T.Volgenant. (1985). ?The Symmetric Clustered Traveling Salesman Problem,?European Journal of Operational Research 19, 68?75.","journal-title":"European Journal of Operational Research"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G. (1992). ?The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms,?European Journal of Operational Research 59, 231?247.","journal-title":"European Journal of Operational Research"},{"key":"CR17","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E. L. Lawler","year":"1985","unstructured":"Lawler, E. L., J. K.Lenstra, A. H. G.Rinnooy Kan and D. B.Shmoys. (1985).The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Chichester: Wiley."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S. (1965). ?Computer Solutions of the Traveling Salesman Problem,?Bell System Technical Journal 44, 2245?2269.","journal-title":"Bell System Technical Journal"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0377-2217(79)90099-7","volume":"3","author":"F. C. J. Lokin","year":"1978","unstructured":"Lokin, F. C. J. (1978). ?Procedures for Traveling Salesman Problems with Additional Constraints,?European Journal of Operational Research 3, 135?141.","journal-title":"European Journal of Operational Research"},{"key":"CR20","unstructured":"Potvin, J. Y., and F. Guertin. (1995). ?A Genetic Algorithm for the Clustered Traveling Salesman Problem with an A Priori Order on the Clusters?, Technical Report CRT-95-06, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/978-1-4613-1361-8_37","volume-title":"Meta-heuristics: Theory and Applications","author":"J. Y. Potvin","year":"1996","unstructured":"Potvin, J. Y., and F.Guertin. (1996). ?The Clustered Traveling Salesman Problem: A Genetic Approach.? In I. H.Osman and J. P.Kelly (eds.),Meta-heuristics: Theory and Applications, pp. 619?632. Boston: Kluwer."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.8.2.134","volume":"8","author":"J. Renaud","year":"1996","unstructured":"Renaud, J., F. F.Boctor, and G.Laporte. (1996). ?A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem,?INFORMS Journal on Computing 8, 134?143.","journal-title":"INFORMS Journal on Computing"},{"key":"CR23","unstructured":"Suh, J. Y., and D. V. Gucht. (1987). ?Incorporating Heuristic Information into Genetic Search?. InProceedings of the Second Int. Conf. on Genetic Algorithms, pp. 100?107. Cambridge, MA."},{"key":"CR24","unstructured":"Syswerda, G. (1989). ?Uniform Crossover in Genetic Algorithms?. InProceedings of the Third Int. Conf. on Genetic Algorithms, 2?9. Fairfax, VA."},{"key":"CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BFb0029740","volume-title":"Parallel Problem-Solving from Nature","author":"N. L. J. Ulder","year":"1991","unstructured":"Ulder, N. L. J., E. H. L.Aarts, H. J.Bandelt, P. J. M.VanLaarhoven, and E.Pesch. (1991). ?Genetic Local Search Algorithms for the Traveling Salesman Problem.? In H. P.Schwefel and R.Manner (eds.),Parallel Problem-Solving from Nature,Lecture Notes in Computer Science 496, pp. 109?116. Berlin: Springer-Verlag."},{"key":"CR26","unstructured":"Whitley, D., T. Starkweather, and D. Fuquay. (1989). ?Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator?. InProceedings of the Third Int. Conf. on Genetic Algorithms, pp. 133?140. Fairfax, VA."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00127356.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00127356\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00127356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T00:49:08Z","timestamp":1554252548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00127356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997]]}},"alternative-id":["BF00127356"],"URL":"https:\/\/doi.org\/10.1007\/bf00127356","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}