Optimal Allocation of Load Using Optimization Technique

  • S. Chakravorty
  • M. Thukral
Conference paper


An optimized system for distribution planning is proposed in this paper. By using mathematical algorithm the proposed paper is capable of optimizing the conductor layout. The method takes into consideration the capital expenditure and the cost associated with power losses.

The paper discusses the distribution of load demands from various substations using the concept of Simplex Method and Branch and Bound technique. This paper gives us a method for meting the load demands from various available substations. The results of the discussed techniques will lead to a configuration of substations that will minimize substation construction cost. It will further lower long range distribution expenses as it will lead to optimum feeder path. The result is verified using MATLAB.


Power Loss Load Point Optimal Allocation Capital Expenditure Load Demand 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Dale M.Crawford and Stewart B. Holt, “A Mathematical Optimization Technique For Locating Sizing Distribution Substations, and Driving Their Optimal Service Areas”.Google Scholar
  2. [2]
    Davis,P.S., and Ray, T.L., “A Branch Bound Algorithm For The Capacitated Facilities Location Problem” pp 331-344,vol.16,No.3(Sept.,1969).Google Scholar
  3. [3]
    Efroymson,M.A., and Ray, T.L., “A Branch and Bound Algorithm for Plant Location”,pp. 361-368,vol.14,(May-June,1966)Google Scholar
  4. [4]
    David,F.L.,“The Optimal Selection of Public Warehouses by Simulation Techniques”, May 9-11,1973.Google Scholar
  5. [5]
    Spielberg Kurt,“Algorithms for the Simple Plant Location Problem with Some Side Conditions”,vol 17,No.1,Jan-Feb,1969,pp. 85-111.Google Scholar
  6. [6]
    Hu,T.C., Integer Programming and Network Flows, Addison Wesley Publishing Company, 1970.Google Scholar
  7. [7]
    Kuehn, A.A., and Hamburger, M.J., “A Heuristic Program for Locating Warehouses” pp. 643-666, vol.9 (1963).Google Scholar
  8. [8]
    Ford, L.R., and Fulkerson, D.R., 3(1): 24-32, oct., 1956.Google Scholar
  9. [9]
    K.K. Li, and T.S. Chung, “Distribution Planning Using a Rule Based Expert System Approach”.Google Scholar
  10. [10]
    R.N. Adamas, M.A. Laughton, “Optimal Planning of Power Networks Using Mixed Integer Programming Part I Static and Time Phased Network Synthesis”, vol.121, No. 2, February 1974, pp. 139-147.Google Scholar
  11. [11]
    J.L.Chen, Y.Y. Hsu, “An Expert System for Load Allocation in Distribution Expansion Planning”. Vol. 4, No. 3, July 1989, pp. 1910-1918.Google Scholar
  12. [12]
    D.M. Crawford, S.B. Holt, “A Mathematical Optimization Technique for Locating and Sizing Distribution Substations, and Deriving Their Optimal Service Areas”, vol. PAS 94, No. 2, March/April 1975, pp. 230-235.Google Scholar
  13. [13]
    M.A. El-Kady, “Computer Aided Planning of Distribution Substation and Primary Feeders”, vol. PAS 103, No. 6, June 1984pp. 1183-1189.Google Scholar
  14. [14]
    T.H. Fawzi, S.M. El-Sobki, “A New Planning Model for Distribution Systems” vol. PAS 102, No. 9, September 1983, pp.3010-3017.Google Scholar
  15. [15]
    T.Gonen, B.L. Foote, “Distribution System Planning Using Mixed Integer Programming”, vol.128, No. 2, March 1981, pp.70-79.Google Scholar
  16. [16]
    T.Gonen, B.L. Foote, “Mathematical Dynamic Optimization Model for Electrical Disribution System Planning”, vol. 4, No. 2,January 1982, pp.129-136.Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  • S. Chakravorty
    • 1
  • M. Thukral
    • 1
  1. 1.Sikkim Manipal Institute of TechnologyMajitar

Personalised recommendations