{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:11:41Z","timestamp":1742933501430,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031312670"},{"type":"electronic","value":"9783031312687"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-31268-7_3","type":"book-chapter","created":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T22:52:33Z","timestamp":1682895153000},"page":"44-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Metaheuristic Approach for\u00a0Inspection and\u00a0Reconnaissance of\u00a0Organized Areas"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7380-8495","authenticated-orcid":false,"given":"David","family":"Zahradka","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3404-8742","authenticated-orcid":false,"given":"Jan","family":"Mikula","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0997-5889","authenticated-orcid":false,"given":"Miroslav","family":"Kulich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.endm.2017.03.030","volume":"58","author":"M Amous","year":"2017","unstructured":"Amous, M., Toumi, S., Jarboui, B., Eddaly, M.: A variable neighborhood search algorithm for the capacitated vehicle routing problem. Electron. Notes Discret. Math. 58, 231\u2013238 (2017)","journal-title":"Electron. Notes Discret. Math."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Cabreira, T.M., Brisolara, L.B., Paulo R, F.J.: Survey on coverage path planning with unmanned aerial vehicles. Drones 3(1), 4 (2019)","DOI":"10.3390\/drones3010004"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao, I.M., Golden, B.L., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464\u2013474 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Coombes, M., Chen, W.H., Liu, C.: Boustrophedon coverage path planning for UAV aerial surveys in wind. In: 2017 International Conference on Unmanned Aircraft Systems (ICUAS), pp. 1563\u20131571. IEEE (2017)","DOI":"10.1109\/ICUAS.2017.7991469"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Corber\u00e1n, \u00c1., Laporte, G.: Arc Routing: Problems, Methods, and Applications. SIAM (2015)","DOI":"10.1137\/1.9781611973679"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-07124-4_9","volume-title":"Handbook of Heuristics","author":"A Duarte","year":"2018","unstructured":"Duarte, A., S\u00e1nchez-Oro, J., Mladenovi\u0107, N., Todosijevi\u0107, R.: Variable neighborhood descent. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 341\u2013367. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_9"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part ii: the rural postman problem. Oper. Res. 43(3), 399\u2013414 (1995)","journal-title":"Oper. Res."},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"issue":"5","key":"3_CR9","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1016\/j.dam.2005.05.020","volume":"154","author":"P Hansen","year":"2006","unstructured":"Hansen, P., Mladenovi\u0107, N.: First vs. best improvement: an empirical study. Discret. Appl. Math. 154(5), 802\u2013817 (2006)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"3_CR10","first-page":"61","volume":"21","author":"G Laporte","year":"1983","unstructured":"Laporte, G., Nobert, Y.: Generalized travelling salesman problem through n sets of nodes: an integer programming approach. INFOR: Inf. Syst. Oper. Res. 21(1), 61\u201375 (1983)","journal-title":"INFOR: Inf. Syst. Oper. Res."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.trpro.2016.02.007","volume":"12","author":"J Lin","year":"2016","unstructured":"Lin, J., Zhou, W., Wolfson, O.: Electric vehicle routing problem. Transp. Res. Procedia 12, 508\u2013521 (2016)","journal-title":"Transp. Res. Procedia"},{"issue":"8","key":"3_CR12","doi-asserted-by":"publisher","first-page":"6807","DOI":"10.1016\/j.eswa.2012.01.015","volume":"39","author":"Y Marinakis","year":"2012","unstructured":"Marinakis, Y.: Multiple phase neighborhood search-grasp for the capacitated vehicle routing problem. Expert Syst. Appl. 39(8), 6807\u20136815 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"11","key":"3_CR13","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":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"6196","DOI":"10.1109\/LRA.2021.3091695","volume":"6","author":"F Nekov\u00e1\u0159","year":"2021","unstructured":"Nekov\u00e1\u0159, F., Faigl, J., Saska, M.: Multi-tour set traveling salesman problem in planning power transmission line inspection. IEEE Robot. Autom. Lett. 6(4), 6196\u20136203 (2021)","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0925-7721(92)90014-J","volume":"1","author":"S Ntafos","year":"1992","unstructured":"Ntafos, S.: Watchman routes under limited visibility. Comput. Geom. 1(3), 149\u2013170 (1992)","journal-title":"Comput. Geom."},{"key":"3_CR16","unstructured":"OpenStreetMap contributors: Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org (2017)"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1109\/LRA.2017.2666261","volume":"2","author":"R P\u011bni\u010dka","year":"2017","unstructured":"P\u011bni\u010dka, R., Faigl, J., V\u00e1\u0148a, P., Saska, M.: Dubins orienteering problem. IEEE Robot. Autom. Lett. 2(2), 1210\u20131217 (2017)","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"TK Ralphs","year":"2003","unstructured":"Ralphs, T.K., Kopman, L., Pulleyblank, W.R., Trotter, L.E.: On the capacitated vehicle routing problem. Math. Program. 94(2), 343\u2013359 (2003)","journal-title":"Math. Program."},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-030-14984-0_38","volume-title":"Modelling and Simulation for Autonomous Systems","author":"P Stodola","year":"2019","unstructured":"Stodola, P., Koz\u016fbek, J., Drozd, J.: Using unmanned aerial systems in military operations for autonomous reconnaissance. In: Mazal, J. (ed.) MESAS 2018. LNCS, vol. 11472, pp. 514\u2013529. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14984-0_38"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM (2002)","DOI":"10.1137\/1.9780898718515"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-70740-8_12","volume-title":"Modelling and Simulation for Autonomous Systems","author":"D Woller","year":"2021","unstructured":"Woller, D., Koz\u00e1k, V., Kulich, M.: The GRASP metaheuristic for the electric vehicle routing problem. In: Mazal, J., Fagiolini, A., Vasik, P., Turi, M. (eds.) MESAS 2020. LNCS, vol. 12619, pp. 189\u2013205. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-70740-8_12"}],"container-title":["Lecture Notes in Computer Science","Modelling and Simulation for Autonomous Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-31268-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T22:53:14Z","timestamp":1682895194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-31268-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031312670","9783031312687"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-31268-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MESAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Modelling and Simulation for Autonomous Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mesas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.mscoe.org\/event\/mesas-2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"88% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}