{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:27:05Z","timestamp":1767857225874,"version":"3.49.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":["Future Generation Computer Systems"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1016\/0167-739x(94)00059-n","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:12:49Z","timestamp":1027620769000},"page":"175-182","source":"Crossref","is-referenced-by-count":43,"title":["A parallel 2-opt algorithm for the Traveling Salesman Problem"],"prefix":"10.1016","volume":"11","author":[{"given":"M.G.A.","family":"Verhoeven","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.H.L.","family":"Aarts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.C.J.","family":"Swinkels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-739X(94)00059-N_BIB1","article-title":"Deterministic and randomized local search","author":"Aarts","year":"1993"},{"key":"10.1016\/0167-739X(94)00059-N_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0167-8191(89)90106-3","article-title":"A distributed implementation of simulated annealing for the traveling salesman problem","volume":"10","author":"Allwright","year":"1989","journal-title":"parallel Comput."},{"key":"10.1016\/0167-739X(94)00059-N_BIB3","article-title":"Parallelization of heuristics for large traveling salesman problems (in german)","author":"Bachem","year":"1992"},{"key":"10.1016\/0167-739X(94)00059-N_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.5.1.2","article-title":"Reporting computational experiments with parallel algorithms","volume":"5","author":"Barr","year":"1993","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0167-739X(94)00059-N_BIB5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0167-6377(89)90037-0","article-title":"Large traveling salesman problems arising from experiments in x-ray crystallography","volume":"8","author":"Bland","year":"1989","journal-title":"Operat. Res. Letters"},{"key":"10.1016\/0167-739X(94)00059-N_BIB6","series-title":"Proc. Int. Conf. on Parallel Processing","first-page":"6","article-title":"The traveling salesman problem on a hypercubic mimd machine","author":"Felten","year":"1985"},{"key":"10.1016\/0167-739X(94)00059-N_BIB7","article-title":"A parallel tabu search algorithm for large traveling salesman problems","author":"Fiechter","year":"1990"},{"key":"10.1016\/0167-739X(94)00059-N_BIB8","author":"Garey","year":"1979"},{"key":"10.1016\/0167-739X(94)00059-N_BIB9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2014 part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0167-739X(94)00059-N_BIB10","series-title":"Proc. 17th Coll. on Automata, Languages, and Programming, LNCS 447","first-page":"446","article-title":"Local optimization and the traveling salesman problem","author":"Johnson","year":"1990"},{"key":"10.1016\/0167-739X(94)00059-N_BIB11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","article-title":"How easy is local search?","volume":"37","author":"Johnson","year":"1988","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0167-739X(94)00059-N_BIB12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0167-739X(94)00059-N_BIB13","author":"Lawler","year":"1985"},{"key":"10.1016\/0167-739X(94)00059-N_BIB14","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 Syst. Technical J."},{"key":"10.1016\/0167-739X(94)00059-N_BIB15","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operat. Res."},{"key":"10.1016\/0167-739X(94)00059-N_BIB16","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0167-739X(94)00059-N_BIB17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0141-9331(92)90038-U","article-title":"Parallel techniques for solving large scale travelling salesperson problems","volume":"16","author":"Ravikumar","year":"1992","journal-title":"Microprocessors and Microsystems"},{"key":"10.1016\/0167-739X(94)00059-N_BIB18","series-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993"},{"key":"10.1016\/0167-739X(94)00059-N_BIB19","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB: A traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0167-739X(94)00059-N_BIB20","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/ijoc.4.2.206","article-title":"Fast heuristics for large geometric traveling salesman problems","volume":"4","author":"Reinelt","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0167-739X(94)00059-N_BIB21","first-page":"16","article-title":"Short-circuiting the traveling salesman problem","volume":"6","author":"Sangalli","year":"1992","journal-title":"New Scientist"},{"key":"10.1016\/0167-739X(94)00059-N_BIB22","first-page":"543","article-title":"Parallel local search and the travelling salesman problem (extended abstract)","volume":"2","author":"Verhoeven","year":"1992"},{"key":"10.1016\/0167-739X(94)00059-N_BIB23","series-title":"Parallel local search and the traveling salesman problem","author":"Verhoeven","year":"1993"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X9400059N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X9400059N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T02:52:22Z","timestamp":1556074342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167739X9400059N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["0167739X9400059N"],"URL":"https:\/\/doi.org\/10.1016\/0167-739x(94)00059-n","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}