{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:58:03Z","timestamp":1742979483015,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319529400"},{"type":"electronic","value":"9783319529417"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-52941-7_28","type":"book-chapter","created":{"date-parts":[[2017,2,22]],"date-time":"2017-02-22T04:42:27Z","timestamp":1487738547000},"page":"278-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Empirical Study of the Multi-fragment Tour Construction Algorithm for the Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Mehdi","family":"El Krari","sequence":"first","affiliation":[]},{"given":"Bela\u00efd","family":"Ahiod","sequence":"additional","affiliation":[]},{"given":"Bouazza","family":"El Benani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,23]]},"reference":[{"key":"28_CR1","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: Concorde: a code for solving traveling salesman problems (1999). \n                  http:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JJ Bentley","year":"1992","unstructured":"Bentley, J.J.: Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4(4), 387\u2013411 (1992)","journal-title":"ORSA J. Comput."},{"key":"28_CR3","unstructured":"Bentley, J.L.: Experiments on traveling salesman heuristics. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 91\u201399. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1990). \n                  http:\/\/dl.acm.org\/citation.cfm?id=320176.320186"},{"key":"28_CR4","unstructured":"Bor\u016fvka, O.: O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm (about a certain minimal problem) (in Czech, German summary) (1926)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Bull, J.M., Smith, L.A., Pottage, L., Freeman, R.: Benchmarking java against c and fortran for scientific applications. In: Proceedings of the 2001 Joint ACM-ISCOPE Conference on Java Grande, pp. 97\u2013105. ACM (2001)","DOI":"10.1145\/376656.376823"},{"issue":"6","key":"28_CR6","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958). \n                  http:\/\/dx.doi.org\/10.1287\/opre.6.6.791","journal-title":"Oper. Res."},{"key":"28_CR7","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified np-complete problems. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, STOC 1974, pp. 47\u201363, NY, USA (1974). \n                  http:\/\/doi.acm.org\/10.1145\/800119.803884"},{"key":"28_CR8","unstructured":"Grefenstette, J., Gopal, R., Rosmaita, B., Van Gucht, D.: Genetic algorithms for the traveling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms and their Applications, pp. 160\u2013168. Lawrence Erlbaum, New Jersey (1985)"},{"issue":"6","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR11","first-page":"215","volume":"1","author":"DS Johnson","year":"1997","unstructured":"Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: a case study in local optimization. Local Search Comb. Optim. 1, 215\u2013310 (1997)","journal-title":"Local Search Comb. Optim."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/0-306-48213-4_9","volume-title":"The Traveling Salesman Problem and its Variations","author":"DS Johnson","year":"2007","unstructured":"Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and its Variations, pp. 369\u2013443. Springer, Heidelberg (2007)"},{"issue":"8","key":"28_CR13","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/0305-0548(94)90016-7","volume":"21","author":"J Knox","year":"1994","unstructured":"Knox, J.: Tabu search performance on the symmetric traveling salesman problem. Comput. Oper. Res. 21(8), 867\u2013876 (1994)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"28_CR15","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"EL Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.R., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, vol. 3. Wiley, New York (1985)"},{"issue":"11","key":"28_CR16","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"28_CR17","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Techn. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Techn. J."},{"issue":"4","key":"28_CR18","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2013a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991). \n                  http:\/\/dx.doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J. Comput."},{"key":"28_CR19","volume-title":"The Traveling Salesman: Computational Solutions for TSP Applications","author":"G Reinelt","year":"1994","unstructured":"Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer, Heidelberg (1994)"},{"key":"28_CR20","unstructured":"Reinhelt, G.: \n                  \n                    \n                  \n                  $$\\{$$\n                TSPLIB\n                  \n                    \n                  \n                  $$\\}$$\n                : a library of sample instances for the TSP (and related problems) from various sources and of various types (2014). \n                  http:\/\/comopt.ifi.uniheidelberg.de\/software\/TSPLIB95"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the 16th International Conference on Hybrid Intelligent Systems (HIS 2016)"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-52941-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T13:59:01Z","timestamp":1558447141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-52941-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319529400","9783319529417"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-52941-7_28","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"his2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mirlabs.org\/his16\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}