{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T04:14:07Z","timestamp":1750997647851,"version":"3.41.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T00:00:00Z","timestamp":1508976000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Funda\u00e7\u00e3o Centro de An\u00e1lise, Pesquisa e Inova\u00e7\u00e3o Tecnol\u00f3gica"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10732-017-9359-4","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T15:21:01Z","timestamp":1509031261000},"page":"83-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Dynamic region visit routing problem for vehicles with minimum turning radius"],"prefix":"10.1007","volume":"24","author":[{"given":"Douglas G.","family":"Macharet","sequence":"first","affiliation":[]},{"given":"Armando","family":"Alves Neto","sequence":"additional","affiliation":[]},{"given":"Vila F.","family":"da Camara Neto","sequence":"additional","affiliation":[]},{"given":"Mario F. M.","family":"Campos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,26]]},"reference":[{"key":"9359_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, NJ (2007)"},{"key":"9359_CR2","doi-asserted-by":"crossref","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. Discret. Appl. Math. 55, 197\u2013218 (1994)","journal-title":"Discret. Appl. Math."},{"key":"9359_CR3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G Ausiello","year":"2001","unstructured":"Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the on-line travelling salesman. Algorithmica 29, 560\u2013581 (2001)","journal-title":"Algorithmica"},{"issue":"2mo","key":"9359_CR4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.jda.2007.03.002","volume":"6","author":"G Ausiello","year":"2008","unstructured":"Ausiello, G., Bonifaci, V., Laura, L.: The on-line asymmetric traveling salesman problem. J. Discret Algorithms 6(2mo), 290\u2013298 (2008)","journal-title":"J. Discret Algorithms"},{"issue":"4","key":"9359_CR5","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1287\/opre.39.4.601","volume":"39","author":"DJ Bertsimas","year":"1991","unstructured":"Bertsimas, D.J., van Ryzin, G.: A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. 39(4), 601\u2013615 (1991)","journal-title":"Oper. Res."},{"issue":"9","key":"9359_CR6","doi-asserted-by":"crossref","first-page":"1482","DOI":"10.1109\/JPROC.2011.2158181","volume":"99","author":"F Bullo","year":"2011","unstructured":"Bullo, F., Frazzoli, E., Pavone, M., Savla, K., Smith, S.: Dynamic vehicle routing for robotic systems. Proc. IEEE 99(9), 1482\u20131504 (2011)","journal-title":"Proc. IEEE"},{"issue":"5","key":"9359_CR7","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1287\/opre.20.5.1044","volume":"20","author":"N Christofides","year":"1972","unstructured":"Christofides, N.: Technical note-bounds for the travelling-salesman problem. Oper. Res. 20(5), 1044\u20131056 (1972)","journal-title":"Oper. Res."},{"key":"9359_CR8","doi-asserted-by":"crossref","unstructured":"Comarela, G., Gon\u00e7alves, K., Pappa, G.L., Almeida, J., Almeida, V.: Robot routing in sparse wireless sensor networks with continuous ant colony optimization. In: 13th Annual Conference on Companion on Genetic and Evolutionary Computation (GECCO), pp. 599\u2013606. ACM, New York, NY (2011)","DOI":"10.1145\/2001858.2002055"},{"issue":"3","key":"9359_CR9","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/2372560","volume":"79","author":"LE Dubins","year":"1957","unstructured":"Dubins, L.E.: On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. Am. J. Math. 79(3), 497\u2013516 (1957)","journal-title":"Am. J. Math."},{"issue":"6","key":"9359_CR10","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1109\/TRO.2004.833789","volume":"20","author":"T Fraichard","year":"2004","unstructured":"Fraichard, T., Scheuer, A.: From reeds and Shepp\u2019s to continuous-curvature paths. IEEE Trans. Rob. 20(6), 1025\u20131035 (2004)","journal-title":"IEEE Trans. Rob."},{"key":"9359_CR11","doi-asserted-by":"crossref","unstructured":"Isaacs, J.T., Klein, D.J., Hespanha, J.P.: Algorithms for the traveling salesman problem with neighborhoods involving a Dubins\u2019 vehicle. In: IEEE American Control Conference. pp. 1704\u20131709 (2011)","DOI":"10.1109\/ACC.2011.5991501"},{"issue":"2","key":"9359_CR12","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/trsc.1060.0147","volume":"40","author":"P Jaillet","year":"2006","unstructured":"Jaillet, P., Wagner, M.R.: Online routing problems: value of advanced information as improved competitive ratios. Transp. Sci. 40(2), 200\u2013210 (2006)","journal-title":"Transp. Sci."},{"key":"9359_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-0-387-77778-8_10","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research\/Computer Science Interfaces Series","author":"P Jaillet","year":"2008","unstructured":"Jaillet, P., Wagner, M.R.: Online vehicle routing problems: a survey. In: Golden, B., Raghavan, S., Wasil, E., Sharda, R., Vo\u00df, S. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research\/Computer Science Interfaces Series, vol. 43, pp. 221\u2013237. Springer, Berlin (2008)"},{"issue":"4","key":"9359_CR14","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.1016\/j.asoc.2011.10.023","volume":"12","author":"MR Khouadjia","year":"2012","unstructured":"Khouadjia, M.R., Sarasola, B., Alba, E., Jourdan, L., Talbi, E.G.: A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Appl. Soft Comput. 12(4), 1426\u20131439 (2012)","journal-title":"Appl. Soft Comput."},{"key":"9359_CR15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-0-387-77778-8_9","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research\/Computer Science Interfaces Series","author":"A Larsen","year":"2008","unstructured":"Larsen, A., Madsen, O.B., Solomon, M.M.: Recent developments in dynamic vehicle routing systems. In: Golden, B., Raghavan, S., Wasil, E., Sharda, R., Vo\u00df, S. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research\/Computer Science Interfaces Series, vol. 43, pp. 199\u2013218. Springer, Berlin (2008)"},{"key":"9359_CR16","unstructured":"Le\u00a0Ny, J., Feron, E.: An approximation algorithm for the curvature-constrained traveling salesman problem. In: Proceedings of the 43rd Annual Allerton Conference on Communications, Control and Computing (2005)"},{"issue":"1","key":"9359_CR17","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1109\/TAC.2011.2166311","volume":"57","author":"J Ny Le","year":"2012","unstructured":"Le Ny, J., Feron, E., Frazzoli, E.: On the dubins traveling salesman problem. IEEE Trans. Autom. Control 57(1), 265\u2013270 (2012)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"9359_CR18","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(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"9359_CR19","doi-asserted-by":"crossref","unstructured":"Ma, X., Casta\u00f1\u00f3n, D.A.: Receding horizon planning for dubins traveling salesman problems. In: Proceedings of the 45th IEEE Conference on Decision and Control, pp. 5453\u20135458 (2006)","DOI":"10.1109\/CDC.2006.376928"},{"key":"9359_CR20","doi-asserted-by":"crossref","unstructured":"Macharet, D.G., Alves\u00a0Neto, A., da\u00a0Camara\u00a0Neto, V.F., Campos, M.F.M.: Nonholonomic path planning optimization for Dubins\u2019 vehicles. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA\u20192011), pp. 4208\u20134213 (2011)","DOI":"10.1109\/ICRA.2011.5980239"},{"key":"9359_CR21","unstructured":"Macharet, D.G., Alves\u00a0Neto, A., da\u00a0Camara\u00a0Neto, V.F., Campos, M.F.M.: An evolutionary approach for the Dubins\u2019 traveling salesman problem with neighborhoods. In: 21th Genetic and Evolutionary Computation Conference (2012a)"},{"key":"9359_CR22","doi-asserted-by":"crossref","unstructured":"Macharet, D.G., Alves\u00a0Neto, A., da\u00a0Camara\u00a0Neto, V.F., Campos, M.F.M.: Data gathering tour optimization for Dubins\u2019 vehicles. In: IEEE Congress on Evolutionary Computation (2012b)","DOI":"10.1109\/CEC.2012.6256477"},{"key":"9359_CR23","doi-asserted-by":"crossref","unstructured":"Macharet, D.G., Neto, A.A., da\u00a0Camara\u00a0Neto, V.F., Campos, M.F.M.: Efficient target visiting path planning for multiple vehicles with bounded curvature. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 3830\u20133836 (2013)","DOI":"10.1109\/IROS.2013.6696904"},{"key":"9359_CR24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.endm.2010.05.003","volume":"36","author":"A Medeiros","year":"2010","unstructured":"Medeiros, A., Urrutia, S.: Discrete optimization methods to determine trajectories for Dubins\u2019 vehicles. Electron. Notes Discret. Math. 36, 17\u201324 (2010). international Symposium on Combinatorial Optimization (ISCO)","journal-title":"Electron. Notes Discret. Math."},{"key":"9359_CR25","doi-asserted-by":"crossref","unstructured":"Obermeyer, K.J., Oberlin, P., Darbha, S.: Sampling-based roadmap methods for a visual reconnaissance UAV. In: AIAA Conference on Guidance, Navigation and Control (2010)","DOI":"10.2514\/6.2010-7568"},{"issue":"1","key":"9359_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gendreau, M., Guret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1\u201311 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"9359_CR27","first-page":"223","volume-title":"Vehicle Routing: Methods and Studies, Studies in Management Science and Systems","author":"HN Psaraftis","year":"1988","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing problems. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies, Studies in Management Science and Systems, vol. 16, pp. 223\u2013248. North-Holland, Amsterdam (1988)"},{"issue":"1","key":"9359_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.21628","volume":"67","author":"HN Psaraftis","year":"2016","unstructured":"Psaraftis, H.N., Wen, M., Kontovas, C.A.: Dynamic vehicle routing problems: three decades and counting. Networks 67(1), 3\u201331 (2016). https:\/\/doi.org\/10.1002\/net.21628","journal-title":"Networks"},{"key":"9359_CR29","doi-asserted-by":"crossref","unstructured":"Savla, K., Frazzoli, E., Bullo, F.: On the point-to-point and traveling salesperson problems for dubins\u2019 vehicle. In: IEEE American Control Conference (ACC), vol. 2, pp. 786\u2013791 (2005)","DOI":"10.1109\/ACC.2005.1470055"},{"issue":"6","key":"9359_CR30","doi-asserted-by":"crossref","first-page":"1378","DOI":"10.1109\/TAC.2008.925814","volume":"53","author":"K Savla","year":"2008","unstructured":"Savla, K., Frazzoli, E., Bullo, F.: Traveling salesperson problems for the dubins\u2019 vehicle. IEEE Trans. Autom. Control 53(6), 1378\u20131391 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"9","key":"9359_CR31","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1016\/j.conengprac.2009.02.010","volume":"18","author":"M Shanmugavel","year":"2010","unstructured":"Shanmugavel, M., Tsourdos, A., White, B., \u017bbikowski, R.: Co-operative path planning of multiple UAVs using Dubins paths with clothoid arcs. Control Eng. Pract. 18(9), 1084\u20131092 (2010)","journal-title":"Control Eng. Pract."},{"issue":"4","key":"9359_CR32","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0921-8890(00)00127-5","volume":"34","author":"AM Shkel","year":"2001","unstructured":"Shkel, A.M., Lumelsky, V.: Classification of the Dubins\u2019 set. Robot. Auton. Syst. 34(4), 179\u2013202 (2001)","journal-title":"Robot. Auton. Syst."},{"issue":"2","key":"9359_CR33","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"9359_CR34","doi-asserted-by":"crossref","unstructured":"Yadlapalli, S., Malik, W., Rathinam, S., Darbha, S.: A lagrangian-based algorithm for a combinatorial motion planning problem. In: Proceedings of the 46th IEEE Conference on Decision and Control (CDC), pp. 5979\u20135984 (2007)","DOI":"10.1109\/CDC.2007.4434856"},{"key":"9359_CR35","doi-asserted-by":"crossref","unstructured":"Yu, X., Hung, J.Y.: A genetic algorithm for the Dubins Traveling Salesman Problem. In: Proceedings of the IEEE International Symposium on Industrial Electronics (ISIE), pp. 1256\u20131261 (2012)","DOI":"10.1109\/ISIE.2012.6237270"},{"issue":"9","key":"9359_CR36","doi-asserted-by":"crossref","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":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9359-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9359-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9359-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T19:14:24Z","timestamp":1750965264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9359-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,26]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["9359"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9359-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2017,10,26]]}}}