{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T20:16:49Z","timestamp":1770149809166,"version":"3.49.0"},"reference-count":38,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0377-2217(97)00142-2","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"571-584","source":"Crossref","is-referenced-by-count":71,"title":["An efficient composite heuristic for the symmetric generalized traveling salesman problem"],"prefix":"10.1016","volume":"108","author":[{"given":"Jacques","family":"Renaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fayez F.","family":"Boctor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00142-2_bib1","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","article-title":"The prize collecting traveling salesman problem","volume":"19","author":"Balas","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00142-2_bib2","series-title":"ROLL-A-ROUND: Software package for scheduling the rounds of a rolling mill","author":"Balas","year":"1985"},{"key":"10.1016\/S0377-2217(97)00142-2_bib3","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230110210","article-title":"The design and analysis of heuristics","volume":"11","author":"Ball","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00142-2_bib4","series-title":"Working paper 93-37","article-title":"A tour improvement procedure for the traveling salesman problem","author":"Boctor","year":"1993"},{"key":"10.1016\/S0377-2217(97)00142-2_bib5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","article-title":"The clustered traveling salesman problem","volume":"2","author":"Chisman","year":"1975","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00142-2_bib6","series-title":"Proceedings of the Fourth International Conference on Operations Research","first-page":"81","article-title":"A heuristic approach to some sales territory problems","author":"Cloonan","year":"1966"},{"issue":"3","key":"10.1016\/S0377-2217(97)00142-2_bib7","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.23.3.208","article-title":"The covering salesman problem","volume":"23","author":"Current","year":"1989","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/S0377-2217(97)00142-2_bib8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","article-title":"The median tour and maximal covering tour problems: Formulations and heuristics","volume":"73","author":"Current","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00142-2_bib9","series-title":"Working paper","article-title":"A branch-and-cut algorithm for the symmetric generalized traveling salesman problem","author":"Fischetti","year":"1994"},{"key":"10.1016\/S0377-2217(97)00142-2_bib10","series-title":"Vehicle Routing: Methods and Studies","first-page":"319","article-title":"An additive approach for the optimal solution of the prize-collecting traveling salesman problem","author":"Fischetti","year":"1988"},{"key":"10.1016\/S0377-2217(97)00142-2_bib11","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(97)00142-2_bib12","series-title":"Working paper CRT-94-54","article-title":"Heuristics for the clustered traveling salesman problem","author":"Gendreau","year":"1994"},{"key":"10.1016\/S0377-2217(97)00142-2_bib13","series-title":"Working paper CRT-95-08","article-title":"The covering tour problem","author":"Gendreau","year":"1995"},{"issue":"4","key":"10.1016\/S0377-2217(97)00142-2_bib14","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1080\/05695557808975227","article-title":"An industrial application of the traveling salesman's sub-tour problem","volume":"10","author":"Gensch","year":"1978","journal-title":"AIIE Transactions"},{"issue":"4","key":"10.1016\/S0377-2217(97)00142-2_bib15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0305-0483(81)90087-6","article-title":"Two generalizations of the traveling salesman problem","volume":"9","author":"Golden","year":"1981","journal-title":"Omega"},{"issue":"3","key":"10.1016\/S0377-2217(97)00142-2_bib16","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","article-title":"The orienteering problem","volume":"34","author":"Golden","year":"1987","journal-title":"Naval Research Logistics"},{"issue":"3","key":"10.1016\/S0377-2217(97)00142-2_bib17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO;2-H","article-title":"A multifaceted heuristic for the orienteering problem","volume":"35","author":"Golden","year":"1989","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(97)00142-2_bib18","first-page":"43","article-title":"The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem","volume":"B2","author":"Henry-Labordere","year":"1969","journal-title":"RAIRO"},{"key":"10.1016\/S0377-2217(97)00142-2_bib19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(85)90309-1","article-title":"The symmetric clustered traveling salesman problem","volume":"19","author":"Jongens","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00142-2_bib20","article-title":"Multiobjective routing through space and time: The MVP and TDVP problems","author":"Keller","year":"1985"},{"key":"10.1016\/S0377-2217(97)00142-2_bib21","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(89)90388-3","article-title":"Algorithms to solve the orienteering problem: A comparison","volume":"41","author":"Keller","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00142-2_bib22","series-title":"Working paper CRT-95-59","article-title":"Some applications of the generalized traveling salesman problem","author":"Laporte","year":"1995"},{"issue":"3","key":"10.1016\/S0377-2217(97)00142-2_bib23","first-page":"203","article-title":"Optimal tour planning with specified nodes","volume":"18","author":"Laporte","year":"1984","journal-title":"RAIRO Recherche Op\u00e9rationnelle"},{"key":"10.1016\/S0377-2217(97)00142-2_bib24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(87)90020-5","article-title":"Generalized traveling salesman problem through n sets of nodes: The asymmetric case","volume":"18","author":"Laporte","year":"1987","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/S0377-2217(97)00142-2_bib25","first-page":"61","article-title":"Generalized traveling salesman problem through n sets of nodes: An integer programming approach","volume":"21","author":"Laporte","year":"1983","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(97)00142-2_bib26","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell Systems Computer Journal"},{"key":"10.1016\/S0377-2217(97)00142-2_bib27","article-title":"The generalized traveling salesman problem","author":"Noon","year":"1988"},{"issue":"4","key":"10.1016\/S0377-2217(97)00142-2_bib28","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1287\/opre.39.4.623","article-title":"A lagrangian based approach for the asymmetric generalized traveling salesman problem","volume":"39","author":"Noon","year":"1991","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(97)00142-2_bib29","first-page":"39","article-title":"An efficient transformation of the generalized traveling salesman problem","volume":"31","author":"Noon","year":"1993","journal-title":"INFOR"},{"issue":"2","key":"10.1016\/S0377-2217(97)00142-2_bib30","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0305-0548(91)90086-7","article-title":"An efficient four-phase heuristic for the generalized orienteering problem","volume":"18","author":"Ramesh","year":"1991","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(97)00142-2_bib31","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1287\/ijoc.4.2.155","article-title":"An optimal algorithm for the orienteering tour problem","volume":"4","author":"Ramesh","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00142-2_bib32","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB \u2014 A traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"10.1016\/S0377-2217(97)00142-2_bib33","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.8.2.134","article-title":"A fast composite heuristic for the symmetric traveling salesman problem","volume":"8","author":"Renaud","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00142-2_bib34","first-page":"185","article-title":"Mathematical model of scheduling clients through welfare agencies","volume":"8","author":"Saksena","year":"1970","journal-title":"CORS Journal"},{"key":"10.1016\/S0377-2217(97)00142-2_bib35","article-title":"The symmetric generalized traveling salesman problem","author":"Sepehri","year":"1991"},{"key":"10.1016\/S0377-2217(97)00142-2_bib36","first-page":"97","article-title":"Generalized traveling salesman problem through n sets of nodes","volume":"7","author":"Srivastava","year":"1969","journal-title":"CORS Journal"},{"issue":"9","key":"10.1016\/S0377-2217(97)00142-2_bib37","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","article-title":"Heuristic methods applied to orienteering","volume":"35","author":"Tsiligirides","year":"1984","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00142-2_bib38","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1057\/jors.1987.177","article-title":"On some generalizations of the traveling salesman problem","volume":"38","author":"Volgenant","year":"1987","journal-title":"Journal of the Operational Research Society"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797001422?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797001422?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T08:57:19Z","timestamp":1556096239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797001422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0377221797001422"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00142-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}