乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T06:11:57Z","timestamp":1696486317280},"reference-count":77,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2016,8,18]],"date-time":"2016-08-18T00:00:00Z","timestamp":1471478400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2016,12]]},"abstract":"We consider the problem of optimally locating a single facility anywhere in a network to serve both on\u2010network and off\u2010network demands. Off\u2010network demands occur in a Euclidean plane, while on\u2010network demands are restricted to a network embedded in the plane. On\u2010network demand points are serviced using shortest\u2010path distances through links of the network (e.g., on\u2010road travel), whereas demand points located in the plane are serviced using more expensive Euclidean distances. Our base objective minimizes the total weighted distance to all demand points. We develop several extensions to our base model, including: (i) a threshold distance model where if network distance exceeds a given threshold, then service is always provided using Euclidean distance, and (ii) a minimax model that minimizes worst\u2010case distance. We solve our formulations using the \u201cBig Segment Small Segment\u201d global optimization method, in conjunction with bounds tailored for each problem class. Computational experiments demonstrate the effectiveness of our solution procedures. Solution times are very fast (often under one second), making our approach a good candidate for embedding within existing heuristics that solve multi\u2010facility problems by solving a sequence of single\u2010facility problems. \u00a9 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(4), 271\u2013282 2016<\/jats:p>","DOI":"10.1002\/net.21698","type":"journal-article","created":{"date-parts":[[2016,8,18]],"date-time":"2016-08-18T16:16:44Z","timestamp":1471537004000},"page":"271-282","source":"Crossref","is-referenced-by-count":9,"title":["Mixed planar and network single\u2010facility location problems"],"prefix":"10.1002","volume":"68","author":[{"given":"Zvi","family":"Drezner","sequence":"first","affiliation":[{"name":"Steven G. Mihaylo College of Business and Economics California State University Fullerton California 92834"}]},{"given":"Carlton H.","family":"Scott","sequence":"additional","affiliation":[{"name":"Paul Merage School of Business University of California Irvine California 92697"}]},{"given":"John","family":"Turner","sequence":"additional","affiliation":[{"name":"Paul Merage School of Business University of California Irvine California 92697"}]}],"member":"311","published-online":{"date-parts":[[2016,8,18]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.2.104.11897"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(88)90029-9"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02568604"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2010.05.004"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.02.001"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20408"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.24.1.77"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-013-9574-3"},{"key":"e_1_2_7_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0038-0121(00)00005-7"},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.06.022"},{"key":"e_1_2_7_12_1","first-page":"1","article-title":"A survey of solution methods for the continuous location\u2010allocation problem","volume":"5","author":"Brimberg J.","year":"2008","journal-title":"Int J Oper Res"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.3.444.12431"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050054"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00364-8"},{"key":"e_1_2_7_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934511"},{"key":"e_1_2_7_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00066-5"},{"key":"e_1_2_7_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.22.2.157"},{"key":"e_1_2_7_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199302)40:1<117::AID-NAV3220400108>3.0.CO;2-0"},{"key":"e_1_2_7_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2014.1287"},{"key":"e_1_2_7_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0013091500037238"},{"key":"e_1_2_7_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026142406234"},{"key":"e_1_2_7_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.03.006"},{"key":"e_1_2_7_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1435-5597.1974.tb00902.x"},{"key":"e_1_2_7_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.331"},{"key":"e_1_2_7_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1006005"},{"key":"e_1_2_7_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2014.2326952"},{"key":"e_1_2_7_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0966-8349(98)00036-9"},{"key":"e_1_2_7_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032343"},{"key":"e_1_2_7_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.15.2.137"},{"key":"e_1_2_7_31_1","doi-asserted-by":"crossref","unstructured":"J.M.D\u00edaz\u2010B\u00e1\u00f1ez M.Korman P.P\u00e9rez\u2010Lantero andI.Ventura \u201cThe 1\u2010center and 1\u2010highway problem \u201d Computational geometry Springer 2012 pp.155\u2013165.","DOI":"10.1007\/978-3-642-34191-5_15"},{"key":"e_1_2_7_32_1","doi-asserted-by":"crossref","unstructured":"J.M.D\u00edaz\u2010B\u00e1\u00f1ez M.Korman P.P\u00e9rez\u2010Lantero andI.Ventura \u201cLocating a service facility and a rapid transit line \u201d In LNCS special festschrift issue of selected papers from the 14th Spanish Meeting on Computational Geometry (EGC'11) Springer 2012 pp.126\u2013137.","DOI":"10.1007\/978-3-642-34191-5_12"},{"key":"e_1_2_7_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7572-0_4"},{"key":"e_1_2_7_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.05.010"},{"key":"e_1_2_7_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-1797-5"},{"key":"e_1_2_7_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00084-8"},{"key":"e_1_2_7_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56082-8_1"},{"key":"e_1_2_7_38_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.25.3.183"},{"key":"e_1_2_7_39_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.2.255"},{"key":"e_1_2_7_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0077"},{"key":"e_1_2_7_41_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800300211"},{"key":"e_1_2_7_42_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.6.4.379"},{"key":"e_1_2_7_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.05.047"},{"key":"e_1_2_7_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.07.013"},{"key":"e_1_2_7_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_2_7_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579168"},{"key":"e_1_2_7_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-008-0061-4"},{"key":"e_1_2_7_48_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"e_1_2_7_49_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.462"},{"key":"e_1_2_7_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00004-2"},{"key":"e_1_2_7_51_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.32.11.1434"},{"key":"e_1_2_7_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(81)90200-9"},{"key":"e_1_2_7_53_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.33.4.391"},{"key":"e_1_2_7_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"e_1_2_7_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5355-6_11"},{"key":"e_1_2_7_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212052"},{"key":"e_1_2_7_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213014"},{"key":"e_1_2_7_58_1","volume-title":"Algorithms and data structures: The basic toolbox","author":"Mehlhorn K.","year":"2008"},{"key":"e_1_2_7_59_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.4.641"},{"key":"e_1_2_7_60_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100307"},{"key":"e_1_2_7_61_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130304"},{"key":"e_1_2_7_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.05.034"},{"key":"e_1_2_7_63_1","unstructured":"J.Moreno\u2010Perez J.Moreno\u2010Vega andN.Mladenovic Tabu search and simulated annealing inp\u2010median problem Proceedings of the Canadian Operational Research Society Conference Montreal 1994."},{"key":"e_1_2_7_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.03.005"},{"key":"e_1_2_7_65_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.04.004"},{"key":"e_1_2_7_66_1","doi-asserted-by":"publisher","DOI":"10.15807\/jorsj.48.123"},{"key":"e_1_2_7_67_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.03.001"},{"key":"e_1_2_7_68_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602473"},{"key":"e_1_2_7_69_1","first-page":"79","article-title":"A question in the geometry of situation","volume":"1","author":"Sylvester J.","year":"1857","journal-title":"Q J Math"},{"key":"e_1_2_7_70_1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/14786446008642934","article-title":"On Poncelet's approximate linear valuation of Surd forms","volume":"20","author":"Sylvester J.","journal-title":"Philos Mag"},{"key":"e_1_2_7_71_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.6.1363"},{"key":"e_1_2_7_72_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594"},{"key":"e_1_2_7_73_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602165"},{"key":"e_1_2_7_74_1","first-page":"1","article-title":"The vehicle routing problem with drones: Several worst\u2010case results","author":"Wang X.","year":"2016","journal-title":"Optim Lett"},{"key":"e_1_2_7_75_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2003.12.002"},{"key":"e_1_2_7_76_1","volume-title":"\u00dcber den standort der industrien, 1. teil: Reine theorie des standortes. English translation: On the location of industries","author":"Weber A.","year":"1929"},{"key":"e_1_2_7_77_1","first-page":"5","article-title":"The Weber problem: History and perspectives","volume":"1","author":"Wesolowsky G.O.","year":"1993","journal-title":"Location Sci"},{"key":"e_1_2_7_78_1","volume-title":"Nonlinear programming: A unified approach","author":"Zangwill W.I.","year":"1969"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.21698","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.21698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T02:50:59Z","timestamp":1696387859000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.21698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,18]]},"references-count":77,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["10.1002\/net.21698"],"URL":"https:\/\/doi.org\/10.1002\/net.21698","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,18]]}}}