{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:23:33Z","timestamp":1766312613731,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192112"},{"type":"electronic","value":"9783030192129"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-19212-9_37","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"557-564","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A Study on the Traveling Salesman Problem with a Drone"],"prefix":"10.1007","author":[{"given":"Ziye","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willem-Jan van","family":"Hoeve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Shaw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"issue":"4","key":"37_CR1","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1287\/trsc.2017.0791","volume":"52","author":"N Agatz","year":"2018","unstructured":"Agatz, N., Bouman, P., Schmidt, M.: Optimization approaches for the traveling salesman problem with drone. Transp. Sci. 52(4), 965\u2013981 (2018)","journal-title":"Transp. Sci."},{"issue":"4","key":"37_CR2","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1002\/net.21864","volume":"72","author":"P Bouman","year":"2018","unstructured":"Bouman, P., Agatz, N., Schmidt, M.: Dynamic programming approaches for the traveling salesman problem with drone. Networks 72(4), 528\u2013542 (2018)","journal-title":"Networks"},{"key":"37_CR3","unstructured":"Daknama, R., Kraus, E.: Vehicle routing with drones. arXiv preprint \n                    arXiv:1705.06431\n                    \n                   (2017)"},{"issue":"1","key":"37_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/TSMC.2016.2582745","volume":"47","author":"K Dorling","year":"2017","unstructured":"Dorling, K., Heinrichs, J., Messier, G.G., Magierowski, S.: Vehicle routing problems for drone delivery. IEEE Trans. Syst. Man Cybern. Syst. 47(1), 70\u201385 (2017)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"37_CR5","unstructured":"Ha, Q.M., Deville, Y., Dung, P.Q., H\u00e0, M.H.: Heuristic methods for the traveling salesman problem with drone. CoRR abs\/1509.08764 (2015)"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.trc.2017.11.015","volume":"86","author":"QM Ha","year":"2018","unstructured":"Ha, Q.M., Deville, Y., Pham, Q.D., H\u00e0, M.H.: On the min-cost traveling salesman problem with drone. Transp. Res. Part C Emerg. Technol. 86, 597\u2013621 (2018)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2018.03.025","volume":"91","author":"AM Ham","year":"2018","unstructured":"Ham, A.M.: Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming. Transp. Res. Part C Emerg. Technol. 91, 1\u201314 (2018)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"37_CR8","unstructured":"IBM ILOG CPLEX: CP Optimizer 12.7 Users Manual (2017)"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-01929-6_12","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P Laborie","year":"2009","unstructured":"Laborie, P.: IBM ILOG CP optimizer for detailed scheduling illustrated on three problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 148\u2013162. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-01929-6_12"},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP optimizer for scheduling. Constraints 23(2), 210\u2013250 (2018)","journal-title":"Constraints"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.trc.2015.03.005","volume":"54","author":"CC Murray","year":"2015","unstructured":"Murray, C.C., Chu, A.G.: The flying sidekick traveling salesman problem: optimization of drone-assisted parcel delivery. Transp. Res. Part C Emerg. Technol. 54, 86\u2013109 (2015)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"4","key":"37_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"},{"key":"37_CR13","unstructured":"Poikonen, S., Golden, B., Wasil, E.: A branch and bound approach to the TSP with drone. INFORMS J. Comput. (to appear)"},{"issue":"1","key":"37_CR14","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/net.21746","volume":"70","author":"S Poikonen","year":"2017","unstructured":"Poikonen, S., Wang, X., Golden, B.: The vehicle routing problem with drones: extended models and connections. Networks 70(1), 34\u201343 (2017)","journal-title":"Networks"},{"key":"37_CR15","unstructured":"UPS: UPS Tests Residential Delivery Via Drone. Youtube (2017). \n                    https:\/\/www.youtube.com\/watch?v=xx9_6OyjJrQ"},{"issue":"4","key":"37_CR16","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s11590-016-1035-3","volume":"11","author":"X Wang","year":"2017","unstructured":"Wang, X., Poikonen, S., Golden, B.: The vehicle routing problem with drones: several worst-case results. Optim. Lett. 11(4), 679\u2013697 (2017)","journal-title":"Optim. Lett."},{"key":"37_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.trc.2018.04.009","volume":"91","author":"EE Yurek","year":"2018","unstructured":"Yurek, E.E., Ozmutlu, H.C.: A decomposition-based iterative optimization algorithm for traveling salesman problem with drone. Transp. Res. Part C Emerg. Technol. 91, 249\u2013262 (2018)","journal-title":"Transp. Res. Part C Emerg. Technol."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:12:33Z","timestamp":1558984353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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"}},{"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"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}