{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:47:55Z","timestamp":1743058075049,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030878689"},{"type":"electronic","value":"9783030878696"}],"license":[{"start":{"date-parts":[[2021,9,23]],"date-time":"2021-09-23T00:00:00Z","timestamp":1632355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,23]],"date-time":"2021-09-23T00:00:00Z","timestamp":1632355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-87869-6_71","type":"book-chapter","created":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T07:10:31Z","timestamp":1632294631000},"page":"751-757","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Tabu Search Algorithm for the Cyclic Inspection Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1868-8603","authenticated-orcid":false,"given":"Wojciech","family":"Bo\u017cejko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4113-8378","authenticated-orcid":false,"given":"Rados\u0142aw","family":"Grymin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0614-0085","authenticated-orcid":false,"given":"Jaros\u0142aw","family":"Pempera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8188-4503","authenticated-orcid":false,"given":"Mieczys\u0142aw","family":"Wodecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,23]]},"reference":[{"issue":"3","key":"71_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"EM Arkin","year":"1994","unstructured":"Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55(3), 197\u2013218 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"71_CR2","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/ijoc.2013.0574","volume":"26","author":"B Behdani","year":"2014","unstructured":"Behdani, B., Smith, J.C.: An integer-programming-based approach to the close-enough traveling salesman problem. INFORMS J. Comput. 26(3), 415\u2013432 (2014)","journal-title":"INFORMS J. Comput."},{"key":"71_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.cor.2016.09.003","volume":"78","author":"F Carrabs","year":"2017","unstructured":"Carrabs, F., Cerrone, C., Cerulli, R., Gaudioso, M.: A novel discretization scheme for the close enough traveling salesman problem. Comput. Oper. Res. 78, 163\u2013171 (2017)","journal-title":"Comput. Oper. Res."},{"key":"71_CR4","doi-asserted-by":"crossref","unstructured":"Coutinho, W.P., Nascimento, R.Q.d., Pessoa, A.A., Subramanian, A.: A branch-and-bound algorithm for the close-enough traveling salesman problem. INFORMS J. Comput. 28(4), 752\u2013765 (2016)","DOI":"10.1287\/ijoc.2016.0711"},{"issue":"1","key":"71_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0196-6774(03)00047-6","volume":"48","author":"A Dumitrescu","year":"2003","unstructured":"Dumitrescu, A., Mitchell, J.S.: Approximation algorithms for tsp with neighborhoods in the plane. J. Algorithms 48(1), 135\u2013159 (2003)","journal-title":"J. Algorithms"},{"issue":"5","key":"71_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"71_CR7","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2013part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"71_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search\u2013part II. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"key":"71_CR9","doi-asserted-by":"crossref","unstructured":"Mata, C.S., Mitchell, J.S.: Approximation algorithms for geometric tour and network design problems. In: Symposium on Computational Geometry, pp. 360\u2013369. Citeseer (1995)","DOI":"10.1145\/220279.220318"},{"key":"71_CR10","doi-asserted-by":"crossref","unstructured":"Mennell, W., Golden, B., Wasil, E.: A Steiner-zone heuristic for solving the close-enough traveling salesman problem. In: 2th INFORMS Computing Society Conference: Operations Research, Computing, and Homeland Defense (2011)","DOI":"10.1287\/ics.2011.0004"},{"key":"71_CR11","unstructured":"Mennell, W.K.: Heuristics for solving three routing problems: close-enough traveling salesman problem, close-enough vehicle routing problem, sequence-dependent team orienteering problem. Ph.D. thesis (2009)"},{"issue":"4","key":"71_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/net.21818","volume":"72","author":"A Otto","year":"2018","unstructured":"Otto, A., Agatz, N., Campbell, J., Golden, B., Pesch, E.: Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: a survey. Networks 72(4), 411\u2013458 (2018)","journal-title":"Networks"},{"issue":"2","key":"71_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1093\/comjnl\/7.2.155","volume":"7","author":"MJ Powell","year":"1964","unstructured":"Powell, M.J.: An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput. J. 7(2), 155\u2013162 (1964)","journal-title":"Comput. J."},{"key":"71_CR14","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes (any edition). Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"71_CR15","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MWC.2009.4804365","volume":"16","author":"O Tekdas","year":"2009","unstructured":"Tekdas, O., Isler, V., Lim, J.H., Terzis, A.: Using mobile robots to harvest data from sensor fields. IEEE Wirel. Commun. 16(1), 22\u201328 (2009)","journal-title":"IEEE Wirel. Commun."},{"issue":"1","key":"71_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ejor.2017.07.024","volume":"265","author":"Z Yang","year":"2018","unstructured":"Yang, Z., et al.: A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods. Eur. J. Oper. Res. 265(1), 65\u201380 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"71_CR17","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1109\/TKDE.2007.1062","volume":"19","author":"B Yuan","year":"2007","unstructured":"Yuan, B., Orlowska, M., Sadiq, S.: On the optimal robot routing problem in wireless sensor networks. IEEE Trans. Knowl. Data Eng. 19(9), 1252\u20131261 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Advances in Intelligent Systems and Computing","16th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2021)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87869-6_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T07:27:54Z","timestamp":1632295674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87869-6_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,23]]},"ISBN":["9783030878689","9783030878696"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87869-6_71","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2021,9,23]]},"assertion":[{"value":"23 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Soft Computing Models in Industrial and Environmental Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"socomoin2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.sococonference.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}