A New Planning Model for Distribution Systems

Models and Procedures for Electric Energy Distribution Planning. A Review

“…This methodology tries to solve together the analysis of location of substations, dimensioning of substations and feeders and finally distribution networks routing [Aoki et al 1990, Blanchard et al 1996, Boardman, Meckiff 1985, Brauner, Zobel 1994, El-Kadi 1984, Fawzi et al 1983, Gönen, Foote 1981, Gönen, Foote 1982, Gönen 1986, Hindi, Brameller 1977, Hsu, Chen 1990, Lin et al 1998, Miranda et al 1994, Nara et al 1991, Nara et al 1992, Ponnavaikko, Prakasa 1981, Quintana et al 1993, Ramírez-Rosado, BernalAgustin 1998, Ramírez-Rosado et al 1999, Ramírez-Rosado., Gönen 1991, Sun et al 1982, Tang 1996, Thompson, Wall 1981.…”

“…There is no analysis of the demand growth, and there is no need to study the possible changes in substation and feeders installations through the planning period. Usually the horizon considered is one year [Adams, Laughton, 1974, Aoki et al 1990, Crawford, Holt Jr 1975, ElKadi 1984, Fawzi et al 1983, Gönen, Foote 1981, Hindi, Brameller 1977, Holt Jr, Crawford 1976, Masud 1974, Sun et al 1982, Thompson, Wall 1981, Wall et al 1979]. …”

“…Then, the problem can be seen as a mixed integer linear programming problem [Adams et al 1984, Adams, Laughton, 1974, Afuso et al 1982, Aoki et al 1990, El-Kadi 1984, Fawzi et al 1983, Gönen, Foote 1981, Gönen, Foote 1982, Gönen 1986, Hindi, Brameller 1977, Masud 1974, Masud 1978, Nara et al 1991, Ramírez-Rosado., Gönen 1991, Sun et al 1982, Thompson, Wall 1981, Wall et al 1979, and solved using the available procedures based on the simplex method. The references [Adams et al 1984, Adams, Laughton, 1973, Afuso et al 1982] use a dynamic programming model and [Crawford, Holt Jr 1975, Holt Jr, Crawford 1976] use graph theory related models, and solve the problem combining shortest path algorithms and transportation algorithms.…”

“…The references [Adams et al 1984, Adams, Laughton, 1973, Afuso et al 1982] use a dynamic programming model and [Crawford, Holt Jr 1975, Holt Jr, Crawford 1976] use graph theory related models, and solve the problem combining shortest path algorithms and transportation algorithms. It's interesting to remark that many of the revised models used for practical problems use employ Branch and Bound algorithm as their solution technique [Adams et al 1984, Afuso et al 1982, Fawzi et al 1983, Gönen, Foote 1982, Hindi, Brameller 1977, Sun et al 1982, Thompson, Wall 1981, Wall et al 1979]. The models developed in [Adams, Laughton, 1974, Gönen, Foote 1981, Gönen, Foote 1982, Gönen 1986, Ramírez-Rosado., Gönen 1991] use straight mathematical programming formulations.…”

An efficient forward-backward algorithm to MSDEPP including batteries and voltage control devices

“…Most of early studies on DEP considered the study period as a single stage by ignoring the inter-temporal dependences and the dynamic nature of DEPPs [1,2]. This approach is known as horizon planning and it finds the optimal state of the network for a future fixed year.…”