{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T04:35:06Z","timestamp":1717389306585},"reference-count":14,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7437,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1986,6]]},"abstract":"Abstract<\/jats:title>Distribution problems, including vehicle routing and warehouse location problems, are usually formulated by considering a finite number of possible locations for the customers, the warehouses, and vehicle stops. The question of selecting which of these points are actually used (and how) is a mixed\u2010integer programming problem which is difficult to solve. Thus, such a discrete formulation results in a problem that has to be solved heuristically; it also entails a large data preparation effort each time a solution has to be developed in response to changing world conditions. The continuous approach used in this paper attempts to circumvent some of these drawbacks. We consider one source and its customers in a service area; customer locations are modeled by a density surface over the service area. With this information, and data about the cost of inventory and transportation, we can determine the number of transhipment points, and the frequency and routing of all the distribution vehicles. An example is given. The continuous approach does not yield a solution. It gives design guidelines, which ensure near minimum total cost. These design guidelines are based on general properties of optimal solutions (discussed at the beginning of the paper) and on the specific characteristics of the case at hand. Implementation of the guidelines to obtain a feasible configuration requires human intervention. While the continuous method involves approximations (the real world is discrete and considerably more complicated than in our model), it yields insight into the structure of logistic systems. This insight should not only help in the design process; it may well also lead to improved heuristic solution methods for discrete formulations. Hybrid methods may eventually emerge.<\/jats:p>","DOI":"10.1002\/net.3230160202","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T20:50:34Z","timestamp":1178916634000},"page":"113-132","source":"Crossref","is-referenced-by-count":60,"title":["Configuration of physical distribution networks"],"prefix":"10.1002","volume":"16","author":[{"given":"Carlos F.","family":"Daganzo","sequence":"first","affiliation":[]},{"given":"Gordon F.","family":"Newell","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"G. F.Newell Optimal network geometry. I. Transportation and Traffic\u2010Theory (D. J. Buckley Ed.). A. H. and A. W. Reed Sydney Australia 1974 pp.561\u2013580."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.18.4.331"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(85)90054-2"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(85)90055-4"},{"key":"e_1_2_1_6_2","unstructured":"A. F. W.Han One\u2010to\u2010many distribution of non storable items: Approximate analytic models. Ph. D. thesis Department of Civil Engineering University of California Berkeley CA (1984)."},{"key":"e_1_2_1_7_2","unstructured":"D. E.Blumenfeld L. D.Burns andC. F.Daganzo Synchronizing production and transportation schedules. Presented at the ORSA\/TIMS Joint National Meeting in Dallas TX (1984)."},{"key":"e_1_2_1_8_2","unstructured":"C. F.Daganzo The role of break\u2010bulk terminals in many\u2010to\u2010many logistic networks. Institute of Transportation Studies Research Report UCB\u2010ITS\u2010RR\u201084\u20109 University of California Berkeley CA (1984)."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.9.1.1"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.3.469"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(85)90053-0"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/0125037"},{"key":"e_1_2_1_13_2","volume-title":"Urban Operations Research","author":"Larson R. C.","year":"1981"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(83)90030-8"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(84)90027-4"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230160202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230160202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T01:54:29Z","timestamp":1697853269000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230160202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["10.1002\/net.3230160202"],"URL":"https:\/\/doi.org\/10.1002\/net.3230160202","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}