乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T15:13:55Z","timestamp":1722266035823},"reference-count":47,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T00:00:00Z","timestamp":1530576000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Networks"],"published-print":{"date-parts":[[2019,1]]},"abstract":"Abstract<\/jats:title>We study a class of stochastic network interdiction problems where the defender has incomplete (ambiguous) preferences. Specifically, we focus on the shortest path network interdiction modeled as a Stackelberg game, where the defender (leader) makes an interdiction decision first, and then the attacker (follower) selects a shortest path after the observation of random arc costs and interdiction effects in the network. We assume that the defender's risk preferences over exogenously given probabilities can be summarized by the expected utility theory. Although the exact form of the utility function is ambiguous to the defender, we assume that a set of pairwise gamble comparisons made by the defender is available, which can be used to restrict the shape of the utility function. We present two approaches to tackle this problem. The first approach conducts utility estimation and optimization separately, by first finding the best fit for a piecewise linear concave utility function according to the available data, and then optimizing the expected utility. The second approach integrates utility estimation and optimization, by modeling the utility ambiguity under a robust optimization framework following Armbruster and Delage [B. Armbruster and E. Delage, Manag. Sci., 61 (2015), 111\u2010128] and Hu and Mehrotra [J. Hu and S. Mehrotra, IIE Trans., 47 (2015), 358\u2010372]. We conduct extensive computational experiments to evaluate the performances of these approaches.<\/jats:p>","DOI":"10.1002\/net.21831","type":"journal-article","created":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T05:11:13Z","timestamp":1530681073000},"page":"3-22","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Stochastic network interdiction with incomplete preference"],"prefix":"10.1002","volume":"73","author":[{"given":"Babak Saleck","family":"Pay","sequence":"first","affiliation":[{"name":"Department of Statistical Sciences and Operations Research Virginia Commonwealth University Richmond Virginia"}]},{"given":"Jason R. W.","family":"Merrick","sequence":"additional","affiliation":[{"name":"Department of Statistical Sciences and Operations Research Virginia Commonwealth University Richmond Virginia"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6839-522X","authenticated-orcid":false,"given":"Yongjia","family":"Song","sequence":"additional","affiliation":[{"name":"Department of Statistical Sciences and Operations Research Virginia Commonwealth University Richmond Virginia"}]}],"member":"311","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2014.2059"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/1909888"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20236"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/deca.2015.0325"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1539-6924.2010.01492.x"},{"key":"e_1_2_7_10_1","volume-title":"Making Hard Decisions with Decision Tools","author":"Clemen R.","year":"2013"},{"key":"e_1_2_7_11_1","unstructured":"R.A.ColladoandD.Papp Network Interdiction\u2013Models Applications Unexplored Directions. Technical Report RUTCOR Technical Report RRR 4\u20132012 Rutgers Center for Operations Research Rutgers University Piscataway NJ 2012."},{"key":"e_1_2_7_12_1","unstructured":"K.J.Cormican Computational methods for deterministic and stochastic network interdiction problems PhD thesis Naval Postgraduate School Monterey CA 1995."},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.2.184"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/1884324"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2014.06.017"},{"key":"e_1_2_7_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800180103"},{"key":"e_1_2_7_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4068(89)90018-9"},{"key":"e_1_2_7_18_1","unstructured":"Q.Guo B.An Y.Zick andC.Miao Optimal interdiction of illegal network flow Proceedings of the Twenty\u2010Fifth International Joint Conference on Artificial Intelligence New York City (IJCAI\u201016) 2016."},{"key":"e_1_2_7_19_1","unstructured":"A.Hagberg D.Schult andP.Swart Networkx 2013.http:\/\/networkx.github.io\/index.html. (Accessed: 11 December 2017)"},{"key":"e_1_2_7_20_1","unstructured":"T.E.HarrisandF.S.Ross Fundamentals of a method for evaluating rail network capacities. Research Memorandum RM\u20101573 Rand Corporation Santa Monica CA 1955."},{"key":"e_1_2_7_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20079"},{"key":"e_1_2_7_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48109-X_4"},{"key":"e_1_2_7_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/0740817X.2014.919045"},{"key":"e_1_2_7_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.10039"},{"key":"e_1_2_7_25_1","volume-title":"Risk, Uncertainty, and Profit","author":"Knight F.H.","year":"1921"},{"key":"e_1_2_7_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.10.049"},{"key":"e_1_2_7_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.09.004"},{"key":"e_1_2_7_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/0740817X.2011.602659"},{"key":"e_1_2_7_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800170302"},{"key":"e_1_2_7_30_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789814407519_0012"},{"key":"e_1_2_7_31_1","volume-title":"Stochastic Network Interdiction. Encyclopedia of Operations Research and Management Science","author":"Morton D.P.","year":"2011"},{"key":"e_1_2_7_32_1","unstructured":"D.P.MortonandF.Pan Using sensors to interdict nuclear material smuggling Proceedings of the IIE Research Conference Atlanta GA 2005."},{"key":"e_1_2_7_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/07408170500488956"},{"key":"e_1_2_7_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.11.S125"},{"key":"e_1_2_7_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.05.005"},{"key":"e_1_2_7_36_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000000740"},{"key":"e_1_2_7_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48109-X_1"},{"key":"e_1_2_7_38_1","unstructured":"C.A.Phillips The Network Destruction Problem. Technical report Sandia National Labs. Albuquerque NM 1992."},{"key":"e_1_2_7_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2004.825888"},{"key":"e_1_2_7_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2008.2004825"},{"key":"e_1_2_7_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.07.036"},{"key":"e_1_2_7_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7997-1_61"},{"key":"e_1_2_7_43_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2016.0699"},{"key":"e_1_2_7_44_1","doi-asserted-by":"publisher","DOI":"10.1057\/s41274-016-0019-0"},{"key":"e_1_2_7_45_1","unstructured":"R.L.Steinrauf Network interdiction models Master's thesis Naval Postgraduate School Monterey CA 1991."},{"key":"e_1_2_7_46_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21567"},{"key":"e_1_2_7_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2011.37"},{"key":"e_1_2_7_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90236-R"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.21831","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.21831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T21:18:52Z","timestamp":1694812732000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.21831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,3]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1002\/net.21831"],"URL":"https:\/\/doi.org\/10.1002\/net.21831","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,3]]},"assertion":[{"value":"2017-08-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-16","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}