1993
DOI: 10.1016/0142-0615(93)90047-q
|View full text |Cite
|
Sign up to set email alerts
|

A Benders' decomposition approach to the multi-objective distribution planning problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
16
0
2

Year Published

1999
1999
2018
2018

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 42 publications
(19 citation statements)
references
References 10 publications
0
16
0
2
Order By: Relevance
“…In the second stage, the optimum site and size for the DG units for the networks obtained in the first stage are determined by another multi-objective optimization, i.e., minimization of DG penetration level and power loss. The simultaneous optimization of the multiple objectives can be done in many ways, for example, aggregating approach [3][4][5][6][7][8], Pareto-dominance based approach [9][10][11][12][13][14][15], lexicographic ordering [35,42], and non-Pareto based approach [42]. Most of the multi-objective optimization algorithms are based on the Pareto-dominance principle [31,35,42] which is used to yield a set of non-dominated solutions.…”
Section: I S (C M S )mentioning
confidence: 99%
See 1 more Smart Citation
“…In the second stage, the optimum site and size for the DG units for the networks obtained in the first stage are determined by another multi-objective optimization, i.e., minimization of DG penetration level and power loss. The simultaneous optimization of the multiple objectives can be done in many ways, for example, aggregating approach [3][4][5][6][7][8], Pareto-dominance based approach [9][10][11][12][13][14][15], lexicographic ordering [35,42], and non-Pareto based approach [42]. Most of the multi-objective optimization algorithms are based on the Pareto-dominance principle [31,35,42] which is used to yield a set of non-dominated solutions.…”
Section: I S (C M S )mentioning
confidence: 99%
“…Normally, the numerical optimization tools such as nonlinear programming (NLP) [3,4], dynamic programming (DP) [5,6], and benders' decomposition [9] have been used. There are some disadvantages with these analytical approaches, i.e., curse of dimensionality, non-differentiability, discontinuous objective space etc.…”
Section: I S (C M S )mentioning
confidence: 99%
“…Two approaches have been used for optimizing the cost and reliability. In the first approach [6][7][8][9][10][11][12][13][14][15][16], both objectives are aggregated to obtain a single solution, while the second approach [17][18][19][20][21][22][23][24][25][26][27][28][29] takes the conflicting natures of the cost and reliability into account by simultaneous optimization of the two objectives to obtain a set of non-dominated solutions, called Pareto solutions [19,20] and a decision maker or the planning engineer selects one solution for implementation.…”
Section: Introductionmentioning
confidence: 99%
“…The heuristics-based algorithm can produce an acceptable solution to a problem in many practical scenarios, but there is no formal proof of its optimality. The deterministic algorithms that have been used for this problem are: nonlinear mixed integer programming [7], dynamic programming [6,8], nonlinear programming [9,10], Benders' decomposition [17,18], etc. Most of the heuristics-based algortithms applied to this problem are based on the evolutionary algorithms (EAs), such as genetic algorithm (GA) [12][13][14][15][16][19][20][21][22][23][24], tabu search (TS) [25,26], artificial immune system (AIS) [27], particle swarm optimization (PSO) [28,29], and honey bee mating optimization [30].…”
Section: Introductionmentioning
confidence: 99%
“…Solution approaches based on mathematical programming can be found in Refs. [1][2][3]. Some new algorithms based on artificial intelligence, such as simulated annealing [4] , genetic algorithm [5,6] , evolutionary technique [7−9] , ant colony algorithm [10] and tabu search [11] also have been proposed to solve the problem.…”
Section: Introductionmentioning
confidence: 99%