A mathematical optimization technique for locating and sizing distribution substations, and deriving their optimal service areas
作者： D.M. Crawford , S.B. Holt
关键词:
摘要: The problem discussed in this paper is the planning of distribution substation locations, sizes, and service boundaries. technique uses operations research methods to simultaneously optimize sizes boundaries, given alternative locations for substations reliability constraints. results techniques will lead a configuration that minimize feeder losses construction costs. Adherence lower long-range expenses.
harvard.edu
sci-hub.se 参考文章(6)
P. S. Davis, T. L. Ray, A branch‐bound algorithm for the capacitated facilities location problem Naval Research Logistics Quarterly. ,vol. 16, pp. 331- 344 ,(1969) , 10.1002/NAV.3800160306
M. A. Efroymson, T. L. Ray, A Branch-Bound Algorithm for Plant Location Operations Research. ,vol. 14, pp. 361- 368 ,(1966) , 10.1287/OPRE.14.3.361
Kurt Spielberg, Algorithms for the Simple Plant-Location Problem with Some Side Conditions Operations Research. ,vol. 17, pp. 85- 111 ,(1969) , 10.1287/OPRE.17.1.85
L. R. Ford, D. R. Fulkerson, SOLVING THE TRANSPORTATION PROBLEM Management Science. ,vol. 3, pp. 24- 32 ,(1956) , 10.1287/MNSC.3.1.24
Enver Masud, An Interactive Procedure for Sizing and Timing Distribution Substations Using Optimization Techniques IEEE Transactions on Power Apparatus and Systems. ,vol. 93, pp. 1281- 1286 ,(1974) , 10.1109/TPAS.1974.293851
Alfred A. Kuehn, Michael J. Hamburger, A Heuristic Program for Locating Warehouses Lecture Notes in Economics and Mathematical Systems. ,vol. 9, pp. 406- 407 ,(1976) , 10.1007/978-3-642-51565-1_123