{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T15:14:30Z","timestamp":1674832470260},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T00:00:00Z","timestamp":1294272000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10898-010-9643-4","type":"journal-article","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T11:04:59Z","timestamp":1294225499000},"page":"515-540","source":"Crossref","is-referenced-by-count":8,"title":["Seeking global edges for traveling salesman problem in multi-start search"],"prefix":"10.1007","volume":"51","author":[{"given":"Weiqi","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,6]]},"reference":[{"key":"9643_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9780691187563","volume-title":"Local Search in Combinatorial Optimization","author":"E. Aarts","year":"2003","unstructured":"Aarts E., Lenstra J.K.: Local Search in Combinatorial Optimization. Princeton University Press, Princeton, New Jersey (2003)"},{"key":"9643_CR2","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D.L. Applegate","year":"2006","unstructured":"Applegate D.L., Bixby R.E., Chv\u00e1tal V., Cook W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"9643_CR3","doi-asserted-by":"crossref","unstructured":"Baum, E.B.: Towards practical \u2018neural\u2019 computation for combinatorial optimization problems. In: AIP Conference Proceedings 151 on Neural Networks for Computing, pp. 53\u201358. American Institute of Physics (1986)","DOI":"10.1063\/1.36219"},{"key":"9643_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K.D. Boese","year":"1994","unstructured":"Boese K.D., Kahng A.B., Muddu S.: A new adaptive multi-start technique for combinatorial global optimization. Oper. Res. Lett. 16, 101\u2013113 (1994)","journal-title":"Oper. Res. Lett."},{"key":"9643_CR5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W. Cook","year":"2003","unstructured":"Cook W., Seymour P.D.: Tour merging via branch decomposition. INFORMS J. Comput. 15, 233\u2013248 (2003)","journal-title":"INFORMS J. Comput."},{"key":"9643_CR6","unstructured":"Dorigo, M.: Optimization, Learning and Natural Algorithms. Ph.D. Thesis. Dip Elettronica e Informazione, Politecnico di Milano, Italy (1992)"},{"key":"9643_CR7","first-page":"11","volume-title":"New Ideas in Optimization","author":"M. Dorigo","year":"1999","unstructured":"Dorigo M., Di Caro G.: The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds) New Ideas in Optimization, pp. 11\u201332. McGraw-Hill, Boston (1999)"},{"issue":"1","key":"9643_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo M., Gambardella L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9643_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22199-0","volume-title":"Multicriteria Optimization","author":"E. Ehrgott","year":"2000","unstructured":"Ehrgott E.: Multicriteria Optimization. Springer, Berlin (2000)"},{"issue":"2","key":"9643_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo T.A., Resende M.G.C.: Greedy randomized adaptive search procedure. J. Glob. Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"9643_CR11","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent C., Glover F.: Improved constructive multi-start strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 11(2), 198\u2013204 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9643_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover F., Laguna M.: Tabu Search. Kluwer, Boston (1997)"},{"key":"9643_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4615-4567-5_1","volume-title":"Computing Tools for Modeling Optimization and Simulation","author":"F. Glover","year":"2000","unstructured":"Glover F.: Multi-start and strategic oscillation methods\u2014principles to exploit adaptive memory. In: Laguna, M., Gonzales-Velards, J.L. (eds) Computing Tools for Modeling Optimization and Simulation, pp. 1\u201325. Kluwer, Boston (2000)"},{"key":"9643_CR14","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/978-3-642-18965-4_20","volume-title":"Advances in Evolutionary Computing: Theory and Applications","author":"F. Glover","year":"2003","unstructured":"Glover F., Laguna M., Marti R.: Scatter search. In: Ghosh, A., Tsutsui, S. (eds) Advances in Evolutionary Computing: Theory and Applications, pp. 519\u2013537. Springer, Berlin (2003)"},{"key":"9643_CR15","doi-asserted-by":"crossref","unstructured":"Guntsch, M., Middendorf, M.: A population based approach for ACO. Applications of Evolutionary Computing, Lecture Notes in Computer Science, No2279, pp. 165\u2013180. Springer, Berlin (2002)","DOI":"10.1007\/3-540-46004-7_8"},{"issue":"7","key":"9643_CR16","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/43.644032","volume":"16","author":"L.W. Hagen","year":"1997","unstructured":"Hagen L.W., Kahng A.B.: Combining problem reduction and adaptive multi-start: a new technique for superior iterative partitioning. IEEE Trans. CAD 16(7), 709\u2013717 (1997)","journal-title":"IEEE Trans. CAD"},{"key":"9643_CR17","unstructured":"Hu, X., Shonkwiler, R., Spruill, M.C.: Random Restarts in Global Optimization. Research Report, The School of Mathematics, Georgia Institute of Technology, Atlanta (1994)"},{"key":"9643_CR18","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: Local optimization and the traveling salesman problem. In: Proceedings of the 17th International Colloquium on Automata, Languages and Programming, pp. 446\u2013460 (1990)","DOI":"10.1007\/BFb0032050"},{"key":"9643_CR19","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D.S. Johnson","year":"1997","unstructured":"Johnson D.S., McGeoch L.A.: The traveling salesman problem: a case study. In: Aarts, E., Lenstra, J.K. (eds) Local Search in Combinatorial Optimization, pp. 215\u2013310. John Wiley & Sons, Chichester (1997)"},{"key":"9643_CR20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0022-5193(87)80029-2","volume":"128","author":"S. Kauffman","year":"1987","unstructured":"Kauffman S., Levin S.: Toward a general theory of adaptive walks on rugged landscapes. J. Theor. Biol. 128, 11\u201345 (1987)","journal-title":"J. Theor. Biol."},{"issue":"6","key":"9643_CR21","doi-asserted-by":"crossref","first-page":"3403","DOI":"10.1103\/PhysRevA.45.3403","volume":"45","author":"M.B. Kennel","year":"1992","unstructured":"Kennel M.B., Brown R., Abarbanel H.D.I.: Determining embedding dimension for phase-space reconstruction using a geometrical construction. Phys. Rev. A 45(6), 3403\u20133411 (1992)","journal-title":"Phys. Rev. A"},{"key":"9643_CR22","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1051\/jphys:019850046080127700","volume":"46","author":"S. Kirkpatrick","year":"1985","unstructured":"Kirkpatrick S., Toulouse G.: Configuration space analysis of traveling salesman problems. J. Phys. 46, 1277\u20131292 (1985)","journal-title":"J. Phys."},{"key":"9643_CR23","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2007","unstructured":"Korte B., Vygen J.: Combinatorial Optimization: Theory and Algorithms. Springer, New York (2007)"},{"issue":"1","key":"9643_CR24","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna M., Mart\u00ed R.: GRASP and path relinking for a 2-layer straight line crossing minimization. INFORMS J. Comput. 11(1), 44\u201352 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9643_CR25","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.cie.2006.08.002","volume":"51","author":"G. Lan","year":"2006","unstructured":"Lan G., De Puy G.W.: On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Comput. Ind. Eng. 51, 362\u2013374 (2006)","journal-title":"Comput. Ind. Eng."},{"issue":"5\/6","key":"9643_CR26","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10732-005-3604-y","volume":"11","author":"W. Li","year":"2005","unstructured":"Li W.: Dynamics of local search trajectory in traveling salesman problem. J. Heuristics 11(5\/6), 507\u2013542 (2005)","journal-title":"J. Heuristics"},{"key":"9643_CR27","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.: Computer solution of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"key":"9643_CR28","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin S., Kernighan B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"issue":"2","key":"9643_CR29","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/S0377-2217(00)00325-8","volume":"135","author":"R. Mart\u00ed","year":"2001","unstructured":"Mart\u00ed R., Laguna M., Glover F., Campos V.: Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. 135(2), 450\u2013459 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9643_CR30","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/0-306-48056-5_12","volume-title":"Handbook of Metaheuristics","author":"R. Mart\u00ed","year":"2003","unstructured":"Mart\u00ed R.: Multi-start methods. In: Glover, F., Kochenberger, G. (eds) Handbook of Metaheuristics, pp. 355\u2013368. Springer, Berlin (2003)"},{"key":"9643_CR31","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-1-4419-1665-5_9","volume-title":"Handbook of Metaheuristics","author":"R. Mart\u00ed","year":"2010","unstructured":"Mart\u00ed R., Moreno-Vega J.M., Duarte A.: Advanced multi-start methods. In: Gendreau, M, Potvin J.Y., (eds) Handbook of Metaheuristics, pp. 265\u2013281. Springer, Berlin (2010)"},{"key":"9643_CR32","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/BFb0056918","volume-title":"Parallel Problem Solving from Nature - PPSN V, LNCS 1498","author":"P. Merz","year":"1998","unstructured":"Merz P., Freisleben B.: Memetic algorithms and the fitness landscape of the graph bi-partitioning problem. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.P. (eds) Parallel Problem Solving from Nature - PPSN V, LNCS 1498, pp. 765\u2013774. Springer, Berlin (1998)"},{"key":"9643_CR33","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1051\/jphys:019860047080128500","volume":"47","author":"M. Mezard","year":"1986","unstructured":"Mezard M., Parisi G.: A replica analysis of the traveling salesman problem. J. Phys. 47, 1285\u20131296 (1986)","journal-title":"J. Phys."},{"key":"9643_CR34","doi-asserted-by":"crossref","unstructured":"Mezmaz, M., Melab, N., Talbi, E.-G.: Using the multi-start and island models for parallel multi-objective optimization on the computational grid. In: Proceedings of the Second IEEE International Conference on e-science and Grid Computing, p. 112 (2006)","DOI":"10.1109\/E-SCIENCE.2006.261196"},{"key":"9643_CR35","volume-title":"Nonlinear Multiobjective Optimization","author":"K.M. Miettinen","year":"1999","unstructured":"Miettinen K.M.: Nonlinear Multiobjective Optimization. Kluwer, Dordrecht, Netherlands (1999)"},{"key":"9643_CR36","first-page":"219","volume-title":"New Ideas in Optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato P.: Memetic algorithms. In: Corne, D., Dorigo, M., Glover, F. (eds) New Ideas in Optimization, pp. 219\u2013235. McGraw Hill, New York (1999)"},{"key":"9643_CR37","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"Padberg M., Rinaldi G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33, 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"key":"9643_CR38","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou C.H., Steiglitz K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, New York (1998)"},{"key":"9643_CR39","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1009629727566","volume":"5","author":"R. Patterson","year":"1999","unstructured":"Patterson R., Pirkul H., Rolland E.: Adaptive reasoning technique for the capacitated minimum spanning tree problem. J. Heuristics 5, 159\u2013180 (1999)","journal-title":"J. Heuristics"},{"key":"9643_CR40","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/3-540-45712-7_20","volume-title":"Parallel Problem Solving from Nature - PPSN VII, LNCS2439","author":"G.R. Raidl","year":"2002","unstructured":"Raidl G.R., Kogydek G., Julstrom B.A.: On weight-biased mutation for graph problems. In: Merelo-Guerv\u00f3s, J.J., Adamidis, P., Beyer, H.G., Fern\u00e1andez-Villaca\u0148as, J.L., Schwefel, H.P. (eds) Parallel Problem Solving from Nature - PPSN VII, LNCS2439, pp. 204\u2013213. Springer, Berlin (2002)"},{"key":"9643_CR41","doi-asserted-by":"crossref","unstructured":"Reinelt, G.: TSPLIB, a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991) The library of TSP problem instances is accessible on the Web at. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/","DOI":"10.1287\/ijoc.3.4.376"},{"key":"9643_CR42","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1023\/A:1018983524911","volume":"86","author":"C.R. Reeves","year":"1998","unstructured":"Reeves C.R.: Landscapes, operators and heuristic search. Ann. Oper. Res. 86, 473\u2013490 (1998)","journal-title":"Ann. Oper. Res."},{"key":"9643_CR43","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C., Mart, R., Gallego, M., Duarte, A.: GRASP and path relinking for the max-\u00a0min diversity problem. Comput. Oper. Res. (To Appear) (2009)","DOI":"10.1016\/j.cor.2008.05.011"},{"key":"9643_CR44","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/moor.6.1.19","volume":"6","author":"F. Solis","year":"1981","unstructured":"Solis F., Wets R.: Minimization by random search techniques. Math. Oper. Res. 6, 19\u201330 (1981)","journal-title":"Math. Oper. Res."},{"key":"9643_CR45","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1209\/0295-5075\/2\/12\/006","volume":"2","author":"N. Sourlas","year":"1986","unstructured":"Sourlas N.: Statistical mechanics and the traveling salesman problem. Europhys. Lett. 2, 919\u2013923 (1986)","journal-title":"Europhys. Lett."},{"issue":"9","key":"9643_CR46","doi-asserted-by":"crossref","first-page":"2253","DOI":"10.1002\/nme.401","volume":"53","author":"W. Tu","year":"2002","unstructured":"Tu W., Mayne R.W.: An approach to multi-start clustering for global optimization with non-linear constraints. Int. J. Numer. Methods Eng. 53(9), 2253\u20132269 (2002)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"9643_CR47","first-page":"109","volume-title":"Parallel Problem Solving from Nature","author":"N.L.J. Ulder","year":"1990","unstructured":"Ulder N.L.J., Aarts E.H.L., Bandelt H.J., Van Laarhoven P.J.M., Pesch E.: Genetic local search algorithms for the traveling salesman problem. In: Schwefel, H.-P., M\u00e4nner, R. (eds) Parallel Problem Solving from Nature, pp. 109\u2013116. Springer, Berlin (1990)"},{"issue":"4","key":"9643_CR48","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0305-0548(98)00070-7","volume":"26","author":"E.S. Vander Poort","year":"1999","unstructured":"Vander Poort E.S., Libura M., Sierksma G., van der Veen J.A.A.: Solving the k-best traveling salesman problem. Comput. Oper. Res. 26(4), 409\u2013425 (1999)","journal-title":"Comput. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9643-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9643-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9643-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T15:54:36Z","timestamp":1559922876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9643-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,6]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9643"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9643-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,6]]}}}