{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:07:40Z","timestamp":1761293260285},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T00:00:00Z","timestamp":1428451200000},"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":["Optim Lett"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s11590-015-0875-6","type":"journal-article","created":{"date-parts":[[2015,4,7]],"date-time":"2015-04-07T12:32:11Z","timestamp":1428409931000},"page":"1641-1657","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A reinforcement learning approach to convoy scheduling on a contested transportation network"],"prefix":"10.1007","volume":"9","author":[{"given":"Daniel","family":"Stimpson","sequence":"first","affiliation":[]},{"given":"Rajesh","family":"Ganesan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,8]]},"reference":[{"key":"875_CR1","unstructured":"US Department of the Army, FM 3\u201324 \/ MCWP 3\u201333.5, Counterinsurgency (2006)"},{"issue":"2","key":"875_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli, E., Wood, K.: Shortest-path network interdiction. Networks 40(2), 97\u2013111 (2002)","journal-title":"Networks"},{"issue":"5","key":"875_CR3","first-page":"25","volume":"5","author":"P Tamta","year":"2013","unstructured":"Tamta, P., Pande, B.P., Dhami, H.S.: Reduction of maximum flow network interdiction problem: step towards the polynomial time solutions. Int. J. Appl. Inf. Syst. 5(5), 25\u201329 (2013)","journal-title":"Int. J. Appl. Inf. Syst."},{"key":"875_CR4","doi-asserted-by":"crossref","DOI":"10.21236\/ADA449515","volume-title":"Continuous network interdiction, report NPSOR-06-007","author":"A Washburn","year":"2006","unstructured":"Washburn, A.: Continuous network interdiction, report NPSOR-06-007. Naval Postgraduate School, Monterey (2006)"},{"key":"875_CR5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/nav.20374","volume":"58","author":"A Washburn","year":"2011","unstructured":"Washburn, A., Ewing, P.L.: Allocation of clearance assets in IED warfare. Naval Res. Logist. 58, 180\u2013187 (2011)","journal-title":"Naval Res. Logist."},{"key":"875_CR6","unstructured":"Lin, K., Washburn, A.: The effect of decoys in IED warfare. Report prepared for Joint IED Defeat Organization. 5000 Army Pentagon, Washington D.C. (2010)"},{"key":"875_CR7","unstructured":"Marks, C.E.: Optimization-based routing and scheduling of IED-detection assets in contemporary military operations. Masters Thesis, Massachusetts Institute of Technology, Cambridge (2009)"},{"issue":"1","key":"875_CR8","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10479-012-1126-1","volume":"208","author":"P Kolesar","year":"2013","unstructured":"Kolesar, P., Leister, K., Stimpson, D., Woodaman, R.: A simple model of improvised explosive device clearance. Ann. Oper. Res. 208(1), 451\u2013468 (2013)","journal-title":"Ann. Oper. Res."},{"key":"875_CR9","unstructured":"Leister, K., Hudson, T.: Route clearance team scheduling, final report. George Mason University, Fairfax, Masters Degree Project Course (2009)"},{"key":"875_CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"LP Kailbling","year":"1996","unstructured":"Kailbling, L.P., Littman, M.L., Moore, A.W.: Reinforcement learning: a survey. J. Artif. Intell. Res. 4, 237\u2013285 (1996)","journal-title":"J. Artif. Intell. Res."},{"key":"875_CR11","volume-title":"Reinforcement learning, an introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement learning, an introduction. The MIT Press, Cambridge (1998)"},{"issue":"3","key":"875_CR12","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s13676-012-0015-8","volume":"1","author":"WB Powell","year":"2012","unstructured":"Powell, W.B., Simao, H.P., Bouzaiene-Ayari, B.: Approximate dynamic programming in transportation and logistics. Eur. J. Transp. Logist. 1(3), 237\u2013284 (2012)","journal-title":"Eur. J. Transp. Logist."},{"key":"875_CR13","unstructured":"Bellman, R.E.: Dynamic programming. Princeton University Press, Princeton (1957)"},{"key":"875_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9780470182963","volume-title":"Approximate dyanamic programming: solving the curses of dimentionality","author":"WB Powell","year":"2007","unstructured":"Powell, W.B.: Approximate dyanamic programming: solving the curses of dimentionality. Wiley, New York (2007)"},{"key":"875_CR15","volume-title":"Neuro-dynamic programming","author":"DP Berrtsekas","year":"1996","unstructured":"Berrtsekas, D.P., Tsitsiklis, J.: Neuro-dynamic programming. Athena Scientific, Belmont (1996)"},{"key":"875_CR16","first-page":"178","volume":"21","author":"A Gosavi","year":"2009","unstructured":"Gosavi, A.: Reinforcement learning: a tutorial survey and recent advances. J. Comput. 21, 178\u2013192 (2009)","journal-title":"J. Comput."},{"key":"875_CR17","unstructured":"Balakrishna, P.: Scalable approximate dynamic programming models with applications in air transport. PhD Dissertation, George Mason University, Fairfax (2009)"},{"key":"875_CR18","unstructured":"Hinton, T.G.: A thesis regarding the vehicle routing problem including a range of novel techniques for it solution. PhD Dissertation, University of Bristol, Bristol (2010)"},{"key":"875_CR19","unstructured":"Stimpson, D.: Thinking about IED warfare. Marine Gazette, pp. 35\u201342 (2011)"},{"issue":"3","key":"875_CR20","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1538-4632.2007.00704.x","volume":"39","author":"I Yamanda","year":"2007","unstructured":"Yamanda, I., Thill, J.: Local indicators of network-constrained clusters in spatial point patterns. Geogr. Anal. 39(3), 268\u2013292 (2007)","journal-title":"Geogr. Anal."},{"issue":"9","key":"875_CR21","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1080\/13658810701587891","volume":"22","author":"A Okabe","year":"2008","unstructured":"Okabe, A., Satoh, T., Furuta, T., Suzuki, A., Okano, K.: Generalized network Voronoi diagrams: concepts, conputational methods, and applications. Int. J. Geogr. Inf. Sci. 22(9), 965\u2013994 (2008)","journal-title":"Int. J. Geogr. Inf. Sci."},{"issue":"5","key":"875_CR22","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.compenvurbsys.2008.05.001","volume":"35","author":"Z Xie","year":"2008","unstructured":"Xie, Z., Yan, J.: Kernel density estimation of traffic accidents in a network space. Comput. Environ. Urban Syst. 35(5), 396\u2013406 (2008)","journal-title":"Comput. Environ. Urban Syst."},{"key":"875_CR23","unstructured":"Jonsson, G.K.: Hidden temporal pattern in interaction. PhD Thesis, University of Aberdeen, Aberdeen (2011)"},{"key":"875_CR24","doi-asserted-by":"crossref","first-page":"7496","DOI":"10.3390\/s100807496","volume":"10","author":"AA Salah","year":"2010","unstructured":"Salah, A.A., Pauwels, E., Tavenard, R., Gevers, T.: T-patterns revisited: mining for temporal patterns in sensor data. Sensors 10, 7496\u20137513 (2010)","journal-title":"Sensors"},{"issue":"2","key":"875_CR25","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.ssresearch.2006.05.003","volume":"36","author":"Y Lu","year":"2007","unstructured":"Lu, Y., Chen, X.: False alarm of planar K-function when analyzing urban crime distributed along streets. Soc. Sci. Res. 36(2), 611\u2013632 (2007)","journal-title":"Soc. Sci. Res."},{"key":"875_CR26","volume-title":"Resource-constrained spatial hot spot identification","author":"R Keefe","year":"2011","unstructured":"Keefe, R., Sullivan, T.: Resource-constrained spatial hot spot identification. RAND CORP, Arlington (2011)"},{"key":"875_CR27","volume-title":"Dynamic programming and optimal control, 3rd edn","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Dynamic programming and optimal control, 3rd edn, vol. II. Athena Scientific, Belmont (2011)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0875-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0875-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0875-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T02:13:52Z","timestamp":1566526432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0875-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,8]]},"references-count":27,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["875"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0875-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,8]]}}}