Professional Documents
Culture Documents
Review
Smart Distribution Networks: A Review of Modern
Distribution Concepts from a Planning Perspective
Syed Ali Abbas Kazmi 1, *, Muhammad Khuram Shahzad 1 , Akif Zia Khan 2 and Dong Ryeol Shin 1, *
1 Department of Electrical and Computer Engineering, College of Information and Communication
Engineering (CICE), Sungkyunkwan University (SKKU), Suwon 16419, Korea; khuram@skku.edu.
2 U.S.-Pakistan Center for Advanced Studies in Energy (USPCAS-E), National University of Sciences and
Technology (NUST), H-12 Campus, Islamabad 44000, Pakistan; akif@casen.nust.edu.pk
* Correspondence: kazmi@skku.edu (S.A.A.K.); drshin@skku.edu (D.R.S.);
Tel.: +82-010-5947-6376 (S.A.A.K.); +82-031-290-7125 (D.R.S.)
Abstract: Smart grids (SGs), as an emerging grid modernization concept, is spreading across diverse
research areas for revolutionizing power systems. SGs realize new key concepts with intelligent
technologies, maximizing achieved objectives and addressing critical issues that are limited in
conventional grids. The SG modernization is more noticeable at the distribution grid level. Thus,
the transformation of the traditional distribution network (DN) into an intelligent one, is a vital
dimension of SG research. Since future DNs are expected to be interconnected in nature and operation,
hence traditional planning methods and tools may no longer be applicable. In this paper, the smart
distribution network (SDN) concept under the SG paradigm, has presented and reviewed from the
planning perspective. Also, developments in the SDN planning process have been surveyed on the
basis of SG package (SGP). The package presents a SDN planning foundation via major SG-enabling
technologies (SGTF), anticipated functionalities (SGAF), new consumption models (MDC) as potential
SDN candidates, associated policies and pilot projects and multi-objective planning (MOP) as a
real-world optimization problem. In addition, the need for an aggregated SDN planning model has
also been highlighted. The paper discusses recent notable related works, implementation activities,
various issues/challenges and potential future research directions; all aiming at SDN planning.
1. Introduction
The ever increasing load demands, aging infrastructure, limited expansion options, and environmental
concerns make it difficult for hierarchical-based traditional grids (TGs) to keep pace with modern
era requirements [1]. Nevertheless, power grids have not been upgraded considerably for decades.
Moreover, the competitive electricity market and service requirements close to the technical limits of
current technology, have resulted in overstressed grid operations (at the transmission/distribution
level), particularly in the distribution network (DN). Conventionally, the DN has purposely been
planned to retain unidirectional power flow with radial topology, aimed at efficient power delivery
to the end consumer. However, escalating load requirements over large geographical distances
have resulted in serious technical issues in DNs, predominately higher system losses, lower voltage
regulation, compromised power quality, reliability concerns, and expensive planning alternatives [2,3].
The possible solution strategy calls for planned (long/medium/short-term) modernizations that
include countermeasures to deal with technical and commercial issues. The anticipated modernization
needs to investigate the potential key enablers and associated developments; in planning and
transforming traditional into smart DNs (SDNs) [4]. Still, smooth transition to SDNs is a concept that
is easier said than done.
Figure 1. Development process of distribution grids from the past to a smart future (adapted from
Figure 1. Development process of distribution grids from the past to a smart future (adapted from IEA [21]).
IEA [21]).
Energies 2017, 10, 501 4 of 47
1a. Long-term SDN planning: Long (several years) and medium term (one year) planning problems
have been carried out over large (single and/or multi-stage) planning horizons. The classification
mainly deals with a number of energy sources (DG, DER, RES, REG, storage, ESS, EV, DR,
associated devices, reinforcements, etc.) selection, their sizing, and location within SDN.
1b. Off-line planning problem: Off-line (scenario/model-based) planning studies have been carried
out for a specific operational scenario, since practically a planning problem is an off-line problem.
Hence, scenario-concerned problems in coordination with ANM-based schemes are considered a
variant of the classification above.
2. Scheduling: Medium (seasonal–year) and short-term (one–several days) planning problem
studies have been carried out over a scheduled horizon (one day–a season–a year). The classification
primarily deals with scheduling problem of renewable/conventional sources (energy sources
assets) selection and demand forecasting within a SDN framework.
3. Real-time operational planning (RT-OP): The real-time (15 min–day) operational planning
problems have been studied over a short term operational horizon. The classification primarily
deals with operational planning problem of asset selection and topology alteration based on
state-estimation algorithms and communication-based signals. In addition, real-time operational
planning (RT-OP) has expected to be critical in complex real-time SDN operations.
This study aims to present a systematic review of distribution grid modernization from the
planning viewpoint. It offers an overview of the status of SDN planning by featured intelligent
technologies, anticipated functionalities, modern distribution concepts (MDC), policies, work maps,
related pilot projects and MOP as a real world planning option. This study should serve as a guideline
for researchers and planning engineers to formulate approaches, addressing future SDN planning
scenarios. In the literature, several methods are available concerning the planning of current power
DN and [10,12,14,23,26] and the abovementioned planning problems have been separately addressed.
The traditional planning methods may not be applicable to plan new DN models or transform
current DNs into SDNs [24,26]. In addition, few accounts are available in the literature that considers
grid modernization from the planning perspective of future distribution mechanisms. Hence, new
interconnected SDN concepts, exploitation of SG functionalities, key enabling smart technologies,
ANM schemes, multiple stakeholders, MOP as real-world planning problems and integrated planning
strategies; constitute the key features of modern SDN planning. Thus, SDN as a grid modernization
Energies 2017, 10, 501 5 of 45
Energies 2017, 10, 501 5 of 47
Figure 2. Overarching
Figure 2. Overarching Diagram of the
Diagram of the Smart
Smart Grid
Grid Package
Package (SGP)
(SGP) in
in the
the paper.
paper.
Energies 2017, 10, 501 6 of 47
include improving reliability, sustainability, stability and power quality. The research worthy issues
include; parallel inverter operation in MG, stability in large-scale centralized solar energy generation,
bidirectional power flow control, agent-based control and optimization of fault tolerance, respectively.
AssociatedάAnticipated
4.2. SG03AC \'{\textalpha}
Functionalities (SGAF) GREEK SMALL LETTER ALPHA WITH TONOS
03AE
4.2.1. Efficiency (ή) and Effective
\'{\texteta}
Management (EM) GREEK SMALL LETTER ETA WITH TONOS
03C5
4.2.3. Advanced υ Time
Real \textupsilon
Monitoring (ARTM) GREEK SMALL LETTER UPSILON
and low
Energies 2017,loaded
10, 501 feeders (partial LDN) [72]. The latter mode works under normal operation (complete
11 of 47
LDN) and can include other loop options to retain the quality of service [72,73].
Figure 3. An overview of various MDC (SDN) concepts: (a) ARDN and (b) LDN, respectively.
Figure 3. An overview of various MDC (SDN) concepts: (a) ARDN and (b) LDN, respectively.
Figure 4. An overview of various MDC (SDN) concepts: (a) MDN and (b) MG, respectively.
Figure 4. An overview of various MDC (SDN) concepts: (a) MDN and (b) MG, respectively.
Themulti-objective-based
The multi-objective-based independent
independent modemode transitions
transitions of MG ofinMG in offavor
favor of stakeholders
stakeholders is anotheris
another research dimension in SG environment and is required to be examined
research dimension in SG environment and is required to be examined [86]. Several pilot projects, [86]. Several pilot
projects,
notably CERTnotably
MG,CERT MG, hasto
has attributed attributed
addressing to various
addressing various
potential potential
issues [87]. Theissues [87]. key
possible Theenablers
possible
key enablers offered by SGP include ADA, high performance coordinated
offered by SGP include ADA, high performance coordinated protection (especially during islandingprotection (especially
during
and islandingtoand
reconnection reconnection
the main to the PE
grid), advance main grid), advance
for efficient PE for in
power control efficient
variouspower
modes,control
essential in
varioustechnologies
storage modes, essential storage technologies
and high-speed and high-speed
communication infrastructurecommunication infrastructure
for enabled support. The MG for
enabled support. The MG primarily depends on hardware innovations (in PE,
primarily depends on hardware innovations (in PE, storage, etc.). Normal trading in MG involves storage, etc.). Normal
trading
retail in MG involves
distributions. retail distributions.
The anticipated The anticipated
objectives include objectives
reliability, cost include
optimization, reliability, cost
voltage/frequency
optimization, voltage/frequency stability, improved efficiency
stability, improved efficiency and stakeholders’ satisfaction [17]. and stakeholders’ satisfaction [17].
5.5.Isolated
5.5. Isolated(Off-Grid)
(Off-Grid)Distribution
DistributionSystem
System(IDS)
(IDS)
TheIDS
The IDSconcept
conceptasasshown
shownin inFigure
Figure5a 5arefers
referstotothe
theapplications
applicationslike likestand-alone
stand-alone(SA)(SA)off-grid
off-grid
ruralelectrification.
rural electrification.The
Thenormal
normaloperating
operatingmode
modeof ofIMG
IMGisissame
sameas asthat
thatof ofislanded
islandedmode
modeMG. MG.IMGs
IMGs
can be generally classified in terms of stand-alone/(home and community-based)
can be generally classified in terms of stand-alone/(home and community-based) systems and isolated systems and
isolated distribution network based MG. Off-grid small-scale technologies are mainly
distribution network based MG. Off-grid small-scale technologies are mainly divided into conventional divided into
conventionalgeneration),
(diesel-based (diesel-based generation), non-conventional
non-conventional (small-scale hydro, (small-scale
solar, the wind,hydro, solar,and
storage) thehybrid
wind,
storage) and hybrid (both conventional
(both conventional and non-conventional) [16,88].and non-conventional) [16,88].
Thenormal
The normaldistribution
distributiontopologies
topologiesin inIMG
IMG(with
(withdistribution
distributionnetwork)
network)includes
includespassive
passiveradial,
radial,
active radial
active radial and
andactive
active(loop/mesh),
(loop/mesh), whereas
whereas AC/DC
AC/DC distribution
distribution systems
systems for for SA
SA homes
homes and
and
communities are separate [2]. However, voltage and frequency (V &
communities are separate [2]. However, voltage and frequency (V & F) regulation along with F) regulation along with
reactivepower
reactive powercompensation
compensation andand storage
storage system
system optimized
optimized operation;
operation; areare important
important research
research areasareas
[3].
[3]. The concerned key enablers in SGP for IMG are the same as that of a MG
The concerned key enablers in SGP for IMG are the same as that of a MG under islanded mode. under islanded mode.
5.6.Clustered/Multi-Micro
5.6. Clustered/Multi-MicroGrids
Grids(CMG/MMG)
(CMG/MMG)
TheCMG/MMG
The CMG/MMG concept concept asas shown
shownin inFigure
Figure5b5brefers
referstotoaagroup
groupofofMGs
MGsthat
thatoffers
offersnew
newways to
ways
cope
to copewith
withcontrol
controlcomplexity
complexityininnewnew distribution
distribution scenarios
scenarios and achieve certain
certain objectives
objectives notably
notably
powerquality,
power quality,reliability
reliabilityand
andmultiple
multipleDG DGplacements.
placements.The Thenormal
normaldistribution
distributiontopologies
topologiesin inMMG
MMG
includesloop
includes loop(for(for urban)
urban) and and
radialradial (for distribution
(for rural) rural) distribution mechanisms.
mechanisms. A detail discussion
A detail discussion regarding
regarding
MMG MMGcan
operation operation caninbe[89].
be found found in MMG
Still, [89]. Still, MMGhas
concept concept has not addressed
not addressed in detail. in detail.
The The
concept
concept
and offersand offers research
valuable valuabledirections
research directions
such as MG such as MG penetration
penetration (multi-DG(multi-DG
in each MG) in and
eachislanding
MG) and
islanding
within testwithin
MMG test MMG incorporating
incorporating features such features such upgraded
as; ADA, as; ADA, upgraded
protection,protection,
DSM, market DSM, market
support,
support, communication,
communication, AMI, ICT,AMI, ICT, PE, advanced
PE, advanced control,
control, storage storage technologies
technologies (STs), etc. (STs), etc.
Energies 2017, 10, 501 13 of 47
Energies 2017, 10, 501 13 of 45
Figure 5. An overview of various MDC (SDN) concepts: (a) IDS and (b) MMG, respectively.
Figure 5. An overview of various MDC (SDN) concepts: (a) IDS and (b) MMG, respectively.
Figure 6. An overview of various MDC (SDN) concepts: (a) VPP and (b) SH, respectively.
Figure 6. An overview of various MDC (SDN) concepts: (a) VPP and (b) SH, respectively.
Thesecurity
The securitythreats
threatshave
havegenerally
generallyclassified
classifiedintointopassive
passive(illegal
(illegalsystem
systemmonitoring)
monitoring)and andactive
active
(deliberate data
(deliberate datamodification)
modification)attacks.attacks. The
The intensity
intensity of of attack
attack depends
depends on on the
the violation
violation of of any
any
aforementioned objective and respective extent of impact from low/L-medium/M-high/H in SH to SGto
aforementioned objective and respective extent of impact from low/L-medium/M-high/H in SH
SG model
model (operation,
(operation, entities/stakeholders,
entities/stakeholders, components,
components, resources,resources,
etc.). The etc.). Theattacks
security security attacks
associated
associated
with with SH
SH normally aimnormally
at; energy aim at; energy consumption
consumption report (L-M),report
energy(L-M), energysignal
interchange interchange signal at
at HAN/WAN
HAN/WAN (M), interfering with a physical smart meter (L), alterations
(M), interfering with a physical smart meter (L), alterations to remote home monitoring and controlto remote home monitoring
and control
(L-H) (L-H) and impersonation
and impersonation attack for energy attack for energydata
consumption consumption data (L-M).
(L-M). Similarly, Similarly,
security attackssecurity
linked
attacks linked with SH-SG interaction aims at; DR signals at HAN/WAN
with SH-SG interaction aims at; DR signals at HAN/WAN (L-M), impersonating outage report (L), (L-M), impersonating
outage
false DGreport (L), false DG isolation-shutdown
isolation-shutdown report (M-H) and forward report consumer
(M-H) anddata forward consumer
to a third party data
(L-M).to a third
party (L-M).on security solutions and relevant approaches to effective countermeasures can be found
Details
Details
in [32,93], whereason security
modernsolutions
encryption and relevantstand
techniques approaches to effective
out amongst the mostcountermeasures
prominent. The aim can of
be
found in [32,93], whereas modern encryption techniques stand out amongst
these solutions is to attain maximum security objectives and ensure the intensity of malicious attacks the most prominent.
The aim isofthe
intensity these solutions
lowest possible is to attain
level. Themaximum securitydirections
future research objectivesassociated
and ensure withtheSHs
intensity
includeof
malicious attacks intensity is the lowest possible level. The future research
enabling automation to accommodate smart devices, harmonization of associated standards, security directions associated with
SHs include enabling automation to accommodate smart devices, harmonization
solutions to realize multi-functionalities, adaptable enough to predict and meet users’ requirements in of associated
standards,
an interactive security
manner, solutions
resultingtoinrealize multi-functionalities,
efficient operation in favor of adaptable
consumers’ enough to predict
bills and and meet
time [18,19].
users’ requirements in an interactive manner, resulting in efficient operation in favor of consumers’
5.9.
billsSmart Buildings
and time (SB)
[18,19].
This concept, like SH as shown in Figure 7a, concerns the efficient operation of SB and the
5.9. Smart Buildings (SB)
neighborhood. This concept is broadly spread across residential, commercial and industrial loads.
The SGPThis concept,SB
regarding like SH assmart
includes shown in Figure
building EMS7a, concerns
(SBEMS), theICT,
AMI, efficient operation
IoT, EV parking of SBDR,
lots, and the
load
neighborhood.
forecasting This concept
techniques, is A
etc. [94]. broadly
few SBspread across
objectives residential,
include reducingcommercial and industrial
GHG emissions, minimizeloads.
cost
The energy
with SGP regarding SB includes
optimization, real-timesmart building
pricing, EMS (SBEMS), and
EV accommodation AMI,REG/DG
ICT, IoT,integration
EV parking lots,
[95]. DR,
Also,
load forecasting techniques, etc. [94]. A few SB objectives include reducing GHG emissions,
minimize cost with energy optimization, real-time pricing, EV accommodation and REG/DG
Energies2017,
Energies 2017,10,
10,501
501 1515ofof4745
integration [95]. Also, SH and SB concepts under SG environment; allows consumers to participate
SH and SB concepts
in control, monitoringunder
andSG environment;
shaping allows
their energy consumers to participate in control, monitoring
demands.
and shaping their energy demands.
5.10. Smart Cities (SC)
5.10. Smart Cities (SC)
The SC is a futuristic concept as shown in Figure 7b, which besides being a new research area;
The
envisions SCaisdistributed,
a futuristic hierarchical
concept as shown in Figure 7b,structure
and autonomous which besides being
with the a new research
incorporation area;
of smart
envisions a distributed, hierarchical and autonomous structure with the incorporation
technologies for solutions to address challenges in large scale SDNs. The notable technologies for SC of smart
technologies
include; DER, forICT,
solutions to address
AMI, ADA, DSM,challenges in large
etc. [96]. The mainscale SDNs.
objective ofThe notable
the SC technologies
includes improvementfor SCin
include; DER, ICT, AMI, ADA, DSM, etc. [96]. The main objective of the SC includes improvement
performance and quality of urban electricity delivery. Moreover, other objectives include optimized in
performance
utilization of and quality of
electrical urban electricity
infrastructure for delivery.
demand Moreover,
management, otherminimization
objectives include optimized
of overall costs,
utilization of electrical infrastructure for demand management, minimization of overall
reducing GHG emissions, maximize power quality, benefit in terms of pricing, availability, and costs, reducing
GHG emissions,
reliability [20]. maximize power quality, benefit in terms of pricing, availability, and reliability [20].
Figure 7. An overview of various MDC (SDN) concepts: (a) SB and (b) SC, respectively.
Figure 7. An overview of various MDC (SDN) concepts: (a) SB and (b) SC, respectively.
6. Policies by Leading Countries, Work Maps & Pilot Projects (PWP) for SDN
6.Concepts
Policies by Leading Countries, Work Maps & Pilot Projects (PWP) for SDN Concepts Realization
Realization
An
Anoverview
overviewofofprominent
prominentleading
leadingcountries,
countries,with
withpolicies
policiesand
andwork
workmaps
mapspertaining
pertainingtotoSDNSDN
realization, are briefly shown in Table 1. The review of policies and work
realization, are briefly shown in Table 1. The review of policies and work maps around the maps around theglobe;
globe;is
isvital
vitalfor
forpaving
pavingway way forfor implementation
implementation of of
newnew concepts
concepts in various
in various SG SG domains.
domains. In addition,
In addition, pilot
pilot projects, test beds, and their findings are helpful in addressing SDN issues of various
projects, test beds, and their findings are helpful in addressing SDN issues of various natures. It is natures.
Itimportant
is important to to mention
mention thatthatany
anyplanning
planningprocess
process aims
aims towards
towards achieving maximization(↑↑
achieving maximization ) and
(↑↑) and
minimization ( ↓↓
minimization (↓↓) of certain objectives, respectively. The prominent countries regarding PWPhave
) of certain objectives, respectively. The prominent countries regarding PWP have
indicated
indicatedwithwith main
mainguidelines, major
guidelines, objectives,
major and core
objectives, andfocus
corerespectively. Please refer
focus respectively. to Section
Please refer 4to
(SGTF) and Section 5 (MDC), regarding core focus, respectively.
Sections 4 (SGTF) and 5 (MDC), regarding core focus, respectively.
An
Anoverview
overviewofofnotable
notablepilot projects
pilot onon
projects ground
groundwith relevant
with attributes
relevant andand
attributes future objectives
future to
objectives
be addressed are shown in Table
to be addressed are shown in Table 2. 2.
Energies 2017, 10, 501 16 of 47
- 20:20:20 objectives
- European energy policy - GHG emission reduction (20%↓↓) 4.2.1. DER controlled by Smart DSM
- 578 Projects (20%↑↑) 4.2.6. New Market Models
- REG Penetration
Euro-pean Union (EU) - Vision 2020 (20%↑↑) 4.2.7. Smart infrastructure progress
- Energy Efficiency (↑↑) 4.2.8. Multiple stakeholder decision- making
- [97–99] - Security and Power Quality (↑↑) 4.2.10. Consumer engagement [99] Associated pilot projects
- Smart Metering with high benefit to cost ratio
- National SG Technology and standards task force - REG Penetration (↑↑) 4.1. Research and development of SG technologies (SGET)
Canada - SG Canada - GHG Emission Reduction (↓↓) 4.2. SG awareness (SGAF)
- [7,109] - Security and Power Quality (↑↑) [109] Associated SG Pilot Projects
Energies 2017, 10, 501 17 of 47
Table 2. Cont.
4.1.1. SGCI (DG) 4.2.(1,9). Large REG penetration and decentralized electricity sources in
Model City Manheim/MW Energie
4.1.2. ICT unban DN (↑↑)
5/5.10. SCs [97,98]
(DE)/Germany/Nov 2008–Oct 2012 4.2.7. Large scale project deployment in two cities
4.1.3. ADA
4.1.8. CT 4.2.8. Show, translate & applied to other regions
Figure 8. An aggregated planning model for MDC concepts in SDN (adapted from [15,17,54]).
Figure 8. An aggregated planning model for MDC concepts in SDN (adapted from [15,17,54]).
The approach starts from top-to-bottom manner and deals with new long-term SDN planning
and implementation
The approach of new
starts from infrastructuremanner
top-to-bottom across and
the horizon (several
deals with years–1 year).
new long-term SDNLater,
planning
scheduling of available resources on preferential basis is followed over a scheduled
and implementation of new infrastructure across the horizon (several years–1 year). time horizonLater,
scheduling of available
Energies 2017, resources
10, x; doi: FOR on preferential basis is followed over
PEER REVIEW a scheduled time horizon
www.mdpi.com/journal/energies
Energies 2017, 10, 501 20 of 47
(year/seasons–1 day). Finally, the operational planning (real-time and off-line) is followed on the
short-term operational horizon (15 min–1 day).
The first step in a bottom-to-top approach is realizing real-time operational planning (RT-OP).
The distribution system operator (DSO) backed by state estimation algorithms, ICT (AMI and SMMT)
infrastructure (as discussed in Section 5.8), is capable of monitoring SDN systems in real time (RT),
during a short-term operational horizon. The DSO takes necessary actions by employing ANM
techniques, DR (on the very short term) and DSM (on the long term and large scale) to obtain certain
objectives and satisfy the system constraints, aiming at the optimal operation of SDN.
In RT-OP, MDC on the utility (discussed later in Section 8.2) or consumer side (SH and SB),
can also plan for supplying ancillary services, prominently; voltage control, active/reactive power
support, DER control, power factor (adaptive) control, network reconfiguration management, optimal
spinning reserve provision (with DR and ESS) and peak load reduction (with DSM).
Later, scheduling of available resources (DER, ESS, DR and EV) within each MDC on utility or
consumer side, is supported by multi-agent system (MAS) that integrates; forecasting techniques
(load, price, weather dependent DER), global information system (GIS), historical data aggregator
(market, utility, consumer consumption, DER, etc.) and MOP based optimization methods. This stage
of bottom-to-top approach needs to ensure; reliability, reactive power support, control, automation,
stability and emission reduction, across scheduled horizon.
Finally, long-term multistage expansion planning is followed, based on the futuristic smart
components reinforcement, demand side (load) and supply side (DER) requirements, respectively.
The main aim of aggregated planning approach is to ensure, overall short-to-long-term technical and
economic success of MDC, across all three planning horizons in SDN planning.
7.2. Current Status of SDN from the Perspective of Multiple-Objective Planning MOP
The MOP formulations are classified into two major types: The a priori class (MO + W) and a
posterori class (MO-P). In the a priori class, the multiple objectives transform into a single objective
function. Later, individual weights are assigned to each objective by the decision maker (user-defined)
preferences before execution of the optimization algorithm. In other words, in the MO + W formulation,
decision making precedes optimization to sort out trade-off (qualitative) solution among a set
of conflicting objectives. In the a posterori class (MO-P), optimization is preferred over decision
making to achieve realistic (quantitative) solutions among a set of potential solutions (Pareto frontier).
The decision maker then chooses a solution from the resulting Pareto frontier, on the basis of respective
preferences, also known as a posteriori articulation of preferences.
On the basis of a literature review of MOP, a detailed study is presented in Table 3, from the
viewpoint of the aforementioned MDC models and real world planning. The works in literature have
arranged according to reference, MDC model under SDN paradigm, decision variables, objectives
considered, major system constraints, test SDN, planning type (horizon-based), MOP formulations,
optimization methods and load characteristics (load level and profile), respectively. Furthermore,
from the readers’ comfort viewpoint, the information about MOP under MDC models have been
presented in a self-explanatory manner. For MDC (SDN concepts), please refer to Section 5 of this
paper. The decision variables have been indicated by type, number, size, and location in MDC concept.
The objective function indicates aimed multiple objectives in each reviewed work. The test SDN
indicates the work bench, which is used to validate respective idea under each MDC concept. Later,
planning types as shown in Section 2.3 have indicated. The major constraints that a problem must
abide, are also shown in detail for each reviewed work. Also, the reviewed works are shown in the
context of respective SGTF (in Section 4.1) and SGAF (in Section 4.2) respectively. The MO optimization
(MOO) techniques are shown with the respective classifications (in Section 7.2) and associated decision
making (DM) techniques, respectively. Finally, year of publication is highlighted with associated load
model and load profile (as load level or LL) in the respective MOO problem, as shown in Table 3.
Energies 2017, 10, 501 21 of 47
Minimize (↓↓): 1. Voltage & Power-flow limit - 2.3.1a. Long-term - (MO-P)/(Fast NSGA-II)
(10 years) planning/ - Jun 2014/
2. Feeder (current) capacity - Fast non-sorting genetic
1. Energy not supplied (ENS) - Probabilistic load
Multiple DG (Size + 3. Radial DN constraint4. - 4.1.1. SGCI (REG) algorithm II/
[122] 5/5.1. ARDN with conditional value at IEEE 13 bus ARDN (PLd)/
Location + Type) Cost constraints - 4.1.4. Storage (ESS) - Monte-Carlo simulations
risk (CVaR) - Probabilistic load
4. Budget constraints - 4.1.6. EV (MCS) for OPF (optimum
2. Expected global cost (Cg) level (PLL)/
5. Number of SG components - 4.2.1. Uncertainty power flow) framework
Minimize (↓↓):
1. Voltage limits - (MO + W)/ - Jun 2014/
Multiple 1. Overall costs (fix + variable) - 2.3.1b. Operational - MO seeker optimization - Constant load
2. Power-flow limit 54 Bus
Feeders (Size + Loc.), 2. CLLI (Reliability index) (Off-line) planning/ algorithm (MOSOA)/ (CLd)/
[123] 5/5.1. ARDN 3. Feeder (current) capacity ----------
Automatic Reclosers 3. Overall power loss - 4.1.3. ADA - Min-Max - Single load levels
4. Radial DN constraint 100 Bus ARDNs
(RAs) (Loc.) 4. Voltage deviation weighted aggregation (SLL)/
5. Standard component size
Table 3. Cont.
- (MO-P)/
Minimize (↓↓): - 2.3.1a. Long-term (10–20 - Loss Sensitivity to - Jan 2011 (2012)/
1. Voltage limits
33-Bus-ARDN years) planning/ identify MG area in DN - Time varying load
5/5.2. LDN/ Multiple DG + MG 1. Real power loss 2. Power-flow limit
[128] ---------- - 4.1.1. SGCI (DG), - NSGA-II for DG (TVLd)/
5/5.4. MG (Type + Size + Location) 2. Load voltage deviation 3. Feeder (current) capacity
69-Bus-LDN - 5/5.2. LDN (Number, location & size) - Multiple load levels
3. Annualized investment cost 4. DG capacity (P & Q) limit
- 5/5.4. MG in MG/ (MLL)/
- FDM (for final trade-off)
Minimize (↓↓):
1. Voltage limits - (MO + W)/ - Nov 2012/
1. Average voltage deviations 2. Power-flow limit - 2.3.1b. Operational - Genetic algorithm (GA)/ - Constant load
5/5.2. LDN/ Multiple DG 2. Total power (line) 3. Feeder (current) capacity Sample DNW with (Off-line) planning/ - Newton Raphson LF (CLd)/
[129]
5/5.3. MDN (Size + Location) lossesMaximize (↑↑): 4. Power-factor limit 3 Feeders - 4.1.8. DER Control - Single load levels
- DM: MCDA based
3. Total DG installed capacity 5. V-deviation by DG weighted method (SLL)/
1. Power balancing and storage - 2.3.1b. Operational - (MO + W)/ - Jan 2016/
M/(DG + ESS) 1. Voltage limits - Constant load
5/5.2. LDN/ facilities sharing (Off-line) planning/ - Graph-partitioning and
[85] (Num. + Loc. + 2. Power-flow limit 37 bus Test LDN (CLd)/
5/5.4. MG 2. Minimizing the interactions - 4.1.1. SGCI (DG), integer programming (IP)
Size + Type) 3. Feeder (current) capacity - Single load levels
among adjacent loops - 4.1.4. ESS integrated methodology
(SLL)
Table 3. Cont.
Table 3. Cont.
Minimize (↓↓):
1. Radial DN constraint - (MO-P)/(IB-MOPSO)
Multiple Protection 1. SAIFI - 2.3.1b. Operational - Aug 2014 (2015)/
2. Reclosers and switches on - Improved
[138] 5/5.4. MG devices 2. SAIDI 51 Node radial MG (off-line) planning/ - PLd/
same section binary multi-objectives-PSO
(Type + Loc.) 3. Total cost (Investment + - 4.1.9. Advance protection - PLL/
3. Fuses on laterals - Max-min approach
Interruption )
Objective function: - MO + W/
1. Cost constraints - 2.3.1b. Scenario based off-line - Fuzzy TOPSIS - Mar 2013/
Multiple 1. Leveled energy cost (LEC)
5/5.5. IMG, 2. Number of DG and ESS planning (design)/ technique + - Non-Controllable
[141] DG + ESS 2. Unmet load fraction (ULF) Test SA MG System
SA/IDS 3. Battery Limit - 4.1.1. SGCI (REG); - Fuzzy set theory/ and
(Type+ Size) 3. Wasted renewable energy
(charge/dis-charge rate) - 4.1.4. ESS - MCDM tool Controllable Load/
4. Fuel consumption
(level diagram)
Energies 2017, 10, 501 25 of 47
Table 3. Cont.
Multiple 1. Net present value (↓↓) 1. Cost constraints - 2.3.1a. Long- (5 years) - MO-P/ - Mar. 2016/
[146] 5/5.5. IDS DG + ESS 2. HDI (↑↑) 2. Number of DG and ESS Test SA IDS system - 4.1.1. SGCI (REG) - Primary: MOEA - Time varying load/
(Type + Size) 3. Job creation (JC) (↑↑) 3. DG/ESS code - 4.1.(4,5). ESS; PE - Secondary: GA/ - Multiple load level
Table 3. Cont.
- 2.3.2. Scheduling
1. Voltage limits - 2.3.3. RT-OP/
Overall performance index:
2. Power-flow limit - 4.1.7. Measurement, - (MO + W)/ - Nov 2013 (2014)
Multiple 1. Electricity Price 3. Feeder (current) capacity - Performance index based - Time-varying load/
MG Model and - 4.1.8. Control (MAS),
[149] 5/5.6. MMG DG + ESS 2. Environment effects (GHG) 4. DG capacity constraint weighting method - Multiple
MMG Model - 4.1.10. DSM/DR,
(Loc. + Type) 3. Service Quality (WSM) load level/
5. Power capacity constraint - 4.2.1. Energy management,
of MG - 4.2(1,3). Forecasting;
- 4.2.6. Market,
Table 3. Cont.
Maximize:
- 2.3.2. Scheduling/ - Aug. 2013/
Multiple 1. Supply & demand balance
1. Satisfactory Test 3 and 100 - 4.1/2. Communication - MO + W/ - Controllable load/
[154] 5/5.7. VPP DER + ESS 2. Line flow limits
profit valuesMinimize nodes VPP Model - 4.2/1,6 Centralized and - Weighting method (AHP) - Multiple
(Loc. + Type) 3. DER capacity limits
2. EENS decentralized dispatch load level/
- 2.3.2. Scheduling/
1. Lower and upper limits of - (MO-P)/
Maximize: - 4.1.1. DER, - Nov. 2014 (2015)/
Multiple generation units, - CPLEX solver (GAMS)
- 4.1.10. DR, - Fuzzy load/
[156] 5/5.7. VPP DER + DR + ESS 1. VPP BenefitsMinimize: 2. Ramps of the units, Test VPP Model iterative problem/
- 4.2.1. Management, storage - Multiple
(Loc. + Type) 2. VPP self-supplying cost 3. Regulation reserve needs, - ROM in GAMS
- 4.2.(1,6). Market management load level/
4. Intermittent generation - CPLEX as solver
(Emissions)
Energies 2017, 10, 501 28 of 47
Table 3. Cont.
1. Capacity constraints
2. Energy storage constraints - 2.3.2. Scheduling/ - MO-P/ - Dec. 2015 (2016)/
5/5.4., 5/5.8., Multiple 1. Minimize daily energy cost 3. Energy balances MG + smart - 5/5.4. MG, - MOO with ε-constraint/ - Time-varying load/
[161] 5/5.9., SH, DG + DR/price + Storage 2. Minimize CO2 emissions 4. Starting and finishing time building of 30 - 5/5.8. SH, - MILP model in GAMS - Multiple
SB, MG (ESS) homes using CPLEX solver load level/
5. Peak demand charge - 5/5.9. SB,
6. Demand charge
Energies 2017, 10, 501 29 of 47
Table 3. Cont.
Important Terms: BL-HMOEA: Bi-level hybrid multi-objective evolutionary algorithm, CHP: Combined heat and power plant, CCP: Chance constrained programming; DM: Decision
maker/making, FCM: Fuzzy clustering mechanism, FDM: Fuzzy decision making, GA: Genetic algorithm, GAMS: General algebraic modeling system, GHG: Greenhouse gases emission,
HAC: Hierarchical Agglomerative Clustering, HDI: Human development index, HMOGA: Hybrid Multi-objective optimization genetic algorithm, ICSP: Immune clonal selection
programming, ITLBO: Improved teaching–learning-based optimization, LC: Life cycle; LCEAC: LC equivalent annual cost, LCEI: LC environmental impact; LCEAC: LC annual equivalent
cost, LF: Load/Power Flow, MAS: Multi-agent system infrastructure, MCS: Monte-Carlo Simulations, MILP: Mixed integer linear programming, MOEA: Multi-objective evolutionary
algorithm, MONP: Interactive multi-objective non-linear programming, MOO: Multi-objective optimization, MRGA: Matrix real-coded genetic algorithm, NLP: Nonlinear programming,
NRCED: Nonrenewable cumulative energy demand, OF: Objective function, OPF: Optimum power flow, ROM: Reliability and operation model, RT-OP: Real-time operational planning,
SAPMS: Self-adaptive probabilistic modification strategy, SEMS: Smart energy management system, SUMT: Sequential unconstrained minimization technique, TOPSIS: Technique for
Order Preference by Similarity to Ideal Solutions.
Energies 2017, 10, 501 30 of 47
a. Analytical Methods
The prominent analytical techniques mainly include conventional load flows and sensitivity-based
methods. Newton-Raphson (NR) load flows are prominently employed in interconnected nature
(structure) SDNs, as shown in [125,129,150]. Sensitivity analysis methods have also been employed
in [127,128,158]; for potential initial solutions.
b. Numerical Methods
The noticeable numerical techniques addressed in the literature (Table 3) include; ε-constraint
method [121,135,161]; second order cone programming [124]; lexicographic method [135];
MCS [122,139,157]; OPF [158]; integer programming [85]; graph theory [85,150]; penalty factor
(funchion) method [130,140]; CCP [145,157]; compromise method [153]; ICSP [160]; linear
programming (LP) [164] and non-linear programming (NLP) [152,160]. Moreover, goal programming
(GOP), exhaustive search, sequential quadratic programming (SQP) and dynamic programming
methods have sucessfully employed in conventional DN related planning problems [26]. The noticible
numerical commercial (OPF) solvers employed include the DICOPT solver in GAMS to solve MINLP
problems [121,156] and MILP problem in [161]. In addition, the GUROBI solver is utilized to solve the
MISOCP problem in [124].
employed MH/AI techniques [26]. The prominent techniques include harmony search (HS), big
bang big crunch (BB-BC), artificial bee colony (ABC), immune algorithm (IA), simulated annealing
(SA), honey Energies bee mating
2017, 10, 501 (HBMO), ant colony optimization (ACO), bat algorithm (BA), differential 30 of 45
evolution (DE), gravitational search algorithm (GSA), shuffled frog leaping (SFL) and hybrid algorithms
employed MH/AI techniques [26]. The prominent techniques include harmony search (HS), big
respectively. Hybrid MH/AI methods results in efficient performance towards global solution aiming
bang big crunch (BB-BC), artificial bee colony (ABC), immune algorithm (IA), simulated annealing
at complex
Energies 2017, 10, 501 planning problems [26]. The use of the aforesaid methods, from
30 of 45 a future SDN planning
(SA), honey bee mating (HBMO), ant colony optimization (ACO), bat algorithm (BA), differential
viewpoint,
employed MH/AI
offers
evolution potential
(DE), [26].
techniques
research
gravitational perspectives.
search
The prominent algorithm
techniques (GSA),
include shuffled
harmony search frog
(HS), leaping
big (SFL) and hybrid
algorithms
bang big crunch (BB-BC),respectively. Hybrid
artificial bee colony MH/AI
(ABC), methods
immune algorithmresults in efficient
(IA), simulated performance towards global
annealing
7.3.3.
(SA), honeyDecision-Making
bee mating
solution (HBMO),
aiming Methods
ant colony
at complex optimization
planning (ACO),[26].
problems bat algorithm
The use of (BA),
the differential
aforesaid methods, from a future
evolution (DE),
SDN gravitational
planning search algorithm
viewpoint, offers (GSA), shuffled
potential researchfrog leaping (SFL) and hybrid
algorithmsThe decision
respectively. making
Hybrid MH/AI(DM) methods
methods results are vital, perspectives.
in efficient both as main
performance optimization
towards global algorithms and as a
means
solution of sorting
aiming outplanning
at complex a trade-off solutions
problems [26]. Theamong
use of theaaforesaid
set of multiple
methods, conflicting
from a future objectives. The prominent
7.3.3. Decision-Making Methods
SDNDM planning viewpoint,
techniques offers potential
addressed research
in the perspectives.
literature (Table 3) include weight methods that include both weighted
sum The decision making
(WSM) andMethods
product (WPM) (DM) methods
methods, are vital, both
respectively, as asin main optimization algorithmsThe
[132,139,140,148,149,157]. andanalytical
as a
7.3.3. Decision-Making
means of sorting out a trade-off solutions among a set of multiple conflicting objectives. The
hierarchy
The decision
process
makingDM
(AHP)
(DM)
has been vital,
methods are
employed
bothinasthe
for
main
both long and
optimization
short term
algorithms
SDN planning, as in [124,154].
andweight
as a methods that include
prominent techniques addressed literature (Table 3) include
Fuzzy
means decision
of sorting
both out
making
a trade-off
weighted
(FDM) is(WSM)
solutions
sum
among
among athe set most
and
popular
of product
multiple DM methods
conflicting
(WPM) objectives. methods,
andTheemployed
respectively, as in
in many studies,
prominent
mainlyDM duetechniques
to its addressed
ability to in the literature
address varying, (Table uncertain
3) include weight nature methodsand that includescenarios of the concerned
various
[132,139,140,148,149,157]. The analytical hierarchy process (AHP) has been employed for both long
both weighted sum (WSM) and product (WPM) methods, respectively, as in
problem. andThe FDM
short term aiming at MOP problems
SDN planning, has been employed
decisionin literature with is various variants
most and
[132,139,140,148,149,157]. The analytical hierarchyasprocess
in [124,154].
(AHP) has Fuzzy
been employed making
for both long (FDM) among the
andassociated
short term methods
popular
SDN planning,as as
DM methods inin[86,125,128,133,135,137,141].
and employed
[124,154]. in manymaking
Fuzzy decision studies, Other
Energies 2017, 10,
(FDM) 501 multi-criteria
mainly due to
is among theitsmost decision
ability to address analysis varying,methods 30 of 45
popular DMuncertain
addressed in this
methods nature
and study and
employed invarious
include
many the scenarios
min-max
studies, mainly ofduetheto concerned
approachits2017,
Energies
employed ability
10, 501
MH/AI problem.
[123,126,134,138,160];
totechniques
address Theprominent
varying,
[26]. The FDM rank aiming
Energies 2017,
techniques 10,at
order 501 MOP
include centroid
harmony search (HS), 30 of 45
big
uncertain nature and various
problems has scenarios
been employedof theinconcerned
literature problem.
with The
bang various
big crunchFDM aiming
variants
(BB-BC), at
and
artificial MOP
bee associated
colony (ABC), immune methods algorithm as in
(IA), simulated annealing
(ROC) in [136] and TOPSIS in [141], respectively. A detailed
employed MH/AIaccount of MCDA
techniques [26]. The prominent methods
techniques
employed MH/AI can
includebe found
techniques
(SA), honey bee mating (HBMO), ant colony optimization (ACO), bat algorithm (BA), differential
harmony search
[26]. The
(HS),
prominent
big technique
problems has been employed in literature Other
[86,125,128,133,135,137,141]. with various variantsEnergies
multi-criteria and
decision associated
10, 501analysis
methods as colony
in addressed
gravitationalmethods in crunch
this study
bang big crunch
2017, (BB-BC), artificial bee (ABC),
Energies bang
2017,immunebig
10, 501 algorithm(BB-BC),
(IA), artificial
simulated bee
annealing
colony
30 of 45(ABC), immune
in [168,169].
[86,125,128,133,135,137,141]. Other multi-criteria decision analysis (SA),
evolution
methods
(DE),
honey addressed
bee mating (HBMO),
search algorithm
in thisMH/AI
study
ant
(GSA),
colony optimization
shuffled
(SA), honey
(ACO),
frog
beebat
leaping (SFL) and hybrid
mating
algorithm
(HBMO),
(BA),antdifferential
colony optimization (A
include the min-max approach [123,126,134,138,160]; algorithms
evolution
employed
rank
(DE),
MH/AI
order
respectively. centroid
Hybrid
gravitational
techniques search
[26].
(ROC)
The
methods
algorithm in(GSA),
prominent
employed
[136]
results inand
evolution
techniques
MH/AI
TOPSIS
efficient
shuffled
(DE), frog
techniques
include
performance towards global
gravitational
leaping
harmony (SFL)
[26]. The search
searchand algorithm
prominent hybrid
(HS), big (GSA),
techniques shuf
includ
include the min-max approach [123,126,134,138,160]; rank order centroid solution(ROC)
aiming at in [136] and
complex TOPSIS
planning problems [26]. The use of the aforesaid methods, from a future
in [141],
7.4. respectively.
in [141], Analysis respectively.
ofAPotential A detailed
Methods
detailed account in MOP
of MCDA
account
Energies 2017, 10,of
methods 501 MCDA
Formulations bang
can beEnergies
SDN
found
methods
algorithms
big crunch
2017, canEn
respectively.
(BB-BC),
in10,[168,169].
planning 501
viewpoint, be
Hybridfound
offers
MH/AI
artificial
g potential
inmethods
bee colony[168,169].
bang
2017 10 research
501
(ABC),
bigresults
algorithms
crunch
immunein(BB-BC),
perspectives.
efficient
respectively.
algorithm performance
45 Hybrid
artificial
(IA),
30 of bee towards
simulatedMH/AI
colony global
methods
annealing
(ABC),
30 results
immune
of 45 in
algorith
solution
(SA), honey aiming bee at complex
mating (HBMO),planning antproblems
colony (SA), [26].
optimization
honey The
solution use(ACO),
bee ofaiming
mating the aforesaid at complex
bat
(HBMO), algorithm methods,
ant planning
(BA),
colony from problems
a future [26].(ACO),
differential
optimization The usebat o
Energies
Energies
2017, 10,
2017,
501
Energies
10, 501 Energies
2017,
SDN 10,2017,
501 10,(DE),
planning
evolution 501 viewpoint, offerssearch
gravitational potential Energies
research
algorithm Energies
2017,
2017,
10,
perspectives.
evolution SDN
(GSA),(DE), 501
10,
planning
shuffled501 frog
30 ofleaping
45
30search
viewpoint,
gravitational of 45offers 30
(SFL) ofand
algorithm45 30hybrid
potential ofresearch
45
(GSA), perspective
shuffled frog
employed MH/AI techniques employed
7.3.3. Decision-Making [26]. MH/AI The prominent techniques Methods techniques
[26]. The prominent include harmony techniques search include (HS),harmony big search (HS), big
7.4. Analysis7.4. Analysis
of Potential of Potential
Methods in MOPMethods
Formulations
Energies
Energies
2017, 10,
in
bang
2017,501
MOP
10,big
Energies crunch
501 2017,
Formulations
The analysis of potential methods in MOP formulation, aiming at optimized SDN planning, are
10, 501 (BB-BC), algorithms
bang
Energies artificial
big 2017, crunch respectively.
10, bee501 colony
(BB-BC), emp
Hybrid
(ABC),
artificial oyed MH/AI
immune bee MH methods
colony
algorithm A(ABC),
algorithms echn
results
(IA), immune
Energies
ques
respectively.
in
simulated
30 ofefficient
2017, 45
26annealing
algorithm
30
10,of501 45Hybrid
The
performance
(IA),
30
prom
ofMH/AI
45simulated
nen
towards
methods echn
annealingglobal
30results
of 45
ques nc ud
in efficient
employed employed MH/AI MH/AI
employed
techniques
employed
techniques
MH/AI The [26]. MH/AItechniques
[26].
decisionThe The
prominent
techniques
making prominent
[26]. The
techniques
(DM) [26].prominent
techniques
The prominent include techniques
include
employed
harmony
employed
techniques
harmony include
MH/AI
searchMH/AI
include
search
harmony
(HS),
techniques
techniques
(HS),
harmony
big search big
[26]. [26].
search
(HS),
TheThe prominent
big
(HS), prominentbig techniques
techniques incli
(SA), honey bee mating 7.3.3.
solution
(SA), (HBMO), Decision-Making
honey aiming bee at
ant complex
colony
mating Methods
bang planning
optimization
(HBMO), bmethods problems
gantcrunch
(ACO),
colony are vital,
solution
bat [26].
BB
optimization both
BC7.3.3.
The
aiming
algorithm as
use ar main
Decision-Making
atofcomplex
(ACO),
(BA), the optimization
aforesaid
c(IA), planning
abatannealing
bee
differential algorithmcoMethods
methods,algorithms
ony problems
(BA), from
ABC and
[26].
a future
differential as
Thea use ofathe
mmune gor afor
summarized, from the perspective of various performance indicators, in Table 4. The performance
The analysis The of potential
analysis methods in
of potentialMOP
employed
employed
bang bang
formulation,
methods big
evolution
MH/AI employed
MH/AI
crunch
big
in crunch
(DE),
techniques
bang
(BB-BC),
aiming
MOP
techniques
MH/AI
big
(BB-BC),
bang
gravitational
[26].
crunch
artificial
means
at The big
formulation,
SDN
evolution
techniques
employed
[26].
The
artificial
crunch
of
optimized
planning
The
(BB-BC),
search
prominent
bee
sorting
(DE),
[26].
prominent
MH/AI
colony
(BB-BC),
bee artificial
viewpoint,
The
colony
out
SDN
aiming
algorithm
gravitational
techniques
(ABC),
techniques a
prominent
artificial
techniques
bee
(ABC),
trade-off
planning,
offers
(GSA),
immune
colony
at
search
include
[26].
bee immune colony
optimized
potential
(ABC),
solutions
shuffled
techniques
include
The
algorithm
are
harmony
algorithm
(ABC),
research
algorithm SDN
prominent
immune
frog
harmony
bang
among
include
(IA),
bang
searchSDN immune
big
planning a(IA),
algorithm
simulated
perspectives.
(GSA),
leaping
harmony
big
techniques
search
employed
crunch
set
(HS),
crunch
simulated
of algorithm
planning,
viewpoint,
shuffled
(SFL)
(HS),
big
(BB-BC),
search
annealing
multiple
and
MH/AI
(BB-BC),
includefrog
big
simulated
(IA),
offers
artificial
hybrid
(HS), are
leaping
techniques
harmony
artificial
conflicting simulated
potential
big
annealing
bee
(SFL)
bee
search
[26].
colony
annealing
objectives.
research
and
colony
The(HS),
(ABC), (ABC),
The
perspectives.
hybrid
prominent
big
immuneimmune
technique
algoral
(SA),(SA), honey honey
bee(SA), mating
bee honeymating
(SA), (HBMO), honey
bee(HBMO), decision
mating ant
bee colony
mating
ant making
(HBMO),colony SA
optimization
(HBMO), (DM)
ant
optimization
colony methods
honey
ant(ACO), colony are
bee
optimization
(ACO), bat vital,
ma
optimization
(SA),
algorithm
bat (SA), both
ng
(ACO),
algorithm
honey honeyas
The
HBMO
(ACO),
(BA),
batmain
bee decision
bee
(BA), optimization
algorithm
mating
differential
bat
mating an making
differential
algorithm
(HBMO), co methods
(BA),
(HBMO), ony(DM)
algorithms op
differential
(BA),
antant methods
colony
differential
colonyand
m includeza are
as
optimizationavital,
on ACO
optimization both(ACO), as
(ACO m
ba
prominent DM techniques addressed inin(IA),the literature (Table 3)efficient
include weight that
indicators include sub-optimizations in MOP formulations, respective execution (implementation and
summarized,summarized,
from the perspective of various
from the perspective big performance
bangbang crunch
big algorithms
Energiescrunch
evolution
bang (BB-BC),
Energies
2017,
evolution
big
(BB-BC),
of (DE),
various
10,
2017, 501 indicators,
respectively.
crunch
artificial
10,
(DE), 501
evolution
artificial
(BB-BC),
gravitational
algorithms
beeHybrid
bang
performance
means
gravitational
evolution
both(DE),
7.3.3.
in
colony
bee
big of
search
Table
artificial
colonyMH/AI
crunch respectively.
(ABC),
sorting
gravitational
(DE),
weighted
Decision-Making search
bee 4.
(ABC),
(BB-BC),
algorithm
gravitational
The
methods
colony
immune
indicators,
out
algorithm
sum
a
search evo
performance
Hybrid
immune
(GSA),
Methods (WSM)
results
artificial
(ABC),
algorithm
trade-off
u bat
search
algorithm
(GSA),
MH/AI
algorithm
immune
on
bee
in
solutions
shuffled
efficient
DE
algorithm
shuffled
and
methods
colony
Table algorithm
(GSA),
(IA),
frog
simulated
grav
performance
(ABC),
among
evolution
product
7.3.3. frog
(GSA),
leaping
results
simulated
4.
shuffled
bang
The
evolution
(IA),
means
a immune
annealing
set
a(WPM)
leaping
Decision-Making ona
shuffled
(SFL)
in
big
(DE),
frog (DE),
towards
simulated
annealing
crunch
performance
of
of (SFL)
algorithm
multiple
sorting
and search
gravitational
leaping
frog 30 performance
global
annealing
(BB-BC),
out
of
gravitational
methods,and
hybrid
Methods
(IA),
conflicting
leaping4530
(SFL)
hybrid a
of
a methods,
gor
artificial
simulated
trade-off
45
search
and
(SFL)
search
respectively, hm
towards bee
objectives.
hybrid
annealing
solutions
algorithm
and GSA
algorithm
hybrid
as
global
colony The (ABC), aimmun
among
inshu
(GSA),(GSA), ed
shuffled set
shuffled of
ro f
solution aiming at(HBMO),
complex solution planning aiming problems
at complex [26]. planning
The use problems
of the aforesaid
[26]. The methods,
use of the
from aforesaid
amating
future from ainclude
future
indicators include sub-optimizations in(SA), MOP (SA),
honey honey
bee (SA),
formulations,
algorithms
mating
beehoney
algorithms
mating (HBMO),
respectively.
bee mating
respective
algorithms
respectively.
ant
(SA),
prominent
algorithms
Hybrid
colony
ant
(HBMO),
honey
respectively.
Hybrid
colony
execution
MH/AI
optimization
DM bee
respectively.
ant
MH/AI
optimization
mating
Hybrid
colony
techniques
methods
(HBMO),
(ACO),
optimization
(implementation
methods
Hybrid
MH/AIresults
(ACO),
addressed MH/AI
results
antalgorithm
methods
bat
in
in efficient
colony
in
(ACO),
the algorithm
methods
efficient
results
optimization
(BA),
bat
literature
performance
algorithms
results
algorithm
(BA),
(SA),
algorithms
in
differential
prominent
(Table
performance
efficient
differential
honey
(ACO),
3)
inrespectively.
(BA),
efficient
towards
bee
include
DM
respectively.
performance
towards
bat
differential
algorithm
techniques
weight
performance
global Hybrid
global
Hybrid
(HBMO),
towards methods (BA),
addressed
MH/AI towards
MH/AI
global
ant
differential
that in
methods
colony
the
methods
global
optimization
literature
results
results in(Table
efficie
in effi
(A
3
coding), and computation cost, solution quality, initial parameter dependence (tuning complexity)
indicators include sub-optimizations evolution
evolution SDN
(DE),
employed evolution
(DE),
employed in
planning
gravitational
MH/AI MOP
gravitational viewpoint,
(DE),
MH/AI search
techniques
mp oyformulations,
[132,139,140,148,149,157].
SDN
gravitational
evolution
search
techniques
both offers
planning
dalgorithm
MH
The [26].
weightedpotential
algorithm
A (DE),
search
[26].
decisionThe viewpoint,
(GSA),
hn
The
prominent
qu
sum
making respective
research
gravitational
algorithm
(GSA),
prominent a
shuffled Thegor
offers
shuffledanalytical
perspectives.
(GSA),
techniques
(WSM)
(DM) Th hms
potential
search
frog
techniques
methodsp execution
frog
om
and
hierarchy
respec
shuffled
leaping research
algorithm
leaping
include
n are n (SFL)
include
product frog ve
harmony
vital,Thehn (implementation
process y
perspectives.
(GSA),
(SFL)
leaping
evolution
and
harmony
qu
both
both (WPM)
decision Hybr
and
as
(AHP)
shuffled
hybrid
search
n (SFL)
ud
weighted
ofmain
d
hybrid
(DE),
search
making
has
(HS),
h
methods,MH
frog
and been
mony
optimization
(DM) A
gravitational
leaping
(HS),hybrid
big
sum
employed
big me (SFL)
respectively,
methods (WSM) h hods
algorithms search
HS
for
are and both
resu
andbalgorithm
avital,
and g
long
hybrid
as s
product
both in
as[26].
aThe n
as e
(GSA),
main c
(WPM)en
shuf
optim
and coding), and computation cost, algorithms solution solution
algorithms
bang
solution
quality,
respectively.
bang
big
aiming
algorithms
respectively.
crunch
aiming
big crunch
√
solution
at complex
initial
Hybrid
atsolution
respectively.
bHybrid
(BB-BC), ng
complex
MH/AI
aiming planning
parameter
and
algorithms
(BB-BC),
b g MH/AI
artificial
short aiming
Hybrid
un
at
planning
methods
artificial
complex
term problems
methods
atdependence
respectively.
hsorting
bee BB MH/AI
complex
SDNproblems
results
colony
bee
BC
planning [26].
planning,
results
colonymethods
(ABC),inso
planning
[26].
The
Hybrid
problems
efficient
uin
(ABC),
use
The
as
results
efficient
bimmune on MH/AI
problems
(tuning
inof
use the
[26].
performance
aony
immune m
osolutionsin
ofaforesaid
[124,154]. the
The
performance
efficient
methods
ng
algorithm
ABC
[26].
solution
aforesaid
aSDN
algorithm
use solution
The
Fuzzy of
methods,
towards
comp
mmun
the
use
performance
results
(IA),
aiming
algorithms
towards
a(IA),
methods,
aforesaid
aiming
decision
exglobal
simulated in
the
from
atmaking
aforesaid
efficient
complex
global
at
from
towards
amethods,
complex
future
respectively.
pviewpoint,
simulated
go annhm a ng
annealing A
a(FDM)
future
planning
methods,
performance
global
prob
annealing mu
planning
from
Hybridis aamong
ems
problems
from
future
problems
towards
danalytical
nnMH/AI
26research
future
the
The
ng
[26].
most
global
methodsuse
The
use use
of the
results
oprocess he ain
of th a
o
and coding), and computation cost,
and application. The performance indicators have shown with desired requirements, as best ( ),
SDN SDN
planning planning solution
viewpoint,
SDNviewpoint,
planning
SDN means
offers
popular quality,
[132,139,140,148,149,157].
planning of
viewpoint,
offers
potential
DM potential
viewpoint,
methods initial
out
research
offers research
and
The
apotential
trade-off
offers parameter
analytical
perspectives.
employed potential
perspectives.
research hierarchy
inresearch
means dependence
among
perspectives.
many
process
of [132,139,140,148,149,157].
perspectives.
SDN
studies, planningsorting
set
planning
mainly
(AHP)
of out
multiple
due (tuning
has
viewpoint, been
trade-offoffers
toatitscomplexability
employed
conflicting
offers Thesolutions
potential
to potential
address
for
objectives. both
among hierarchy
research
varying,
long
Thea set
perspectives.of
perspectives.multiple (AH
complexity) and application. The performance solution
solutionindicators
aiming 7.3.3.
(SA), aiming
solution
(SA),
honey at have
atDecision-Making
complex
honey complex
aiming
bee mating
bee shown
planning
SAatmating 7.3.3.
planning
complexMethods
solution
hon problems
(HBMO),
and with
yDecision-Making
problems
(HBMO),
short
prominent DM techniquesbplanning
aiming desired
ant
m
term[26].colonyat
ant
ng[26].
problems
The
SDN complex
colony
HBMO requirements,
use
TheMethodsof
use
optimization
planning, [26].
planning
the of
optimization
addressedn aforesaid
The
the
as o use
(ACO),
inony as
aforesaid
problemsofmethods,
(ACO),
op
[124,154].
in ng the
batm
the prominent methods,
aforesaid
[26].
algorithm
literaturebat
Fuzzy onfrom
The
solution
algorithm
and ACO
(Table from
methods,
use
a future
(BA),
decision
short of aiming
a b the
future
(BA), from
aforesaid
differential
term
making go a future
differential
SDN hm
(FDM) methods,
BA
planning, planning
is damongas from in n problems
a
the future
[124,154].
most [26].
Fuzzy The use
decisio o
complexity) SDN pscenarios
ann ofvthe ewpo nDMotechniques 3)ers include po addressedweight
en aFDM methods
researchin the literature
that include
perspec (Table ves 3) include
(❉)andandapplication. The performance indicators have shown with desired requirements,
uncertain nature and various concerned problem. Theas aiming at MOP
better/average ( ) and poor (×) as indication metrics, respectively.
best (√), better/average poor (×)SDN as SDN
planning
planning
evolution
indication
7.3.3. SDN
viewpoint,
evolution
The
7.3.3. viewpoint,
planning
(DE),
metrics,
decision
Decision-Making offers
(DE),
Decision-Making
7.3.3. viewpoint,
offers
potential
gravitational
vo
respectively.
making SDN
both potential
gravitational
u on
popular
Decision-Making
7.3.3.
Methods
problems
planning
(DM)
The
Methods offers
DE research
search DM
weighted
Decision-Making gresearch
decision potential
search
methods
has Methods
vviewpoint,
perspectives.
algorithm
methods
been
perspectives.
sum
making
are research
algorithm
on and
Methods
employed vital,offers
(GSA),
employed
(WSM)
(DM) bothperspectives.
(GSA),
h potential
shuffled
inmethods
go
as shuffled
in
and
main
literature
hm research
many frog
are GSA
both
product frog
leaping
studies,
optimization
vital,
7.3.3.
with
perspectives.
SDN
leaping
hu
popular
weighted
7.3.3.both mainly
(WPM)
Decision-Making
various
planning
(SFL)dmain
algorithms
as
Decision-Making (SFL)
DM
variants
og
and
due
sum viewpoint,
and
hybrid
methods
to
methods, pits
optimization
and
and
ng
(WSM)
Methods hybrid
ability
as and
Methods aSFL
associated
offers
employed
to
respectively,
and ndpotential
address
algorithms hyb
methods
product in d
varying,
and many
as research
asasin astudies,
in
(WPM) perspective
mainly
metho
best (√), better/average (❉) and poor algorithmsalgorithms
means of (×)respectively.
as
sorting respectively.
go
indication Hybrid
hm
uncertain Hybrid
[132,139,140,148,149,157].
out [86,125,128,133,135,137,141].
means
a trade-off p
MH/AI
of metrics,
nature
sorting MH/AI
v
solutions ymethods
Hyb methods
outrespectively.
and d
various
among results
MH
The analytical
a trade-off results
A in
scenarios
a set m efficient
solutions in
hod efficient
of
of hierarchy
multiple performance
the
among u performance
concerned n
uncertain
[132,139,140,148,149,157].
process
conflicting
a setanalysis towards
(AHP) n
problem.towards
p
nature
of objectives.
multiplehasTheglobal
o m
and
beenThe global
n various
FDM
analytical
employed
conflicting
The ow d
aiming g
scenarios
hierarchy ob at
for bothprocess
objectives. MOP
ofThe (AHP) has bp
long the concerned
7.3.3.7.3.3.
Decision-Making The
Decision-Making
7.3.3. decision
The decision
Decision-Making
Methods making
MethodsThe makingdecision
(DM)
7.3.3. The
Methods (DM)
decision
methods
making
Decision-Making methods making
are
(DM) vital,
are 7
methods
(DM)
Methods 3
vital,
bothOther
3 Dec
methods
both
as are multi-criteria
main s
vital,
as on
are
main Mak
optimization
both
vital, decision
optimization
as ng
bothmain
The Me
The
7.3.3. algorithms
asdecision hods
optimization
main
decision
algorithms
Decision-Making methods
optimization
making
and making algorithms
as
and (DM)
a addressed
as
(DM)
algorithms
a
Methods methodsand
methods in
as this
are
and
a are study
vital,
as vital,
a both both as main
as main op
solution solution
prominent aiming aimingat
DM potential complex
o at
u
techniques complex
on
problems
and
prominent planning
m
short has
addressedngplanningterm
DM problems
ompbeen
inSDNproblems
techniques x
theemployedp[26].
planning,
literaturenn [26].
Theng
addressed p use
inThe
(Table ob ofuse
as literature
in in mthe of
[124,154].
3) the aforesaid
the
includeand Th
withaforesaid
literature short
Fuzzy
weightu methods,
various o
problems
term
(Table methods,
h
decision
methods from
variants
SDN ohas
3) include from
making
that a d
future
been
and
planning, m a
include future
hod
employed
associated
(FDM)
weight as methods om in
inis[124,154].methods
among u u
literature
thatthe Fuzzy as
most
include in
with
decision various makin va
Table 4. Brief comparison review of the merits and means demerits
means of of
of planning
sorting sorting
means out means
aof
outinclude
trade-off
sortingaapproaches
of the
trade-off
sorting
out min-max
solutions applied
asolutions
out
trade-off approach fora SDN [123,126,134,138,160]; rank order centroid (ROC) in solutions
[136] and TOPSIS
Table 4. Brief comparison review SDN
The decision
The both of
SDN
decision the
planning weighted
making
The makingmerits
viewpoint,
decision
(DM) SDN
viewpoint,
sum
(DM)
methods
making and
pbothoffers
nn
methods (WSM)
The ng demerits
offers
potential
[86,125,128,133,135,137,141].
popular v
DM
weighted
(DM)
are decision wpo
potential
vital,
aremethods
and
methods n
research
vital,
both oamong
sum
making
aresearch
of
and
trade-off
product
both
are
as
among
main
solutions
potential
perspectives.
po Other
employed
(WSM)
vital,
(DM)
as mainnset solutions
a multi-criteria
(WPM)
optimization
both
methods
of
perspectives. set
among
multiple
of multiple
inmain
and many
optimization
as hamong
are
apmeans
approaches
popular
methods,
product
set
conflicting
pmeans
studies,
algorithms
optimization
vital,
of
a[86,125,128,133,135,137,141].
decision conflicting
DM
algorithms
both
set
of
multiple
v of
sorting
mainly
of
methods
objectives.
respectively,
(WPM)
andas
The
sorting
multiple
applied
analysis
algorithms
main
as
and
conflicting
due
objectives.
decision
abe
out
asand
out
methods aconflicting
toa its
methods,
optimization
The
trade-off
a trade-off
for
employed
asand
objectives.
ability
making in
as
The
addressed
a(DM)
objectives.
toOther
inaddress
respectively,
algorithms
solutions
many
The
in
methods
among
multi-criteria
this
studies,
The
varying,
and
among
asstudy
are
a decision
mainly
asinavital,
set
a set of of
bothdueas
mult
analm
tomi
planning. Table 4. Brief comparison reviewprominentprominent
ofout DMmerits
the techniques
prominent
DM techniques andin
prominent
include
[141],
addressed
DM demerits respectively.
techniques
addressed
theDM in
techniques
min-max theofin
addressed A
literature
the
potential
approach
detailed
literature
addressed in
(TableThe
the account
(Table3)dec
literature
in
approaches the of
include
[123,126,134,138,160];
sinclude
on
MCDA
3)literature
(Table mak
weight
prominent methods
prominent
weight
applied(Table
3)include
rank
ngDM
methods
include 3) DM
can
methods
DM
forinclude
techniques
weight
that me
found
techniques
SDN include
that
weight hods
methods in
include
addressed
methods are
[168,169].
addressed
that v
include
inthat aand
the
in the bo
include
literature h as(Table
literature ma (Table n op
3) inclu
3) in
means means [132,139,140,148,149,157].
of sorting
of means
sorting ofaout sorting
trade-off
a trade-off outuncertain
[132,139,140,148,149,157].
means
solutionsaThe solutions
trade-off
of nature
analytical
sorting
among and
hierarchy
solutions
among aout set avarious
ofThe
among process
trade-off
set multiple
of scenarios
analytical
multiple (AHP)
a solutions
set of
conflicting uncertain
ofhierarchy
has thebeen
conflicting
multiple
among concerned
processemployed
objectives.
conflicting
means setorder
nature
aobjectives. ofthe
(AHP)
ofThe centroid
min-max
problem.
and for
multiple
sorting various
hasboth
objectives.
The been
out(ROC)
The approach
long scenarios
aFDM
employed
conflicting
The in [136]
trade-off [123,126,134,138,160];
aiming of
for
objectives. the
bothat
solutions TOPSIS
concerned
MOP
long
The amongproblem. rank
a setorde of
SDN planning. prominent
prominent
both
7.3.3.
DMand
both weighted
7.3.3.
short
prominent
techniques
DM
weighted
Decision-Making
term
techniques
bothsum
Decision-Making
DM SDN
addressed
both
weighted
sum
in (WSM)
Methods
D
planning,
techniques
addressedand
prominent
in
weighted
Methods
[141],
problems on
short
the
(WSM) M
addressed as
sum
term
and
inrespectively.
has
literature
theDM
kinng been
and
sum
M (WSM)
product
[124,154].
SDN
literature
techniques
in(Table
hod
A
employed
the
product
(WSM)
means
detailed
planning,
(TableFuzzy
literature
3)
and
addressed
include
(WPM)
3)in as o(WPM)
and
product
account
literature
decision
includein
(Table sor methods,
product
of
[124,154].
weight
in the
3)
weight ng
MCDAmethods,
(WPM)
both
problems
making with
include
methods
literature
both
ou
Fuzzy
methods
respectively,
(WPM)
methods
in
various
(FDM)
weight
weighted
has
prominent
that
(Table
methods,
weighted
respectively,
a[141], rade
been
decision
is can
variants
include
that among
methods
3)
methods,
osum
respectively.
be
employed
includemaking
include
DM
as
respectively,
sum
found
and
the
that so
techniques
as
in
weight
(WSM)
urespectively,
in
A (WSM)
associated
most
(FDM)
include
in
ons
in[168,169].
detailed
literature
is among
methods
addressed
and
asaccount
among and
methods
inproduct
with
that
as product
the
in of in
avarious
as
most
include
the se
MCDA (WPM)
in ovariants
literature
(WPM)
mu
methods
(Tablean
me pca
3
Methods in MOP planning. Computation [132,139,140,148,149,157].
[132,139,140,148,149,157]. 7.4.
[132,139,140,148,149,157].
The Analysis
Parameter
[132,139,140,148,149,157].
analytical
The analytical of Potential
hierarchy
Thehierarchy Methods
analytical
The process
analytical in
process MOP
hierarchy
(AHP) Formulations
hierarchy
(AHP)has
process been
has
[132,139,140,148,149,157].
process
[132,139,140,148,149,157].
(AHP)
been
employed employed
(AHP)
has been forhas both
for
employed
beenboth
longTheemployed
long
The analytical
foranalytical
both forlonghierarchy
both hierarchy
longprocess process (AHP) (AHP ha
Execution both bothweighted popular
weighted
both sum
The decision
TheSolution
DMweighted methods
sum (WSM)
decision making (WSM) [86,125,128,133,135,137,141].
popular
and
sum
both
making
Th and
(DM) demployed (WSM)
and DM
weighted
(DM) product
methods
on m in
product
methods kandngmany
are sum
(WPM) and
vital,
DMare Application
prom
studies,
product
(WPM) (WSM)
vital,
mbothOther
employedmethods,
hod nen
mainly
both
as (WPM)
methods,
main inDM
multi-criteria
and
as many
due
main
v toechn
studies,
respectively,
product
methods,
optimization hability
respectively,
optimization
bo ques
[86,125,128,133,135,137,141].
itsdecision both m mainly
(WPM) naddressed
analysis
to address
respectively,
as
algorithms weighted
asdue
in
algorithms
op m methods
tovarying,
methods,
in
and its
on
as as
sum
and ango
Other
ability as he
addressed to
hmaddress
respectively,
(WSM) erand
inamulti-criteria inure this
and varying,
as Tab
decision
study in eanalysis
product 3 nc (WPM)ude
meth
Formulation Efficiency (ή)
and shortand short termterm and
SDNshort SDN
planning,
and term
planning,
short (PI)
SDN
asterm inas planning,
[124,154].
SDN in of [124,154].
planning, as
Fuzzy in Fuzzy
[124,154].
asdecision
inMOP decision
[124,154].
Fuzzy
making making
Fuzzy
and
decision
(FDM)
and short(FDM)
decision
shortmaking
isAnalysis
term
amongterm
is making
SDN
among
(FDM)
SDN
the planning,
most
(FDM)
the
planning,
is amongmost isasamongin
as
thein [124,154].
inmost [124,154].
the most Fuzzy Fuzzy decision
decision mak m
7.4.
include The
Analysis analysis of Potential potential Methods methodsin in MOP
Formulations formulation, 7.4. aiming of at optimized
Potential Methods SDN planning,
MOP are
Formulations
Sensitively AnalysisMethods
(A) in MOP
Easy (E) Efficient
uncertain
[132,139,140,148,149,157].
[132,139,140,148,149,157].
means
(less) (√)means of sortingnature
[132,139,140,148,149,157].
of
Simple The
sorting
Computationm
out
Computation
(√)
and
analytical
The naoutuncertain
various
trade-off
oFlat/No o the
[132,139,140,148,149,157].
analytical a The hierarchy
trade-off ng min-max
scenarios
nature
analytical
hierarchy
solutions
(N) ousolutions and
process of approach
dthe
among various
hierarchy
process (AHP)
bo
SimpleThe
o concerned
among (AHP)
h o[123,126,134,138,160];
scenarios
aanalytical
process
has
set
RDN uawe
Parameterbeen
on
ofhas problem.
(AHP)
been
setmultiple
ghof of
mong include
hierarchy
employed the
employed
has
multiple
ed The
beenthe
conflicting
sum rank
concerned
process
for min-max
oFDM order
[132,139,140,148,149,157].
both
employed
for
conflicting mu (AHP)
both
long pcentroid
aiming
problem.
objectives.
WSM approach
long
has
foron atboth
objectives. been
The(ROC)
The
MOP
and [123,126,134,138,160];
long
ng FDM
employed
The The
ob inproduc
[136]
aiming
analytical
vfor and both
Th atTOPSIS
MOP rank order
hierarchy
long
WPM processcentroi
me (A ht
popular
Execution popular DM methods
DM popular
methods popular
and DM employed
and
summarized, methods
DMemployed methods
in
and
from many
Solution in
employed
theand
manystudies,employed
studies,
perspective in mainly
many mainly
in studies,
of many
due
various to
due studies,
its
mainly
popular
toability
popular
its
performance mainly
ability
due DM
to DM
address
tomethods
todue
itsmethods
address
indicators,
Application ability
tovarying,
itsand ability
to
varying,
inand employed
address
Table employed
to4.addressvarying,
The in performance
many
invarying,
many studies,
studies, mainlymainly duedu
Methods in MOP Formulation andExecution
short
and short problems
term
prominentand
term
SDN short
prominent SDN
DM hasterm
planning, been
planning,
techniques
DM p SDNas
techniques
om in
employed
and
in
n [141],
problems
planning,
as [124,154].
addressed
n short
in
DM
The respectively.
inhas
[124,154].
addressed term
analysis literature
as
hnFuzzy
in inSolution
been
SDN
the
qu [124,154].
Fuzzy
in
of A
employed
with
decision
literature
the dd
potential detailed
planning,decision
literature various
Fuzzy
making
(Table
d in
methods account
as
n Parameter
literature
making
(Table
h 3) variants
decision
in (FDM) of
[124,154].
include
in 3)MOP MCDA
in
(FDM)
include
u [141],
(PI)
with
and
making
is among
Fuzzy
weightT ismethods
respectively.
various
associated
and
among
(FDM)
weight
b
formulation, decision
the
methods short
n
The can
Application
variants
most
is
the
methods
ud
aimingamongbe
methods
term
that
analysis A found
making
most
w detailed
and
SDN
include
that
atgh theas in
(FDM) inaccount
most [168,169].
associated
planning,
include
m
optimized
of potential hod isSDN h of
among
methodsas MCDA
methods
n in
planning, udthe methods
as
[124,154].
in most
MOP are Fuzzy can decisio
in formulation, be fou ai
Formulation
Easy (E), uncertainuncertain nature Efficiency
nature
uncertain
and uncertain
Efficiency and
various (ή)
nature
(and
indicators various
)many scenarios
nature
and scenarios
include various
and of the various
of 132
scenarios
concerned
the 139
scenarios
concerned of 140(PI)
the
problem. 148
of the149
concerned
problem. uncertain
The
concerned157
uncertain
The
FDM
problem. FDMThe
nature
aiming
problem.
nature Theana
aiming
and atand
FDMyThe
MOP ca
various
atexecution
various
aiming
MOP
FDM hscenarios
erarchy
aiming
scenarios
at MOP atprocess
of of
MOP
thethe concerned AHP proble
concerned has
pro
NR LF (A), OPF Solvers (N) High
popular
popular(×)
DM both methods
DM popular
both Better
[86,125,128,133,135,137,141].
methods
weighted andDMemployed
weighted (❉)
and
methods
bosum employed
h popular
sum w Flat/No
[86,125,128,133,135,137,141].
in gh
(WSM)
summarized, Other
employed
inDM
(WSM) (N)
dmany studies,
methods
andfromum insub-optimizations
multi-criteria
studies,
and Interconnected
many
mainly
product
the and
WSM decision
mainly
product
perspective Other
studies,
employed
due (WPM) to
due
nd DN
mainly
its
(WPM)
of toin
multi-criteria
analysis
in
p
MOP
ability
its
many
odu due methods
ability
methods,
various
formulations,
decision
toperformance
studies,
toaddress
methods, its addressed
to respectively,
WPM address
popular
abilitymainly
summarized, analysis
varying, respective
tovarying,
DM
respectively,
m inmethods
address
due
hod
indicators, methods
this
to
from asits study
varying,
in ability
as
thein pand
Table addressed
invemployed
perspectivetoyThe
4.
(implementation
address inofthis in studyperformance
varying,
nmany studies, mainly
Sensitively Analysis(A) (A) Easy problems
(E) problems has
Efficientbeen
has
problemsbeen
employed
problems
(less) employed
and
7.4.hasAnalysis √
(√) been
inhas
coding), literature
employed
inbeen
Simple
of literature
and
Potential employed
with
(√)in
computation √ with
andliterature
various
Methods invarious literature
Flat/No
shor
in variants
cost,
MOP with variants
various
(N) with
solution
erm and
Formulations problems
SDN various
and
associated
problems
variants
passociated
quality, has
variants
Simple
ann and
has
methods
been
initial
ng been
associated
methods
RDN and
employed
as
parameter
as employed
associated
n in as
124 methods
inin in
literature
dependence
154 methods asperformance
literature
Fuzzyinvarious
with
as with
(tuning in
decvarious
various
onvariants
s concerned makvarian in
n
Sensitively Analysis (A) uncertain
uncertain
Easy include
nature uncertain
natureand the
[132,139,140,148,149,157].
(E) andmin-max
various
nature
[132,139,140,148,149,157].
Efficient various approach
(less) include
scenarios
and uncertain
scenarios
The
indicatorsvarious
( the
of [123,126,134,138,160];
analytical
The) min-max
nature
thescenarios
of
analytical
include concerned
the and
hierarchy
Simple Th approach
concerned
ofvarious
hierarchy
(
sub-optimizations the
problem.
nprocess
) rank
[123,126,134,138,160];
yconcerned
problem.
process horder
scenarios
(AHP) The
Flat/No in (AHP) of7.4.
centroid
problem.
The
FDM
has
hy
MOP pthe
been
(N) oAnalysis
FDM
has aiming(ROC)
been rank
concerned
Theuncertain
aiming
employed
formulations, AHP
indicators
of
atin
FDM Potential
order
employed [136]
MOPh atfor
Simple centroid
problem.band
aiming
nature
MOP
respectiveboth
include
Methods
fornRDNTOPSIS
and
at
both (ROC)
The
long
mp MOP
oyin MOP
various
longFDM
sub-optimizations
execution din o[136]Formulations
aiming and
scenarios
bo h
(implementation ongat
in TOPSIS
MOP
MOP of theformulations,
ε.Const.; GOP; SQP; MILP Difficult Easy [86,125,128,133,135,137,141].
(E), [86,125,128,133,135,137,141].
[86,125,128,133,135,137,141].
[86,125,128,133,135,137,141].
complexity) Other Othermulti-criteria
and multi-criteria
Other
application. decision
multi-criteria
Other decision
The multi-criteria
analysis
performance analysis
decision
methods [86,125,128,133,135,137,141].
methods
decision
analysis
[86,125,128,133,135,137,141].
indicators addressed analysis
addressed
methods
have in methods
shown this in
addressed
study
this
with addressed
study
Other
desired in
Other this
multi-criteria
multi-criteria
instudythis
requirements, study decision
asdecision analysis
analysi mr
problems
problems
High has
(×)
and in [141],
problems
been
has been
short
and respectively.
employed
Better
short
term has
employed
term
SDN(❉) been
nd in
SDN Aho
in
planning,
and detailed
[141],
literature
problems
employed
in Flat/No
planning, literature
coding),
The m
asrespectively.
account
with
has
(N)
SDN
in
analysisinas[124,154].
literature
been
with
in
andp of of
various MCDA
Linear,Ang
various
employed
[124,154].
nncomputation
potential detailed
popu
variants
with
Fuzzy methods
variants
Complex nvarious
Fuzzy in account
ar
decision
methods and DM
cost, can
literature
(❉)and
decisionin of be
me
associated
variants
makingFuMCDA
solution
MOP found
hods
associated
with
making yand
(FDM)
d methods
inand
methods
various
quality,
formulation,
The [168,169].
and
problems
associated
(FDM)methods
analysis on
is coding),
among
m can
emp
variants
as kin
isof
initial
aiming has be
as
methods
among
ng the
potentialfound
oyed
in
been
and
FDM
parameter
and
at most in
n [168,169].
many
associated
employed
as
thecomputation
optimized most
methods inmong
dependence
SDN in sMOP
in ud
methods es
literature
hplanning,
mo
cost, asma
(tuning
solution
formulation, arein
with nrank
yvarious
due
quality,
aiming oco
va
ini
at
NR(N)LFNR(A),LFOPF
(A), Solvers
OPF Solvers
(D)(N) (N)[86,125,128,133,135,137,141].
Easy (E), include
(A) includethe min-max
theinclude High
min-max
High (×)
approach
include
the
( × approach
best ) min-max (√),the Better
[123,126,134,138,160];
min-max
[123,126,134,138,160];
approach
better/average Better (❉)
approach[123,126,134,138,160];
(
(❉) ) rank
and Flat/No
[123,126,134,138,160];
rank
order
poor Flat/No order
(×) (N)
centroid
as rank
centroid
(N)include
indication (ROC)
order Interconnected
include
rank (ROC)the
in
centroid
order
metrics, the
[136]
min-max
in min-max
centroid
Interconnected [136]
and
(ROC)
respectively. TOPSIS DN
approach
and (ROC)
approach
inTOPSIS
[136]
DN in
[123,126,134,138,160];
and[136]
[123,126,134,138,160];
TOPSISand TOPSIS rank order order cent
(A)
[86,125,128,133,135,137,141].
popular [86,125,128,133,135,137,141].
popu DM methodsDM m Other
popu Other
hod
and [86,125,128,133,135,137,141].
multi-criteria
employed
DM
complexity) nd multi-criteria
mmpOther hod oy
andindecision
multi-criteria
many decision
dapplication.
ndn analysis
mstudies,
mp ny oy analysis
Other
decision
ud
The methods
dmainly nm multi-criteria
mmethods
analysis
ny n addressed
due y ure
ud
to
du addressed
methods
its odecision
m in
ability [86,125,128,133,135,137,141].
nbthis addressed
yto in
duanalysis
ystudy
this
address study
o oshowndd methods
in bthis
varying, study
vyTable oaddressed
yos ngdd o4.Other inmulti-criteria
ythis
vperformance ng study decision ana
Difficult in 7.4.
[141],
inAnalysis
[141],
respectively.
respectively.
inPotential
[141], summarized,
Aindetailed
respectively.
[141],
A Analysisdetailed
respectively.
account Afrom
account detailed the
ofFormulations
MCDA
Aof perspective
detailed uncer
MCDA
accountmethods ofaperformance
account
methods of
n
MCDAcan various
na
ofbecan
MCDA
methods
found indicators
summarized,
beperformance
in and
found
[141],
methods
in can complexity)
var
[168,169].
[141],in have
from indicators,
ous
respectively.
be[168,169].
respectively.
can
found bethe and
inscenar
found Aapplication.
with
perspective
in
[168,169].
detailed desired
Aindetailed
[168,169]. of
accountTherequirements,
various
The he
account performance
performance
ofconcerned
MCDA
of MCDA as indicators
methods
methods canhave
indicators,
prob em
can
be fb
MCS; OPF; CP; MINLP
GOP;(N) SQP; MILP (N) include
include
the
Difficult min-max
theinclude
uncertain
(D) unmin-max n ofn
approach
the
nature
Complex approach
min-max
and
u
Highun
(√) 7.4.
Methods
[123,126,134,138,160];
include
[123,126,134,138,160];
approach
various
(nd× )nFlat/No
v(√),
n ou the in(N)
scenarios MOP
of
ubetter/average nd Potential
[123,126,134,138,160];
min-max n v rank
o approach (Methods
rank
oorder
ofsub-optimizations
the
ou
Non-Linear order
concerned
)hand centroid
onin MOP
n [123,126,134,138,160];
rank
ocentroid
(√) n order
(ROC)Formulations
oproblem.
indmeritsp(ROC)
hMOP centroid
obin [136]
minnTh
onformulations,
The [136]
(ROC)
include
and
rank
FDMdmetrics, TOPSIS
and
order
pLinear,
FDMob inthe
aiming TOPSIS
[136]
m centroid
min-max
mTh atand
ngMOP TOPSIS
FDM (ROC)
approach
MOP ( )m in [136]
ng [123,126,134,138,160];
and
MOP TOPSIS rank orde
BriefBetter Flat/No (N) Complex
ε.Const.;ε.Const.; GOP; SQP; High (×)
(D) MILP in [141], Difficult best
indicators include (❉) poor (×) as indication
indicators best include(√), better/average
respectively.
respective
sub-optimizations execution (❉) and in poor
(implementation
MOP (×) as indicationrespective
formulations, metrics,
in [141],
respectively.
respectively.
problems in
p [141],
ob A
has
m been
h High
respectively.
detailed
A detailed
p b (×)
account
employed
ob n inmA account
mp[141],
Table 4.
detailed
h of
oy in respectively.
MCDA
b d of Better
account
MCDA
literature
n mp
comparison
methods (❉)
oyof
methods
A
with
u MCDA
d
prob
w √
detailed
can
review
various
n h be can
v
ems
Flat/No
methods
found
of the
account
be
variants
ou
u
has
foundin
w
v (N)
can
of h
been
[168,169].
MCDA
in
be
and
nv
and demerits
[168,169].
found emp
Linear,
methods
associated
ound in vin [141], oyed
of potential
Complex
[168,169].
o n can
respectively.
methodsd ndbe
m
n found
hodaso
era
approaches
(❉) in√in
A ure
[168,169].
detailed
d n m
w
applied
hod
hforvar
account
SDN
n of ousMCDA var an
methods s ac
(N) (N) (D)
7.4. 7.4.The
Analysis analysis
Analysisof Potential
7.4. of 7.4.
of Potential
Analysis andMethods
potential
Methods coding),
The methods
inanalysis and inofMOP computation
potential
informulation, methods cost, insolution
aiming MOP and at7.4. coding),
quality,
formulation,
optimized and
initial
SDN of computation
aiming parameter
planning, at Methods
optimized are cost, dependence
SDN solution
planning, (tuning
quality,
are initial para
MCS;
[GA; PSO; EA]OPF; CP; MINLP
(1), TS Difficult (D)
[86,125,128,133,135,137,141]. High (×Analysis
) ofOther Potential
planning.
Table O
MOP
of in Potential
MOP
Methods
multi-criteria
4. h Brief
Formulations
Complex
mu
Formulations
comparison
Methods
O (hMOP
86
decision d
inFormulations
)review
125
mu
MOP Flat/No
128
analysis
on
of
Formulations
the n133 methods
y
meritsd (N)
135 m
and
7.4.
on
Analysis
137
hod
Analysis
addressed
demeritsn 141 y dd
of
Table
of m
Potential
Non-Linear
O in
potential
4.
Potential
her
hod
this
d
Brief n mu
study
h dd (Methods
approaches
comparison ) cr
udy
in
d
MOP
in MOP
er
n
applied
review h a
Formulations
dec
for
of
Formulations
udy
the
SDN s on
merits ana ys s me
Easy (E) High/Code (×) summarized, Betterfrom (❉) thesummarized, N/Y, Y, -, and
complexity)
perspective Yoffrom various Complex
application.
the perspective
performance (❉),performance
The LP (√)
ofindicators,
various complexity)
indicators
in Tableand
performance have application.
shown
4. indicators,
The performance with
inThe desired
Table performance
4. The requirements, indicators
performance as have shown p
and demerits of w
(MH/AI) Difficult The analysis
The hanalysis
ofof npotential
The of analysis
potential
The methods
analysis
nofhmethods
potential
in ofpp
MOPpotential
inFormulations
omethods
MOP
formulation, formulation,
methods inin MOP aiming
inoformulation,
MOPaimingatformulation,
optimized
at optimized
The
aiming The analysis
SDN aiming
analysis
atnnSDNoptimized
planning,
oofd atplanning,
potential
of optimized
potential
are
SDN √
methods
are
planning,
SSDN
methods planning,
inTOPSare
MOP
in MOP formulation,
areformulation, aimingaimi
MINLP (N)7.4. Analysis
7.4. Analysis
of Potential
7.4.
n ofthe
Analysis
PotentialMethods Methods
Potential
in MOP
x7.4.in (hMethods
Analysis
MOPFormulations Formulations
inofin
xMOP
Potential (Methods MOP Formulations o7.4. Analysis of (Potential Methods in MOP SFormulations
include ud min-max m n m
approach
ud pp Methods
m MOP Computation Parameter
[GA; PSO; MCS;EA] (1), TS
OPF; CP;(MH/AI) Easy (E) indicators High/Code
include High (×)best
sub-optimizations
indicators × (√),)o[123,126,134,138,160];
planning. m Complex
better/average
include
Formulation
Better
in MOP (√)hformulations,
(❉)
sub-optimizations nc andrank
ude
) Execution order
Flat/No
poor nkhe
N/Y, (×) centroid
m d
as n nY
-,max
Y,indication
(N)
inrespective
MOP best
Efficiency
(ROC)
nk
oexecution
(√), d
formulations,
(ή)
ROC
approachdin [136]
planning.
Complex
Non-Linear
better/average
metrics,Solution and 123
respectively.
(implementation
respective TOPSIS
ROC
(❉) nd
(√)),126 TOPS
LP
and npoor
execution
(PI)
(134 ) 138 nd 160
(×)(implementation
as indication
Application rank orderrespectiv
metrics, cen ro
Improved variants (1) Difficult (D)
summarized,
in summarized,
[141],
and n from
respectively.
coding),
summarized,
p and
from
the
n vA summarized,
perspective
the
detailed
y A
computation
and
perspective
d from
p
coding), account the
of
v
d from various
y
cost,
perspective
of
A the
oun
of various
d MCDA perspective
operformance
MCDA
d √performance
of various
methods oun m ofindicators,
o various
hod
can performance
MCDA indicators,
be n performance
foundb m in
summarized,
Table
summarized,
ound
hod
in indicators,
in[168,169].
Table
n4.nindicators,
Theb 4.
from in
performance
Thefrom
ound Table
theperformance
in
the
n perspective
4.
Table
perspective
The√ 4.
performance
The of various
performance
of various performance
performance indicato
indic
High/Code The(×)
The analysis analysisof Complex
The
potential
ofanalysis
potential (√)of
methods methods
potential inYes
The MOP (Y)
in
analysis
methods
MOP inand
formulation, solution
computation
inComplex
formulation,
of potential
MOP aimingquality,
system
formulation,
methods
aiming atcost, initial
(√)
optimized solution
atEfficient
inComputation
optimized
aiming
MOP parameter
SDN quality,
formulation,
at y optimized
SDN
planning, dependence
initial
planning,
The aiming
SDN
are
analysis parameter
planning,
are at (tuning
optimized
of potential aredependence
SDNmethods planning, (tuning
in MOP are formulation, ai
Improved variants
(MH/AI) [GA; PSO;(1)EA]
(MH/AI)
(D) Difficultindicators
(1), TS summarized, (D)indicators High/Code
include include
indicators
sub-optimizations
indicators ×
sub-optimizations
include
Methods
(Sensitively
) Formulation
Table include Analysis MOP
Complex
sub-optimizations
in
4.performance
Brief MOP in(A)
sub-optimizations
comparison MOP (nformulations,
formulations, Easy141
)review
in MOP
Execution (E)
of
respec
Yes
inrespective
formulations,
MOP respectiveve
(less)
(Y)formulations,
indicators(√)
execution A de
indicators
executionSimple
4. Complex
respective ainclude
Methods
include (√)ed
(implementation
respective
Solution
inaccoun
MOP
Parameter
Flat/No
system
(implementation
execution
sub-optimizations (N)
sub-optimizations
execution ( oof)Execution
(implementation MCDA Simple
(implementation
in MOP
in and
Application me
RDN
MOP hods
Computation
formulations, can be
formulations, respec ou
resp
Solutio
summarized,
Easy complexity)
from
(E) summarized,
from andperspective
the perspective
the application.
from complexity)
the
summarized,
ofNR ofThe
perspective
various various and
performance
from application.
ofperformance
various
the indicators
perspective
indicators,The
performance
Easy indicators,
(E),
N/Y, ofinthe
performance
have merits
Efficiency
shown
various
Y,Table
indicators,
in Table
-,quality,
Y
and Table
(ή) 4.demerits
indicators
with
4.performance
The desired
inperformance
The Brief
summarized,
Table of
have
performance
4. comparison
potential
Formulation
requirements,
shown
indicators,
The from approaches
with
performanceinreview
(PI)
the desired
as
Table
√(N) perspectiveapplied
4.the The merits for
requirements,of SDN
performancevariousdemerits
Efficiency of potential
(ή)
asperformance ap
in
HS; TLA; BB-BC; ABC Average and
7.4. and
coding),
Analysis Ancoding),
of High/Code
and
andP
Potential and
computation
coding),
and
Ann
Methods (×)
computation
coding),
M LFand
Sensitively (A),
in
planning. P cost,
MOP Better
computation
OPF and
n cost,
MOP
Analysis solution
Solvers
Formulations
M (❉)
computation
solution
F
(A) (N)mu quality,
cost,
n MOP
Easy quality,
n solution
cost,
(E) Finitialmusolution
initial
parameter
High
Efficient n and
parameter
(×)
(less)quality,
and Complex
initial
(√)
planning.coding),
dependence
coding),
initial
parameter
Better
Simple dependence
Sensitively and
(❉)
(√)(❉),and
parameter
AnalysisLP
computation
(tuning
Flat/No (√)
dependence
computation
Flat/No (tuning
(A) (N) dependence cost,
Easy (tuning
cost,
Simple
(E) solution
Interconnected (tuning
solution
RDN DNquality,
Efficient quality,
(less) (√) initial
initial
Simple p
HS; TLA; BB-BC; (MH/AI)ABC (MH/AI) indicators Average
indicators
Average (A)
best
include
(❉) (√),
indicators
include Average
better/average
sub-optimizations
Bettersub-optimizations
include
(❉) ( in
best
(❉) )-,(√),
sub-optimizations
indicators and
N,MOP inbetter/average
Y, poor
MOP
include (×)Better
Yformulations, formulations,
in MOP ( )respective
assub-optimizations
indication
(❉)
Non-Linear (A)
andrespective
formulations,metrics,
poor (√)-,(×)inN,
execution
MOPY,
respectively.
as Yformulations,
indication
respective
execution (implementationmetrics,
execution
indicators
(implementation Non-Linear
respectively.
respective
(implementation ( )
include sub-optimizations
execution (implementation in MOP formulations, r
(MH/AI) (A)
and andcoding),
complexity)
coding),
complexity)
and
and and
The analysis
Th
andcomplexity)
coding),
computation
application.
n of
and application.
computation
yand
complexity)
potential
oTh cost,
and
po
and
ε.Const.;
computation
NR
Theapplication.
cost,
coding),
nLF solution
(A),
nmethodsy m
performance
Theandperformance
GOP;
solution
OPF o
application.
SQP;
cost,
hod
in
poand √
quality,
Solvers
MOP
MILP
n n
The
quality,
computation
solution
(N)
MOP
7 indicators
indicators 4hod
performance
The
initial
formulation,
m
Easy
o
Ana
Difficult
initial
performance
quality,
mu
have
(E),
parameter
n
yMOP
cost,
have
parameter
aiming
on
oHigh
indicators
shown
initial
solution
o
m
Po
shownindicators
with
dependence
atmung
nMethods
complexity)
have
parameter
(×)
aand
complexity)
with
desired
dependence
optimized quality,
op
on NR
m
M
shown
have
desired
m
hod
requirements,
and
(tuning
LF
SDN
shown
coding),
Better
with
and
dependence
initial
ng
d (A), (tuning
(❉)
SDN OPF
planning,
op
n
requirements,
application.
desiredMOP
application.
with
parameter
p and
Solvers
Flat/No
m nn
as
desired
(tuning
are
Fo
requirements,
The
computation
ng
d(N)(N)
SDN
asThe mu
performance
dependence
p nn
a ng
requirements,
Easy performance
(E), on
as indicators
cost,
Interconnected (tuning
asindicators
solution
(❉) (×) quality,
DN
High
have have show
Better
sh
ini
Pa(
IA;HBMO; Improved
SA; HBMO; variants (1) Difficult ×Brief
), (× Methods in MOP
× (A) Computation in MOP Parameter
×SDN ,×
Linear,
(A) Complex
Computation
IA; SA; BFO BFO (MH/AI) D, E, A, bestA (√),
best (better/average
better/average
(√), 4. best
High/Code
Tableapplication. ),best
(√),
comparison(better/average
(❉) ),(√),
(×) ( review
and
(❉) )better/average
poor
and4.(N) poor
(×)(❉)
Complex ( as,comparison
(×) ,(❉)
indication
and as (√),and
poor
indication
and )demerits
(×) (D)
Execution asN/Y,
metrics,
poor metrics,
indication
(×)
Yes N/Y,
respectively.
as
(Y) indication Y,
respectively.
metrics,
best -demerits
best(√),
metrics, Complex(
respectively.
Complex(√),
better/average
better/average
Solutionrespectively.
system ,(❉) ,(❉) and
Execution
(√) and ) poor
poor (×) (×)
as
Applicationindication
as indication metrics,
metrics,
Solution respec
res
complexity)
complexity) and complexity)
application.
and √,d❉, and ×)
The application.
performance
Thecomplexity)pTable
performance Formulation
pThe Brief
of h-the
indicators
and
vperformance pmerits
oindicators
application. have review
oo❉,
indicators
vhave
shown
The shown of
❉,nofthe
performance
with potential
×)
have merits
Efficiency
with
desired
ndshown and
oapproaches
(ή) nFormulation applied
of potential for Tapproaches
(PI) as applied Efficiencyfor n SDN (ή)
(MH/AI)
D, E, A, A
(MH/AI) (×), (×), (❉), summarized,
(D) (❉) umm (❉, from
planning.
the
umm
om perspective
hN/Y,ε.Const.;
MCS;
dN/Y,
Sensitively OPF; CP;
planning.
om
GOP;of Y, various
SQP;
MINLP(A)
Analysis
vMILP
(N)
p
performance
ou
Complex(×, p Difficult
Easy The vm
(E)
indicators,
ou
ana p
ysodesired
High
Efficient
indicators
in
m
s(×) orequirements,
(less)
with
Table
po
Sensitively
(√)
ncomplexity)
requirements,
Tnddesired
4.bhave
The
ε.Const.;
enBetter
Complex
Simple
Analysis ao(❉) as
shown
requirements,
GOP;
(√) me
(√)
(A)
and
performance
Th as
nSQP;
p
hodsapplication.
with
boMILP
Flat/No
Flat/No
mdesired
Easy(N)
nTh
n(E)
(N) MOP pThe requirements,
Difficult
Linear,
operformance
m
ormu
Non-Linear
Efficient
Simple Complex
(less)
RDN aHigh
(√)
(√)(❉)on
asindicators have
(×) am
Simple (√) ng
BetteraFla(
BA; DE; SOA; GSA (MH/AI) A,(√),
best A,better/average
best D,
(√), Abetter/average
best
indicators nd (√),
TableTable (
include
o
4. Brief ),
n (
better/average
(❉) and
(❉) ),
4. comparison
BriefTable (
poor
and ×
comparison),
best
sub-optimizations
ud
nd ubopoor
(×) (
(❉)
4.Table op (√),
review )
as
n
Brief 4.
(×)
and
m indication
better/average
ud
review
as
comparison
of
poor
(N)
Brief in
on
theofub Better
indication (×)
MOP
op metrics,
comparison
merits n as
thereview MOP
m ( )
indication
(❉)
metrics,
formulations,
merits
and demerits
of
respectively.
and
on
o
review
and
(D)
mu
thedemerits
respectively.
poor
n
merits
metrics,
ofoftheMOP Y,
(×)
on -,
as
respective
potential
and
merits Y,
o
of potential mu
demeritspY
respectively.
indication
and execution
approaches v on
demerits
best
approaches
ofTable x
potential
TableComplex
metrics, u(√),
applied
of
better/average
respectively.
(N)
(implementation
p on
4. potential
Brief
4.
applied v
approaches
Brief
for mp system
comparison
SDN x m
comparison
approaches
for SDN u n on (
(❉)on )
mp and (D)m poor n (×)on as indication metrics,
BA; DE; SOA; GSAHS; TLA; BB-BC;
(MH/AI) A, A, D, ABC
A (❉), (❉), Average
(×),
and (❉)coding),
nd Better
od ngand (❉) nd
computation
nd od ompu
NR Y,
[GA;
ng LF -,(A),
Y,cost,
PSO; ndYEA]
on
OPF (1),
ompu
o Complex
TS
solution
Solvers o
(N) u summar
on √ Easy
quality,
on system
Difficult
o qu
(E), zed
(❉)
initial
oy u n
on rom
parameter
High qu
NR p
(×) LFy hem
(A), perspec
dependence
n
OPF Better d
Solversp
(❉) nd m
(N) ve n oapplied
(tuning
Flat/No
Easy
d un
review
var p
(E),review
(N) √ng
applied
nd
for of
ous n
SDN the
Difficult
offor
per the
merits
Interconnected
High
SDN
un
merits
ormance
(×)ng
andand
DN
demerits
demerits
Betternd(❉) of potentia
caof pote
orsFla
ANN; SFL; Hybrid (MH/AI) Difficult Methods
planning. planning. Average
in MOP planning. (❉)
MCS;
planning.
(×of Methods
OPF; CP; Better
in MOP
MINLP (❉)
Computation
(N) Easy (A) -,
(E) N, Y, Y
Computation
High
High/Code Parameter
(×) (×) planning. Non-Linear
MCS;
Complex
planning.
Better OPF; (❉) (√)CP; (√)
Parameter
MINLP
Flat/No
N/Y, Y,(N) (N)
-,
(A)( ) Y Non-Linear
Complex (❉), (√)
LP High
(√) (×) Complex
4.(D) High/Code ) the Complex of(nd )review Y, -, Yapplied Complex system
(MH/AI) (A) Execution (MH/AI) Execution
(D) Solution SolutionApplication (D)Application
Difficult TableTable Brief 4.omp
complexity) comparison
Brief
Tablecomparison
Formulation
xand y4. Brief
review comparison
application.
nd omp review
ppofxthe Table
yThemerits
on review merits
4.and
Formulation
nd Brief
performance
Th ofdemerits
and
the
comparison
merits
demerits
Efficiency (ή) ofca
potential
and demerits
potentialors
approaches
of the of nc ndude
approaches
vmerits
potential
Efficiency and sub
approaches
o(ή) applied
demerits
(PI) hfor hvop SDN for
Table m
ofapplied
SDN za
potential
4. wBrief hons
for approachesnnd MOP
dcomparison
SDN
m(PI) applied
review mormu for
of
n the SDN a ons
merits respecof v
and demerits p
ANN; SFL; Hybrid (MH/AI) High/Code (×) Sensitively
Methods Complex
Methods√
in MOP in√(√)
MOP
Methods
ε.Const.; Y,
[GA;
Improved
Methods
in MOP Yinpp
GOP;
-,PSO; pSQP;
EA]
variants
MOP
o TS
(1),MILP
on
m
(1)
Computation √indicators
Complex nTh
Computation √ nd
p
Difficult
system
Difficult
ohave om
Computation
nhshown
(√) High
Computation
hownwith
ε.Const.;
(×)
Parameter
wdesired
Parameter
GOP;
Methods
d hown
[GA;
Better
Methods
requirements,
SQP;
in
dMILP
PSO;
(❉)
Parameter
MOP
in
qu
EA]
MOP Flat/No
Parameter
as
(1), Difficult
TS√ (N) √ qu
Linear, High Complex
(×)
Computation
Computation (❉) Better (❉) Fla(
(D)(DM) Analysis (A) Sensitively
Easy (E) Analysis Efficient(A) (less) (√)
Easy (E)Simple Efficient
(√) (less)
Flat/No (√) (N) Simple (√)
Simple RDN
Flat/No (N) Simple RDN
WSM; AHP;IA; SA; TOPSIS
FDM; HBMO; BFO E,planning.
E, A,planning.
bestA (√), planning.
√ (b ), (b v), (❉)
b better/average (√g),Execution
band (❉ planning.
poor nd
Executionv(N) (×)g×
poo as ❉ indication
Execution nd ndandpoometrics,
Execution on
(D)
cod m Solution
Solution High/Code
respectively.
ngnd
(ή) Y,and
on m(×)
p Solution vcompu Comp
ySolution
(N) planning.
Better
Complex (❉) ex
(√)
pApplication
a(MH/AI) ×y N/Y,
vApplication
on cosYesY,(Y)
× -, Application
(D) YExecution
Execution Easy
Complex
so u Application
(E) (❉),
onEfficiency system
qua
LP (√)
High/Code
(ή)y(ή) n a
(×)Solution Better
Solution par
❉, ×) ❉, ❉, ×)
(MH/AI)
WSM; AHP; FDM; TOPSIS(MH/AI) D, E, A, A (×),
Formulation
Formulation (×), (❉),Formulation (❉) Easy (E),(❉,Efficiency
Formulation √, Efficiency (ή) (ή)
Easy (D)
N/Y,
Difficult
Efficiency
(E), N/Y,
Efficiency - (PI) Complex(×,
(ή) (PI)Formulation Formulation (PI) (PI)
Difficult
Efficiency
inNR LF (A), OPF Analysis
Solvers (N) NR LF
Improved (A), OPF variantsSolvers High
(1) (N)(E) (×) Difficult Better (❉) High Flat/No
(×) (N) Better
ImprovedInterconnected
(❉) variantsFlat/No DNEasy
(1) (N) Interconnected
Difficult DN
No es The symboE,sE,EA,AA and(√), D (√),
Methods
(❉), Methods
re Formulation
ers (❉) MOP in
oSensitively
easy
MOP
Methods
Sensitively
(×, ❉, Execution
Analysis
average
inSensitively
√, MOP
√)
(A) (A)
and
MCS;
SensitivelyHS;
Analysis
Easy TLA;
Computation
-,Methods
OPF;
(E)
Easy
dBn-,Execution
(A) -,ficu BB-BC;
Computation
-CP;
Analysis
(A) (E)in MOP
MINLP
Efficient ABC
(A)
execu
Computation
(N)
Efficient
Easy (less)
Complex(×, (√)
comp
on
Average
(less)
Easy Efficient
(E)
(√)
(A) ×,
odSimple
ex Parameter
√, y√)Parameter
Simple
Efficient
(less)
(√) Computation
High
(√)
(√)
and MCS;
(less) (×)
Flat/No Parameter
Simple
app (√) OPF;
Flat/No
Sensitively
(N) CP;
Complex
Sensitively
(√)
caSimple
(N)
Complex Methods
MINLP
on Analysis
(√)
Flat/No
Simple (√)
(√)(N)
Analysis
The in
Simple
(N)
RDN
(A) MOP
Parameter
Flat/No
Flat/No
per(A)
uRDN
N,(N)
-,Yes
(N)
YSimple
ormance
(Y) Easy(E) (E)
RDN Non-Linear
Simple
Complex High
Efficient
nd Efficient
RDN ca
system Computation
(√)
(×)(less)
ors(less)
(√) Complex
(√)have
(√)(×)
Simple (√)Complex
Simple
shown (√) Fla
(√)
hmprob em nw m(ή)h concernec so on
Execution Solution Solution
Execution
(D) SolutionHigh/Code
Average (❉)(×)Application Better
Application
Solution (❉) Application Y,
(D) ExecutionNon-Linear
Application High/Code
(√) Solutio
(DM)
BA; DE;respec
SOA; GSA
Table
Formulation T4.b
ε.Const.; GOP;
Brief
Formulation comparison
B Tmp
SQP; MILP ε.Const.;
b Easy review
Efficiency
(E),
Easy
Difficult
v
of(E),
(MH/AI)
Formulation the
w
Efficiency
GOP;
mp
(ή) merits
SQP; (ή)
hMILP mnand
Efficiency
Easy (E), v Easy
demerits
wnd (ή) √
(D)
(A)
(E),
Difficult
ofmpotential pnd dapproaches
(PI) Efficiency
(PI) pp(PI) papplied (MH/AI)
h nFormulation
pp forpp d
SDN h(PI)
DN ppEasy
Easy (E), d (E),(D) DN Efficiency (ή)
echn que ve y(MH/AI)
Yes Y No A,Sensitively
NA, NR
Sensitively
D,
andANR
LF (A),
no
Analysis
Analysis
(❉),
LFOPF
(A),
app
Sensitively
(A)
planning.
p nn (A)
(N)
(❉),
Solvers
OPF
NR
cab (×),
Solvers
LF
(N)
n Analysis
Easy (A),
(E) NR
Easye(N)
p(A)
OPF(❉)
LF
(E)
nn
[GA;
nd (A),
HS; caPSO;
Solvers
OPF
n(A)TLA;
IA; SA;
Sensitively
Efficient
Easy
(D) ed
(A)
Better
EA]
(N)
BB-BC;
HBMO;
Efficient
(less)
(E)
(1),
Solvers
as High
Analysis
(N)
(MH/AI)
(√) ABC
BFO
(less)
TS
(N)(❉)
High
(A)
(√)(×)
High
“Efficient bes
”Simple
(A)bes
(×) (×)
Average
(less)
Simple
(√) (√)
Easy
(A)
D, (D)
E,
Y,
√(E)
Better
High
(√)
-,
Better
Flat/No
Y,
Better
(❉)
be (×)
A, Abe (×),
(❉)
Simple
Y
High
(❉)
er (×)
High
Flat/No
Efficient
(N)(√)
High/Code
Average
[GA;
(×)
(N) NR
Flat/No
Better
average
er/average
Flat/No
(less)
Complex
PSO;
NR
LF
Flat/No
(N)(❉)
Flat/No
Simple
(√)
(×)
(❉)
(×), (❉),
❉
(A),
LF EA]
(A),
(N)OPF
Better
(N) Better
HS;
Simple
(N)
(1),
(❉)OPF
and
and system
TSSolvers
Solvers
Interconnected
Flat/No
Linear,
Simple
RDN (❉)
TLA;
Sensitively
Better RDN
√, ❉,
Better
(❉) (MH/AI)
(❉,
(√)
(❉)
(❉)×)
(N)
Interconnected
(N)
Flat/No
poor
poor
BB-BC; DN (❉)
(N)
Flat/No
Complex
Simple
AnalysisABC
Flat/No
-, RDN
N/Y,
N/Y, N,
(N)
Interconnected
××DN
(❉)
(A)
Y,
Easy
Y,
N/Y,
(N)
-,(N)as
Y
(E)
(A)
YY,
Interconnected
nd DN
ca
Linear,
Average
Easy High
on DN
High
Complex
Simple
(E)
Complex
High/Code
- (A)Complex(×,
RDN(×)(❉)
me (×)
Efficient
(❉),
Non-Linear LP
(×) csBetter
rBetter
(√) (less)
❉,Average
❉, ×) (❉)
(√)
Better
(❉) (❉)
(√)respec
(❉) SimpleN/(
Better
Difficult ε.Const.;
ε.Const.;
GOP; GOP;
SQP; Easy (E),
ε.Const.;
MILP
SQP; Easy
MILP (E),
ε.Const.;
GOP;Difficult
SQP;GOP;(MH/AI)
Easy (E),
Difficult
MILP SQP; MILP Difficult Easy
Difficult (A)(E), ε.Const.;ε.Const.; GOP; GOP; (MH/AI)
SQP; SQP;
MILP MILP Difficult Easy
Difficult(A)(E),
NR LFNR (A),LFOPF
(A), Solvers
OPF
NR LF
Solvers
(N)
(A), Difficult Difficult
ANN; SFL; Hybrid (MH/AI) in OPF
(N) Solvers M(N)
NR LF (A),
High
Improved OPF
(×)
High Solvers
variants
Complex (×) (1) (N)
Better
High
m(×)Better
(❉)
(×) (❉)
Difficult Flat/No
Better-,Flat/No
(N)(❉)High (N) Interconnected
(×) Flat/No
Improved NR
Interconnected
(N) LF(❉)
Better
variants(A),
DN (❉) OPF
Interconnected
(1) DN mSolvers
Flat/No (N)
DifficultDN
(N) Interconnected DN
High(×) (×) Better Better
(❉) (
(D)(√)
CY, Y Complex system (√)
(N)High/Code (×)
Methods
MCS; OPF;M CP; MOPMINLP MO(N) MCS;
BA; IA;
DE; OPF;
SA; MO
SOA; CP;
HBMO;GSAMINLP High
Computation
BFO C(N)
High
(MH/AI) (×)
High (×)
A, A, Better
High
Complex
D, A Better
(❉)
m(×) High
(❉), (√)(❉)
High
(❉), Flat/No
(×)
Parameter
Flat/No
(×)
(×), Flat/No
Better(❉)(N) (❉)
mBetter
(N) (N)
Complex
IA;
Better Flat/No
Linear,SA; Linear,
Complex
Non-Linear
(❉)(√)
HBMO; (N)
Flat/No
Complex
Flat/No
Y, (❉)
BFO (√)
-, (N)
Linear,
Y, (❉) Complex
(N)
Y Linear, Complex
(❉)High
Non-Linear High
(×)
(❉)
(√) Better
(❉)
(N) (A) (A) (N) (D)
Execution (A)
(N)
(D) (D) (A) Solution High/Code (×) Complex√, ❉,
(N) (N) (√)
×) A N/Y,
Application Yes (Y) (D) (D)Complex
A, A system
(A)
Complex
High/Code system
❉, (×)❉, (❉)
(√) Complex
×)(❉), (❉) (√)(❉, √, ❉Y
(D) Formulation m m
(D)(MH/AI) Efficiency (ή)
D,
ή
(D)
E,
(D) A, A (×), (×),
ή
(❉),
(PI)
(❉) (MH/AI)(❉, N/Y, (D)Y, - AD,Complex(×,
E, (×), (×),
ε.Const.;
ε.Const.;
GOP; GOP;
SQP; ε.Const.;
[GA;MILP
SQP;PSO; MILP
GOP;
EA] Difficult
SQP;
(1), TSDifficult
MILPε.Const.;
Difficult
ANN; [GA;
(MH/AI)
Difficult
GOP;
Difficult
SFL;PSO; SQP;
EA]
Hybrid (1), MILP
Difficult
TS
(MH/AI) Difficult Tab e 4High/Code
Difficult B e compa (×)
on ev
ε.Const.;
Complex
(MH/AI)
GOP;
(√)
ew SQP; oY,MILP -,
he me
Difficult
Y
and deme
Difficult
Difficult
Complex system (√)
o po en a a
High (×)
High (×) Better
High Better
(❉)
(×) (❉) Flat/No
Better Flat/No
(N)(❉)High (N) (×) Flat/No
Linear, Linear,
Complex(N)Better
Complex
(❉)
(❉)
Linear, (❉) Flat/No
Complex (N)
(❉) Linear, Complex High
(❉) (×) Better
(√) (√)(
8 Challenges andFDM;
WSM; AHP; Future Research Directions
TOPSIS
E, E, A,
MCS;
(N)
A
MCS;
OPF; CP;
Sensitively
(N) OPF;
(MH/AI)
(√),
MINLP
AnalysisCP;
AMCS;
(N) MINLP
(√),
(N)
(A)
(D) OPF;
(❉),
MCS;
A(N)
(D) CP;
BA; HS;
(❉)
OPF;
Easy
DE;
(D)
TLA;
MINLP
A(E)
Easy
Easy AHP;
CP;
(E)
SOA;
(D)
(D)
BB-BC;
(N)
MINLP
(N)
(MH/AI)
(MH/AI)
(E),
GSA
(×, ❉,
ABC
(N)(less)
High
Efficient
A (MH/AI)
High/Code (×)
High(√)
(D)
√,(×)
(×)
A,Average
Easy
(D)
√) ×Difficult
A,Complex
(D)
(A)
(E)
D,
p ann
AComplex
High
Simple
Better (√)
(×)
(√)
m
-, ng
-, H(❉)
(❉)High
High/Code
(❉), (√)
(❉),
Average
Flat/No
(×)(×),
-, -×❉ Flat/No (N)
N/Y,HS;
ComplexMCS;
Flat/No
(❉)(×)
(❉)Y,TLA;
(N)MCS;
mN-,OPF;
(√)
Y
BA;
(MH/AI)
Complex(×,
BB-BC;
(N)
NOPF;
CP;
Better
DE;
Better
(√)
CP;ABC
Non-Linear
Flat/No
MINLP
(❉)MINLP
Simple
Complex
SOA;
(❉)
Non-Linear
(N) (N)
Flat/No
RDN
N
GSAm (N)(√)
N/Y,
(❉),
×,TS√,
N(N)
LP
(MH/AI)
-,Y,N,
Average
RDN (N)
-,Y,
√)
(√)
(√)
Y,
Y,
(A)
-,Non-Linear
YY
Y A,
(D) (D)
Non-Linear
A, (√)
mComplex
D,
(D) RDNA High
Non-Linear
Average
(√)
(❉),High
system
(❉),
(❉)
(×)
LP (×) (×),Complex
(√)
(√)(❉),
(❉) (❉)Complex
Better (❉) Better-,(
WSM; FDM; TOPSIS Difficult Difficult
(DM) MCS; MCS;
OPF; CP;NR
OPF; [GA;
LFNR PSO;
[GA;
(A),
Improved
MINLP
CP;
MCS; MINLPOPF
(N) EA]
APSO; Difficult
(1),
EA]
Solvers
O
variants
OPF; (N) TS
[GA;
(1),
NR
(N)Difficult
(1)
CP; MINLP (N) TS
PSO;
[GA;
NA
ANN;
MCS;EA]O Difficult
PSO;
(1),
Improved
Difficult
SFL;
OPF; TS
EA]
CP; (1),N
variants
Hybrid TS
High(1)
(MH/AI) H E,
Difficult
E, Better
A,(√)
AComplex High/Code
(√), (√), (❉), (×)
(❉) [GA;N [GA;
ANN; ❉
PSO;
N PSO;
Complex
(×, EA]
SFL;√, EA]
(1),
Interconnected
❉, (√)
Hybrid
√)(√) (1),
TS
N N
DN
(MH/AI)
Y,
-, -, YDN
-,-,Complex
-, - (√)Easy
Difficult
Complex
Complex(×, DN ×,(√)
system (√)
High/Code
√,High
√) (×) (×) Complex
IA;
Easy High
(A)SA;
(E)
Easy A (E)MINLP
(×)
High
HBMO; (×)BFO
High/Code Complex
(N)
Easy High
(E)
High/Code Complex
(×) (×)
AEasy (√)(×)
(E) Flat/No
High/Code
Better
Complex Better
(❉) Flat/No
High/Code(N)
(×)
(√)(❉)(√)N/Y,
High (N) (×)
(×) Flat/No
Y,Non-Linear
IA;
N/Y,
Better
Yes SA;
-,(Y)
Y(❉) Non-Linear
MCS;
(N)
Complex
HBMO;
Y,Better
-, (√)
OPF;
YComplex
Complex N/Y,
(❉) BFO
Complex(√)Non-Linear
CP;
Y,
Complex MINLP
YFlat/No
-,N/Y,
(❉), LP Y,
(❉), (√) (√)
(N)
LP (N)
YEasy (E) (E)
Complex
(❉), Non-Linear
LPHigh/Code
(√)
(❉), LP
High/Code (×) (×) Better Complex
Better
(❉) (❉)
(MH/AI) (MH/AI)
(MH/AI) (D) (D) (MH/AI)(MH/AI)(D) (DM)
(D)
(MH/AI)
High/Code (×)
D, E, (D)
(D)
(D) A, A High/Code
(×), (×), (❉), (×)
(❉) (❉, √,
(MH/AI) ❉, (√)
(MH/AI) ×) system N/Y, Yes
D,N/Y, (√)
(Y)
E, A,
Y, A- Complex
(D)
(D)
Complex(×,
(×), system
(×), (❉), ❉,(❉) ❉,(√) ×) (❉, √, ❉, ×) N/Y
The current cha enges n SDN p ann ng and poss b e research d rect ons have arranged from [GA;ε.Const.; C GOP; GO
SQP; MILP
Q(1),CM Difficult
GO
WSM; D
AHP;(MH/AI)
Q FDM; M (1), TOPSIS D Me hod n MOP (MH/AI) WSM; AHP; FDM; TOPSIS Compu a on P
[GA; PSO; EA]
PSO; (1),
HS;EA]
Improved[GA;
TS (1),variants
Improved
TLA; PSO;
TS
BB-BC;EA]
variants
(1)
Improved
ABC
Easy (E)
TS
Easy (E)
BA;
[GA;
(1) Improved
variants
Difficult
HS;
DE;
PSO;
Difficult
Average
TLA;
Easy
High/Code
SOA;
EA]
variants
(1)BB-BC;
(E)
High/Code(×)
GSA
(1)
High
ABCTS (×)
Difficult
(×)
High/Code
(MH/AI) Better (❉)×
Difficult
H Better A,Average
E, E,
Easy
(×)
A, Better
A,
(E)
(❉)
D, A
N/Y,
A H(❉)
BetterY, (√),
N/Y,-, ×❉
Y (√),
High/Code
(❉), (❉) Y,
(❉), Flat/No
(❉),
-, Y
BA;
(×), (❉)
N/Y,
Complex
(×)
DE;
(❉)
Improved
(N) NY,
Complex
SOA; -, ❉
Improved
N
(×,
(❉), Y
[GA;
❉,
LP
Better
GSA Exe
Linear,
(❉),
PSO;
variants
√,variants
(√) √)
Complex
(❉) LP
(MH/AI) u EA]
Complex Non
(1)
(√)
(1),
(1)
CN/Y, N
m
(❉),
Y, -,(❉)
A,
TS-,Difficult
-,
-,Y,
LP
A,
Y, -Y
-,D,❉Y
(√) Difficult
A E, CE, m(E)
A, A
Complex(×,
Easy
Complex
(❉), (❉), ❉(√),
(❉), ×,
system
(×), LP √)So
√,(√),
(√)
High/Code
(❉) (❉) (❉), uComplex
(❉)on
(×)
Better (❉) (×, ❉,(√)
Better √(
Y
High/Code High/Code(×) (×) Complex
High/CodeComplex (√)
High/Code(×) (√) Yes
Complex
(×) (Y) Yes Complex
(Y)
(√) Complex(√)
Yes
Complex
(Y)
system Yes system
(√)
(Y) Complex Complex
system (√)
system
High/Code (√)
High/Code (×) (×) Complex(√)
(D)(A) Fo mu a on E(D) (D)en y ή
(MH/AI)(MH/AI) (N) (MH/AI)N (D)
N D
(DM)
(MH/AI) Average D(❉) Better (❉) Average -, N,
(❉) Y, Y Better Non-Linear
(❉) (DM)
(MH/AI) -, N,(√) Y, Y Non-Linear (√)
(MH/AI) (MH/AI)
(MH/AI) (MH/AI) (D)(MH/AI)
(A) (D)
(MH/AI) (D) (MH/AI)
(MH/AI)
v ewpo nt of each SGP c ass ficat on and presented throughout Sect ons 8 1–8 4 as fo ows Improved
Improved
variants
HS;MC
MCS; variants
Improved
TLA;
OPF;
IA; (1)
HS; CP;
O
SA; (1)
BB-BC;
TLA; MINLP
HBMO; variants
Difficult
CBB-BC;
ABC
MHS;
MC
(N)
BFO (1)O
NDifficult
ABC
TLA; ANN;
HS;
Difficult
Improved
NBB-BC;CSFL;
Average
TLA;
IA;
D
SA;M
High/Code Nvariants
Difficult
Hybrid
Average
ABC
BB-BC;
HBMO;
High/Code(×) N(MH/AI)
ABC High
BFO (1) (×)
Average
(×)
D
H Complex
Complex
High/Code
Difficult
×(√)
AverageS(D)
(×) n(√) Complex
Difficult
Complex C vHm(√)
Yes ❉, (Y) Yes
×)
×(√)
yHigh/Code
Ana
High/Code yComplex
ANN;
Flat/No
(Y)
(×),-,N/Y,N,
(×)
CYes
(×)
Y,
A
SFL;
HS;
(N)
-, Y
m N(Y)
Complex
N,(❉) Y,
Hybrid
HS;
TLA; Improved
Complex
NTLA;
system
Complex
Y ❉,
Ea
(MH/AI)
BB-BC; (√)N
BB-BC;
Non-Linear
system
(√)
Complex
(√) yvariants
ABC NE
(√)
×)Non-Linear
Non-Linear
-, (MH/AI)
N,
ABC
Y, Y-,N/Y,
(√)N
system
❉, Y,
(√)
N, Yes
Difficult
Y,(1)
❉,
-, Y
(Y)E
Average
(√) nComplex
N Difficult
Average
×)Non-Linear
(D)
Y(√)
Complex
High/Code
Non-Linear
√ High/Code
system
system
(×) (√)
❉, ❉,
S mp
(√)
(❉)×)
Complex
(×) √ (√)Complex F
(MH/AI)(MH/AI) (MH/AI) (MH/AI)
(MH/AI)
(MH/AI) (D) (D) (MH/AI)
(D)
D,
(A) (D)
(MH/AI)
DA
E, (MH/AI)
A,(A)
(MH/AI)
Average
(×), (×),Average
(❉)D D,
(A)(❉), (❉)
(❉)
(A)E,(D) Better
Average
A,(❉,A √, Better
(❉) Average
(❉)
(×), (❉) (❉)
(❉),BetterN/Y,
(❉) Better (❉)
√,
-(MH/AI)
(❉, Complex(×,
(MH/AI) N/Y, Y, (D)(√)Average
- (A)Complex(×,
(A)
(√)
Average (❉) Better Better
(❉) (❉)
GA WSM; AHP; FDM; TOPSIS WSM; AHP; FDM; Ea TOPSIS y E
❉× ❉,❉
[GA; PSO;
GATLA;EA]OBB-BC;
(1),ATS ABC O TLA; A BB-BC; NR LF A OPF So v ❉, ×,
HS; TLA;
HS; BB-BC;
TLA; IA;BB-BC;
BA; ABC
HS;
SA;
DE; IA; ABC
HBMO;
SA;
SOA; GSA Average
HBMO;
BFO(MH/AI)Average
IA;BFOSA;BA;IA;HS;
HBMO; SA;
Easy
A,
DE; A,Average
BFO
HBMO;
(E)
SOA;
D, A GSA BFO ABC
High/Code H
(MH/AI) (×)
CBetterE,
A, ×(❉)
Average
E,
A, A, A
Better
H
D,(×),
A (❉) C(√), ❉ (√), × (❉),
N/Y, Y, Y,
N(❉)
-, YN
IA;
-,Y,
Y Y SA;
IA; ❉
(×,
YHS;
SA;
HBMO; √,
TLA;
HBMO;
Complex C√)
N BB-BC;
BFO
mY BFO
(❉), Y LP Y, ❉
ABC
-,
YN,E,
(√)
-, E,
-,(❉)
Y,-, -A,
Y-C
Am HAverage
gh
Complex(×,
(√), (√), (❉), (❉)√,(❉) B (×,(❉)
√) √, √) F-
(MH/AI)(MH/AI) (MH/AI) MH A(A) (A) D,MH
(MH/AI)
Average
E, A,
D, A Average
E,(DM)
A(MH/AI)
(A) A(×),(❉),
A,(❉) (❉)
D,
(×), (❉),
Average
(×),E,
(❉), (×),
Better
A,
(×), A
D,
(❉) (❉)
(❉)
(❉),(❉)
E, A,
(❉)
(×),A
(❉,
(A)
Better
√, ❉,
-,(❉,
N,
Better
(×),
(❉),×) (❉),
(❉)
Y,
√, ❉,
-,(×),
Y N,
(❉) (❉),
Average
(❉) ×)Y,
N/Y,
(❉),Y(×), (❉)
N/Y,
(❉,N/Y,
(❉) (❉) ❉,
Non-Linear
-,
√,N, Y,N/Y,
(❉,×) YBetter
-Non-Linear
Y, (DM) ❉,
Better Complex
(√) ×)(❉)
(❉)
√,Complex(×,
Y, -N/Y, (√)
N/Y,A N/Y,
Complex(×,
(MH/AI)
system
❉,
Y, -❉,
Non-Linear -,
N/Y, ❉,
×) (√)
Y, ❉,Y
D,
Y,
Complex(×, ×)
E,
D,A,E, Complex
AA, ❉,
A
Complex(×,
(A) ❉,
(×),×)
Non-Linear system
❉,
(×),
(×), ❉, ×)
(√)
Average
(×),
(❉), (❉),
(❉) (❉) √, ❉,
(❉, (❉, ×)
❉, ×)(N
√,Better
(MH/AI) (MH/AI) (MH/AI) (MH/AI)
Difficult Difficult (MH/AI)
(MH/AI)
Improved
ANN; m BFO
SFL; variants
Hybrid (1) BFO
(MH/AI) m ANN; DifficultD Hybrid
SFL; (MH/AI)
High/Code D (×) Con Complex GOP (√)
High/Code SQP Y,(×)
M -,Y Y
LP Complex Complex
D (√) u system Y, -,Y
(√) Y(❉) Complex system (√)
IA; SA;IA;
HBMO;
SA;
BA; HBMO;
DE; BFO
BA; IA;
DE;SA;
SOA; GSA
SOA;HBMO;
(MH/AI)
BA;
GSA DE;
(MH/AI)
BA;
SOA; A,
DE; IA;
GSA
A, SA;
SOA;
D,
A, HBMO;
(MH/AI)
AA,GSAD, A
(❉), BFO
(MH/AI)A,
(❉),
(❉), A, D,
(×),
(❉), A,
A
(❉) A,
(×), ×
D,
(❉)
(❉), A
Better
(❉), Better
(❉)
(❉),
(×), (❉),
(❉)
(❉) - × (❉),
Y,
(×), -,BA;
Y,
Better
(❉) Y, BA;
DE;
-,
(❉) Y,DE;
SOA;
Y
Better IA;
SOA; SA;
GSA
Complex
(❉) Y, GSA
-,HBMO;
(MH/AI)
ComplexY,
system(MH/AI)
Y Y, -,BFOY,
system
(❉) A,
Complex A,
A, D,
A, AD,
Complex
systemA (❉),
(❉)
system
E, A,×Am ❉,(❉),
(❉), (❉),
(×),
(❉) (×),
(❉) (❉) Better
Better
(❉) (❉)
(MH/AI)(MH/AI) (MH/AI) MHD,AE, A,
(MH/AI)
D,A E, A, A (×),
MH D,
(D)
(D)
(×),E,(❉),
A(×), DA,
High/Code
A(❉)
(×),
(MH/AI)
(❉), (×), H
(❉)(❉, √,(×)
(×), C(❉,
D❉,
(❉), ×)
D, E,Complex
❉,
(D)
√,(❉) A,×) H C N/Y,
A(❉,
N/Y, m (√)
√,
N/Y, C
(×),❉, Y, ×)
N/Y,
(×), Yes
Y, - (Y)
N/Y, C Complex(×,
Complex(×,
(❉) m Y(❉,
N/Y, Y,❉,Complex
-√,❉,❉, ❉,C×)❉,
×) m
Ysystem
Complex(×,
(MH/AI)
Y (√)
×)N/Y, ❉,
N/Y, m Y,
❉, C
×)-m HD,gh
Complex(×, (×),❉,(×), B (❉), (❉)❉ (❉, √, F❉
×)
WSM; AHP; FDM; TOPSIS Difficult
WSM; Difficult
AHP; FDM; DifficultDifficult
TOPSIS N (√) Y, DY(MH/AI) Difficult
Difficult
DE;ANN;HS; ANN;
SFL;
TLA;
H Hybrid
SFL;
BB-BC;AHybrid
(MH/AI)
ANN;
ABC (MH/AI)
SFL;
ANN;
A,C(MH/AI)
A
HA Hybrid
A,CBA; ASFL;
Average
A E, E, (MH/AI)
AHybrid
C(×),
A, AA C(MH/AI)
High/Code
(√), High/Code
(√), (×)(×),
A(❉), E,
(❉) (×)
E,Complex
High/Code
A, A
D,(×, ❉,
Complex (√)
-,High/Code
√, (×)
(√),√) (√), Complex
(❉),(×) ANN;YY,
-,(❉)
-, ANN;
-,-Complex
-,Y,
SFL;
(√)
-,ComplexY SFL;
Y(×, ❉,
Hybrid
Complex
Hybrid
(√)
√,Y,
Complex
√)(MH/AI)
Complex(×, -,system ×,
Y,Y,
system
-,(√)YComplex
√,
-, Y(√)
-,√)-(❉) Complex
system (√)
Asystem
A, D,High/Code
Complex(×, ×,(√)
High/Code (×) (×),Complex
√) (×)
√,(❉), (❉)Complex (√) (√)(
BA; DE;
BA;SOA; GSA
SOA; BA;
(MH/AI)
GSA DE; (MH/AI)
SOA;
(DM)A, GSA D,
A, D, DE;
(❉),
(D)A, SOA;
(❉),A,
(❉),
(D)D,
(DM) GSA
A(❉)
(❉), (MH/AI)
(×), (❉),
Average (❉)ABetter
(D)(❉),
(❉)BetterA,
(❉) ❉(❉)
(D) A, (❉) AY,
BetterABetter
(❉) Y, Y,
(❉), Y(❉)-,❉❉ Y, -,
(❉), Y (×),
Complex
N, Y,
(❉)
Y, Y
N YBA; ❉DE;
system
Better
Y SOA;
system
(❉)
(❉)
Complex
Non-Linear
D N(❉)
NGSA
u
(MH/AI)
Y system
(√)
Y -, Y, (D)
N(D)A,Complex system
(❉), (❉) Better
(MH/AI) MHDifficult
A DifficultMH (A)Difficult
A A A Difficult
ANN;ANN; WSM;
SFL; Hybrid
SFL; WSM;
AHP;SFL;
Hybrid
ANN;
(MH/AI) AHP;
FDM;
(MH/AI) FDM;
TOPSIS
WSM; TOPSIS
AHP;
WSM; FDM;
AHP; TOPSIS
FDM; TOPSIS MCS OPF
❉, ❉,
CP MY -,NLP WSM;
❉,
N
WSM; AHP; AHP;
❉,
FDM; FDM; TOPSIS TOPSIS
×, ×,
H gh ×,
×
Difficult
×,
Comp x √ Complex
❉, ❉,
F
IA; SA;AHBMO; A Hybrid
H BFOMO (MH/AI)
A
O ANN;
AE, H SFL;
High/Code
E, A,E,
MO Hybrid
High/Code
AE, A, (×)
A
O (√), (MH/AI)
(×)
E,
(√), Complex
High/Code
E,
(√),
(❉), A,
(√), Complex
A
(❉)E,
(❉),E,(√)
(×)
A,
(❉) A
(√),
(×,(√) Complex
(√), Y,
√,
(×,
(❉), -,√)
(√), Y Y,
(√),
(❉) (√)
High/Code
√, -,√)
(❉), Complex
-,
(×,
(❉) (×)
-, -Y,
-, Complex
√,-,(×,
-, Y
ANN;
√)
-, system
Complex
- system
SFL;
√, (√)
√) Complex
-,
Complex(×, (√)
Hybrid
-, -,(√)
Complex(×,
D - -, system
(MH/AI)
√,
-,Y, √)
-, -,
- Y
√,
E, (√)
Complex(×,√)
E,E,
A,E,A Complex
A, A
Complex(×,√,
(√),√) system
(√), √,
(√),
(❉), √) (√) (❉) (×)
High/Code
(❉),
(❉) (×, (×,√, √)√, √)
(DM) (DM) (D) (D)(DM) D, E, A, A(D)A A
D(DM) (×), (×),× (❉), D× (❉) ❉ A (D)
A ❉ (❉, × √, ❉,❉××) ❉ × ❉ N/Y,
N/Y, NY ❉Y, N-Y❉YComplex(×,
×
(DM) (DM)NY
C m N❉,Y ❉, ×Y ❉ ×) ❉C× m × ❉ ❉ ×
(D)
(MH/AI) MH A TOPSIS MH AHP; A
WSM;WSM;
AHP; AHP;
FDM;WSM;FDM;
TOPSIS TOPSIS
AHP; FDM; WSM; FDM; TOPSIS
❉, ❉,
GA PSO-,❉❉,
EA 1Complex(×,
TS WSM;
×,❉,
AHP;
×,
FDM; TOPSIS
×, ×, √,(√),
BA; DE;
(DM) (DM)ASOA; D GSA OA(DM)
E,G E,AA,
(MH/AI) A E,
MHA
E, A,
D AA, A(√),
OA A, GE,
(√),
D, E,
A (√),
A A,
A(❉),DA
(√),
MH
(DM)
(❉)
A(❉),
(❉),A (❉), ❉(×,
(❉)
(√), A ❉
(√),
(×), √,
D×E,
(❉),
(×,
A(❉) √)
A E,❉
(❉) √,Better
A,√)❉
A (×,
-,(❉) --,√,
-,(√), ×-,❉√)-,❉
(√), -Y,
(❉), -, Y,(❉)Y-,Y-, -,
Y -Y
Complex(×, (×, √, √,
❉Complex √)
Ea √)Y √,
Complex(×,
C m √)E
ysystem
(DM) Y Y-,(❉) -, -, m √,- H√)
C❉m ghE,CodE, A, Am× ❉(√),
Complex(×, B(❉), (❉)❉ (×, ❉,N
√) √
DifficultD D
MH A
0395 Ε \textEpsilon GREEK CAPITAL LETTER EPSILON
0399 Ι
Energies 2017, 10, 501
\textIota GREEK CAPITAL LETTER IOTA
32 of 47
039B Λ \textLambda
8.1. SGTF Perspective GREEK CAPITAL LETTER LAMDA
039F Ο Options
8.1.1. \textOmicron
in SGET GREEK CAPITAL LETTER OMICRON
03A9 Ω
APS: Modified protection techniques to enable bi-directional GREEK
\textOmega power flowLETTER
CAPITAL and ensure
OMEGA reliability.
03AA Ϊ Real-time
\textIotadieresis pricing (RTP) instead of average, integration of ICT infrastructure, efficient
GREEK CAPITAL LETTER IOTA WITH DIALYTIKA
DSM: weather/load forecasting models, interoperability (among stakeholders), scalability issues
\"{\textIota}
03AB Ϋ (increased consumers and requirements), new scheme and
\"{\textUpsilon} predicting
GREEK consumer
CAPITAL LETTER response.
UPSILON WITH DIALYTIKA
03AF ί
PQS: \'{\textiota}
Modern control, ADA and PE, to house high DER penetration, aiming
GREEK SMALL at PQS
LETTER (V &TONOS
IOTA WITH f) issues.
03B0 ΰ
ARTM: \"{\textupsilonacute}
Huge storage memory requirements with over data andGREEK privacy
SMALLissues
LETTERwith visualization.
UPSILON WITH DIALYTIKA AND TONOS
03B1 α
Rel.: Evaluation of new consumption models from reliabilityGREEK
\textalpha perspective andALPHA
SMALL LETTER cost of reliability.
03B2 β & P: \textbeta
S Need for improved cyber security and privacy protection algorithms
GREEK in BETA
SMALL LETTER SH and SB.
03B3 NMOM:
γ Addressing complexity issues in new market model, devices,
\textgrgamma and management techniques.
GREEK SMALL LETTER GAMMA
INC & P: Exploring interconnected topology based MDCs with new performance indicators.
03B4 δ \textdelta GREEK SMALL LETTER DELTA
DIDS: Compatibility of intelligent devices, DM, and perspective aware interoperability platform.
03B6 ζ \textzeta GREEK SMALL LETTER ZETA
SGCIR: New simulators and solvers (for various scenarios), pilot projects and support tools.
03B7 η
FoC:
\texteta GREEK SMALL LETTER ETA
Proposing consumer-centered schemes for active participation (DM) in grid operations.
03B8 θ \texttheta GREEK SMALL LETTER THETA
03B9 ι \textgriota
8.2. MDC Perspective GREEK SMALL LETTER IOTA
03C0 • π Motivation:
\textpi Maximum objective attainment (multi-objective optimization).
GREEK SMALL LETTER PI
18
Energies 2017, 10, 501 33 of 47
Figure 9. Scale-based planning architecture of SDNs, varying from small (SH) to large level (SC).
Figure 9. Scale-based planning architecture of SDNs, varying from small (SH) to large level (SC).
8.3. PWP Perspective
8.2.3.1. FutureThe
SDN Planning
SDN concept (Small Scale at the
(MDC) realization Consumer’s
have End)
motivated stakeholders such as many countries
(regions), leading policy makers, research institutes, and researchers, towards efforts from various
• Candidate SDNs:asSH,
perspectives, shown SBinand smart
Table neighborhood
5, since the cost is a vitalare MDC
factor concepts
(constraint) on consumer
in traditional (AMI) side.
planning.
• Motivation:
However, Realization relies onunder
the SDN development ICT, cloud and newneed
the SG paradigm integrated forecasting
to compromise techniques.
cost constraints to a
• certain level. The pilot projects and policies around the world offer valuable experience
Potential Issues: The potential issues of rebound peaks, misalignment among REGs and consumer that can help
stakeholders to utilize maximum key enabler (SGTF) potential in mature SDN planning strategies.
load Technical
patterns,and irregular human factors, security and privacy issues, and difficulty due to a
other objectives need to be prioritized in DM and the cost impact needs to be
limitation in existing infrastructure,
considered over a certain planning horizon. needs Thetoprominent
be further SDNexplored.
motivations around the globe, with
• possible key enablers (SGTF), prominent stakeholders
Likely features: Technical, economic and environmental/social and focused objectives-based
objectives are presented in
approaches must
Table 5.
be introduced in HEMS to enable and serve consumers towards efficient scheduling of available
resources. Also, flexible home automation
Table systemsof(for
5. The PWP perspective SDN consumer
planning. interaction in real-time) need
furtherSDN
consideration.
Motivation Possible Key Enablers in SG Stakeholders Focused (Aimed) Objectives
• 4.1.1. SGCI (DER/DG/REG);
The scale of implementation:
4.1.2. ICT (AMI);
1. Research groups; - V & f deviations (↓↓)
4.1.3. ADA;
2. Organizations; - Voltage stability (↑↑)
# Small 5. Scale Level-SL1:
4.1.4. EST/StorageThe
(ST); possible scale-based planning approach starts
3. Academia; - DER penetration from
(↑↑) consumer
(5.1–5.10) 4.1.5. Power Electronics (PE);
level MDC (SH 4. side
Countries; - Reliability (↑↑)
New distribution 4.1.6. and SB) at smart meter
EV integration; (of consumers).
5. Investors; - Power Quality (↑↑)
concepts (MDC) 4.1.8. CT;
6. Utilities - System losses (↓↓)
4.1.9. Smart protection (APS);
8.2.3.2. Future SDN Planning (Medium-Large Scale
4.1.10. DR/DSM;
7. at the Utility End)
Consumers - System congestion (↓↓)
6. Test/pilot projects.
• Candidate SDNs: The 4.1.1.MDCs
SGCI (DER)onintegration;
the utility side
1. such
Grid as MG, LDN,
investigation - PowerMDN,
Quality MMG, VPP,
(↑↑) and SC.
Enabled stability
4.1.2. ICT (AMI); groups; - Power Security (↑↑)
and robustness
4.1.3. ADA; 2. Consumer - V & f deviations (↓↓)
Energies 2017, 10, 501 34 of 47
• Motivation: Medium to large scale approach incorporating all the aforementioned MDCs.
• Likely features: The possible new architectures, planning tools, together with SGTF, modern
integrated planning methods and interaction among interconnected MDC concepts; serves as a
worthy research area.
• The scale of Implementation:
Table 5. Cont.
Deregulated 4.2.6. New market models; 1. New - Profits for utilities (↑↑)
market structures 4.2.7. Market support tools, etc. market participants - Benefit to cost ratio (↑↑)
New investment 4.2.6. Investment friendly policies; 1. Investors in - Investor benefit (↑↑)
opportunities 4.2.10. Consumer friendly SG paradigm - Profits for utilities (↑↑)
(profit oriented) policies. 2. Market participants - Consumer participation (↑↑)
- V & f deviations
4.1.1. SGCI (DER) Integration; - Voltage stability (↓↓)
4.1.3. ADA; 1. New grid planners (↑↑)
- DER penetration
4.1.8. Enhanced controls; 2. Grid Managers (↑↑)
- Reliability
4.1.9. Upgraded protection (APS); 3. Device makers (↑↑)
New/Multiple - Power Quality
4.1.10. DSM/DR; 4. Technology innovators (↑↑)
Infrastructure - System losses
5.1–5.10. Establish new and 5. Policymakers (↓↓)
based planning - System congestion
modified performance indices; (↓↓)
In SG environment 6. Regulation Authorities
and smart devices (innovations - Optimize asset utilization (↑↑)
7. Utilities (DSO)
and applications); - System losses (↓↓)
7/7.1. New planning tools; 8. Consumers (↓↓)
- Defer new installations
7/7.2. MO Decision support. - Coordinated development (↑↑)
However, SDNs have expected to be interconnected in nature and complex in operation, hence,
traditional power/load flow methods may not be applicable.
9. Conclusions
In this paper, the smart distribution network (SDN) as a SG modernization concept has presented
from a planning perspective. SDN planning has motivated by various key enabling technologies and
features under the SG paradigm that was limited in traditional planning (TDP). Since SDN will be
capable of accommodating bi-directional power flow and is interconnected in nature and operation,
as a consequence, traditional planning techniques and tools may not remain relevant.
The requirement of smooth SDN evolution needs roadmaps (plans and policies) for building new
consumption models (MDC) either from the start or intelligently expands the traditional RDN. Thus,
the SDN concept has presented via SGP, which includes SGTF, MDC, PWP, and RWO, respectively.
The SGTF have been reviewed on the basis of their literature, limitations, applications, associated
technologies, and benefits towards the realization of SDN concepts. Similarly, the expected SGAF have
been reviewed by means of objective attainment, concept realization features, limitations, and SGET,
which can be helpful in optimal SDN planning and operation. The new consumption models or
MDC have been reviewed as potential SDN candidates, primarily by concepts, architecture, literature,
prominent features, requirements, associated SGTF and research directions, respectively.
The SG policies of seven leading countries (and regions) with key guidelines, major policy
objectives and core motivation (focus) with respective SGTF have been summarized in Table 1. Also,
the fifteen notable SDN projects with associated details, related SGET, aimed SGAF and required
objectives in the form of indicators (OI) have been presented in Table 2.
The real world optimization (RWO) planning problems, due to the involvement of a large number
of stakeholders, are multi-objective (MO) in nature. MOP tools can provide trade-off solutions of
the concerned problem among contradictory objectives and satisfy multiple stakeholders. The MOP
problems aiming at SDN (MDC) have emphasized the need to address as aggregated planning model
(APM). The main aim of the APM is to ensure the long-term success of MDC under SDN, on both
technical and economic basis.
The current status of MOP-based literature works associated with SDN has been thoroughly
reviewed and arranged in Table 3. Moreover, MOP formulations have been investigated on the basis
of their structure, such as interaction between initialization, inner and outer optimization, decision-
making procedures and respective solution techniques, respectively. It has been found that analytical
and numerical techniques constitute the maximum portion of the inner optimization. MH/AI makes a
Energies 2017, 10, 501 37 of 47
large portion of outer optimization (for a set of feasible solutions) and MCDA methods represent a
prominent portion of DM solutions. A brief comparison of MOO-based solution techniques applied
for SDN planning, on the basis of merits and demerits, has illustrated in Table 4.
USV Symbol TheMacro(s) challenges in SDN planning, possible research directions for their solutions and research
Description
motivations have arranged according to each classification in SGP. The research options in SGET have
0392 Β \textBeta
been presented as infrastructure limitations, need for improvedGREEK CAPITAL LETTER BETA
methods and issues in the existing
0393 Γ \textGamma GREEK CAPITAL LETTER GAMMA
phase of respective technology. Similarly, SGAF was reviewed on the basis of operational issues,
0394 Δ
performance \textDelta
indication and limitation in addressing techniques.GREEK CAPITAL LETTER DELTA
0395 Ε The\textEpsilon
futuristic SDN planning has been addressed, as proposed GREEK CAPITAL LETTER EPSILON
primitive architecture on a distinct
0396 Ζ \textZeta
scale of implementation, including both electrical and geographicalGREEK CAPITAL LETTER
boundaries. TheZETA
scaling approaches
0397 Η \textEta
have two categories: the first corresponds to small scale MDC (such as SH, SB, and MG) on the
GREEK CAPITAL LETTER ETA
039B
Energies 2017, 10, 501 Λ \textLambda
Finally, integrated planning approaches and new power flow
30 of models
45 GREEK CAPITALshould be further explored,
LETTER LAMDA
039C MH/AIΜ
employed aiming
techniques\textMu
at efficient
[26]. SDN planning.
The prominent techniquesAlso, artificial
include harmony intelligence
search (HS), big (AI) and
GREEK hybrid
CAPITAL techniques
LETTER MU need to be
bang039D Νemployed
big crunch (BB-BC), forbee
\textNu
artificial MOP problems
colony in finding
(ABC), immune global
algorithm optimalannealing
(IA), simulated solutions. Still,
GREEK limitations
CAPITAL LETTER NU in new planning
(SA), honey bee mating
039E Ξtools, (HBMO),
hot\textXi ant colony
(optimally optimizationparameters)
predefined (ACO), bat algorithm (BA), differential
initialization methods, improved
GREEK solution
CAPITAL LETTER XI techniques and
evolution (DE), gravitational search algorithm (GSA), shuffled frog leaping (SFL) and hybrid
039F respectively.
algorithms Ο
prioritization of decision objectives weights serves as a prospective research area to exploit various
\textOmicron
Hybrid MH/AI methods results in efficient performance towards global GREEK CAPITAL LETTER OMICRON
03A0
solution aiming Π
atSDN planning
complex \textPioptions.
planning problems [26]. The use of the aforesaid methods, from a future GREEK CAPITAL LETTER PI
SDN planning viewpoint, offers potential research perspectives.
03A1 Ρ \textRho GREEK CAPITAL LETTER RHO
Acknowledgments: This work was supported by Institute for Information & communications Technology
03A3
7.3.3. Σ
Decision-Making \textSigma
Methods
Promotion (IITP) grant funded by the Korea government (MSIP) (No.GREEK CAPITAL LETTERAutomotive
R0113-15-0002, SIGMA ICT based
03A4 Τe-Call standardization
\textTau and after-market device development).
The decision making (DM) methods are vital, both as main optimization algorithms and as a GREEK CAPITAL LETTER TAU
03A5
means of sortingΥAuthor \textUpsilon
out a trade-off solutions Syed
Contributions: amongAlia set of multiple
Abbas conflicting
Kazmi (first objectives. The GREEK
and corresponding author), Muhammad
CAPITAL Khuram Shahzad
LETTER UPSILON
prominent DM techniques
(second addressed
author), in the literature
Akif Zia Khan(Table 3) include
(third author)weight
and methods
Dong that include
Ryeol Shin (main corresponding author) provide a
03A6 Φ
both weighted composite
\textPhi
sum (WSM)
GREEK CAPITAL LETTER PHI
reviewand in theproduct (WPM)distribution
field of smart methods, networks.
respectively, as in review of modern distribution concepts
In particular,
03A7 Χ
[132,139,140,148,149,157].
with key \textChi
The analyticalishierarchy
enablers provided, process
based(AHP) has been employed
on literature work infortopboth GREEK CAPITAL LETTER CHI
longjournals.
notch The authors provided a critical
and03A8
short term SDNΨ
assessment \textPsi
planning, ofasdifferent
in [124,154]. Fuzzy
smart griddecision makinganticipated
techniques, (FDM) is among the most GREEK
functionalities, modern
CAPITALdistribution
LETTER PSI concepts, policies
popular DM methods and employed
in leading countriesin many studies, mainly due
and multi-objective asto its ability tooptimization
real-world address varying,
problem. In addition, challenges and future
03A9 Ω
uncertain nature research
\textOmega
directions
and various scenariosforofengineers, researchers,
the concerned problem. and
The planners;
FDM aiming have at also
GREEK CAPITAL LETTER OMEGA
MOPpresented.
03AA has been
problems Ϊ employed\textIotadieresis
in literature with various variants and associated methods as in GREEK CAPITAL LETTER IOTA WITH DIALYTIKA
Conflicts Other
of Interest:
[86,125,128,133,135,137,141].\"{\textIota}
The authors declare no conflict of interest.
multi-criteria decision analysis methods addressed in this study
include
03AB Ϋ approach
the min-max [123,126,134,138,160]; rank order centroid (ROC) in [136] and TOPSIS GREEK CAPITAL LETTER UPSILON WITH DIALYTIKA
\"{\textUpsilon}
Abbreviations
in [141], respectively. A detailed account of MCDA methods can be found in [168,169].
03AC ά \'{\textalpha} GREEK SMALL LETTER ALPHA WITH TONOS
The following abbreviations have used in this paper:
7.4. 03AD έ Methods
Analysis of Potential \'{\textepsilon}
in MOP Formulations GREEK SMALL LETTER EPSILON WITH TONOS
03AE
The analysis of ή potential\'{\texteta}
methods Efficiency
in MOP formulation, aiming at optimized SDN planning, are GREEK SMALL LETTER ETA WITH TONOS
summarized,
03AF from ί the perspective
A/D/E ofAverage/Difficult/Easy
\'{\textiota}various performance indicators, in Table 4. The performance GREEK SMALL LETTER IOTA WITH TONOS
indicators include sub-optimizations in MOP formulations, respective execution (implementation
03B0 Vΰ \"{\textupsilonacute}
Voltage
and coding), and computation cost, solution quality, initial parameter dependence (tuning
GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS
complexity) α
f
03B1 and application.
√
\textalpha Frequency
The performance indicators have shown with desired requirements, as GREEK SMALL LETTER ALPHA
best03B2 (β )/((❉))/(
(√), better/average ×)poor Best/better
and
\textbeta (×) as indication or metrics,
average/poor
respectively. GREEK SMALL LETTER BETA
03B3 ABC
γ \textgrgammaArtificial bee colony GREEK SMALL LETTER GAMMA
Table 4. Brief comparison review of the merits and demerits of potential approaches applied for SDN
AC/DC Alternating current/Direct current
03B4
planning. δ \textdelta GREEK SMALL LETTER DELTA
ADA Advanced distribution automation
03B6
Methods in MOP ζ \textzetaComputation
Execution Solution
Parameter
Application GREEK SMALL LETTER ZETA
Formulation ADN Active distribution
Efficiency (ή) network (PI)
03B7 η
Sensitively Analysis (A)
AHP
\texteta
Easy (E) Efficient (less) (√) Simple (√)
Analytical hierarchal process Flat/No (N) Simple RDN GREEK SMALL LETTER ETA
NR03B8 θ
LF (A), OPF Solvers
AI (N)
Easy (E),
\texttheta
(A)
High (×)
Artificial Better (❉)
intelligence Flat/No (N) Interconnected DN GREEK SMALL LETTER THETA
03BE
(MH/AI)
ξ
IA; SA; HBMO; BFO
(A)
\textxi GREEK SMALL LETTER XI
D, E, A, A (×), (×), (❉), (❉) (❉, √, ❉, ×) N/Y, N/Y, Y, - Complex(×, ❉, ❉, ×)
03BF(MH/AI) ο \textomicron GREEK SMALL LETTER OMICRON
BA; DE; SOA; GSA (MH/AI) A, A, D, A (❉), (❉), (×), (❉) Better (❉) Y, -, Y, Y Complex system (❉)
03C0 π \textpi
Difficult GREEK SMALL LETTER PI
ANN; SFL; Hybrid (MH/AI) High/Code (×) Complex (√) Y, -, Y Complex system (√)
03C1 ρ
WSM; AHP; FDM; TOPSIS
(D)
\textrho GREEK SMALL LETTER RHO
E, E, A, A
(√), (√), (❉), (❉) (×, ❉, √, √) -, -, -, - Complex(×, ×, √, √)
03C2 (DM) ς \textgrsigma GREEK SMALL LETTER FINAL SIGMA
\textvarsigma
Energies 2017, 10, 501 38 of 47
References
1. Farhangi, H. The path of the smart grid power energy. IEEE Mag. 2010, 8, 18–28.
2. Lueken, C.; Carvalho, P.M.S.; Apt, J. Distribution grid reconfiguration reduces power losses and helps
integrate renewables. Energy Policy 2012, 48, 260–273. [CrossRef]
3. Sultanaa, U.; Khairuddin, A.B.; Aman, M.M.; Mokhtara, A.S.; Zareen, N. A review of optimum DG
placement based on minimization of power losses and voltage stability enhancement of distribution system.
Renew. Sustain. Energy Rev. 2016, 63, 363–378. [CrossRef]
4. Yun, S.Y.; Chu, C.M.; Kwon, S.C.; Song, I.K.; Choi, J.H. The Development and Empirical Evaluation of the
Korean Smart Distribution Management System. Energies 2014, 7, 1332–1362. [CrossRef]
5. Fang, X.; Misra, S.; Xue, G.; Yang, D. Smart grid—The new and improved power grid: A survey.
IEEE Commun. Surv. Tutor. 2012, 14, 944–980. [CrossRef]
Energies 2017, 10, 501 40 of 47
6. Jiang, Y.; Liu, C.C.; Xu, Y. Smart Distribution Systems. Energies 2016, 9, 297. [CrossRef]
7. Tuballa, M.L.; Abundo, M.L. A review of the development of Smart Grid technologies. Renew. Sustain.
Energy Rev. 2016, 59, 710–725. [CrossRef]
8. El-Hawary, M.E. The Smart Grid—State-of-the-art and Future Trends. Electr. Power Compon. Syst. 2014, 42,
239–250. [CrossRef]
9. Khator, S.K.; Leung, L.C. Power distribution planning: A review of models and issues. IEEE Trans. Power Syst.
1997, 12, 1151–1159. [CrossRef]
10. Georgilakis, P.S.; Hatziargyriou, N.D. A review of Power distribution planning in the modern power systems
era: Models, methods, and future research. Electr. Power Syst. Res. 2015, 121, 89–100. [CrossRef]
11. Jahromi, S.N.; Rashidinejad, M.; Abdollahi, A. Multistage distribution network expansion planning under
smart grids environment. Electr. Power Energy Syst. 2015, 71, 222–230. [CrossRef]
12. Georgilakis, P.S.; Hatziargyriou, N.D. Optimal Distributed Generation Placement in Power Distribution
Networks: Models, Methods, and Future Research. IEEE Trans. Power Syst. 2013, 28, 3420–3428. [CrossRef]
13. Kim, J.C.; Cho, S.M.; Shin, H.S. Advanced Power Distribution System Configuration for Smart Grids.
IEEE Trans. Smart Grid 2013, 4, 353–358. [CrossRef]
14. Murty, V.V.S.N.; Kumar, A. Mesh distribution system analysis in presence of distributed generation with
time varying load model. Electr. Power Energy Syst. 2014, 62, 836–854. [CrossRef]
15. Gamarra, C.; Guerrero, J.M. Computational optimization techniques applied to microgrids planning:
A review. Renew. Sustain. Energy Rev. 2015, 48, 413–424. [CrossRef]
16. Siddaiah, R.; Saini, R.P. A review on planning, configurations, modeling and optimization techniques of
hybrid renewable energy systems for off grid applications. Renew. Sustain. Energy Rev. 2016, 58, 376–396.
[CrossRef]
17. Nosratabadi, S.M.; Hooshmand, R.A.; Gholipour, E. A Comprehensive review on microgrid and virtual
power plant concepts employed for distributed energy resource scheduling in power systems. Renew. Sustain.
Energy Rev. 2017, 67, 341–363. [CrossRef]
18. Lobaccaro, G.; Carlucci, S.; Löfström, E. A Review of Systems and Technologies for Smart Homes and Smart
Grids. Energies Rev. 2016, 9, 348. [CrossRef]
19. Zhou, B.; Li, W.; Chan, K.W.; Cao, Y.; Kuang, Y.; Liu, X.; Wang, X. Smart home energy management systems:
Concept, configurations, and scheduling strategies. Renew. Sustain. Energy Rev. 2016, 61, 30–40. [CrossRef]
20. Calvillo, C.F.; Miralles, A.S.; Villar, J. Energy management and planning in smart cities. Renew. Sustain.
Energy Rev. 2016, 55, 273–287. [CrossRef]
21. International Energy Agency. Technology Road Map Smart Grids. April 2011. Available online: http://www.
iea.org/publications/freepublications/publication/smartgrids_roadmap.pdf (accessed on 16 August 2016).
22. Rodriguez, A.A.; Ault, G.; Galloway, S. Multi-Objective planning of distributed energy resources: A review
of the state-of-the-art. Renew. Sustain. Energy Rev. 2010, 14, 1353–1366. [CrossRef]
23. Keane, A.; Ochoa, L.F.; Borges, C.L.T.; Ault, G.W.; Alarcon-Rodriguez, A.D.; Currie, R.; Pilo, F.; Dent, C.;
Harrison, G.P. State-of-the-art techniques and challenges ahead for distributed generation planning and
optimization. IEEE Trans. Power Syst. 2013, 28, 1493–1502. [CrossRef]
24. Shen, X.; Shahidehpour, M.; Han, Y.; Zhu, S.; Zheng, J. Expansion Planning of Active Distribution Networks
with Centralized and Distributed Energy Storage Systems. IEEE Trans. Sustain. Energy 2017, 8, 126–134.
[CrossRef]
25. Konstantelos, I.; Giannelos, S.; Strbac, G. Strategic Valuation of Smart Grid Technology Options in
Distribution Networks. IEEE Trans. Power Syst. 2017, 32, 1293–1303. [CrossRef]
26. Kazmi, A.A.; Shahzad, M.K.; Shin, D.R. Multi-Objective Planning Techniques in Distribution Networks:
A composite Review. Energies 2017, 10, 208. [CrossRef]
27. Hossain, M.S.; Madlool, N.A.; Rahim, N.A.; Selvaraj, J.; Pandey, A.K.; Khan, A.F. Role of smart grid in
renewable energy: An overview. Renew. Sustain. Energy Rev. 2016, 60, 1168–1184. [CrossRef]
28. Viral, R.; Khatod, D.K. Optimal planning of distributed generation systems in distribution system: A review.
Renew. Sustain. Energy Rev. 2012, 16, 5146–5165. [CrossRef]
29. Tan, W.S.; Hassan, M.Y.; Majid, M.S.; Rahman, H.A. Optimal distributed renewable generation planning:
A review of different approaches. Renew. Sustain. Energy Rev. 2013, 18, 626–645. [CrossRef]
Energies 2017, 10, 501 41 of 47
30. Strasser, T.; Andrén, F.; Kathan, J.; Cecati, C.; Buccella, C.; Siano, P.; Leitão, P.; Zhabelova, G.; Vyatkin, V.;
Vrba, P.; et al. A Review of Architectures and Concepts for Intelligence in Future Electric Energy Systems.
IEEE Trans. Ind. Electr. 2015, 62, 2424–2438. [CrossRef]
31. Gungor, V.C.; Sahin, D.; Kocak, T.; Ergut, S.; Buccella, C.; Cecati, C.; Hancke, G.P. A Survey on Smart Grid
Potential Applications and Communication Requirements. IEEE Trans. Ind. Inform. 2013, 9, 28–42. [CrossRef]
32. Nikos Komninos, N.; Eleni Philippou, E.; Pitsillides, A. Survey in Smart Grid and Smart Home Security:
Issues, Challenges and Countermeasures. IEEE Commun. Surv. Tutor. 2014, 16, 1933–1954. [CrossRef]
33. Li, W.; Zhang, X. Simulation of the smart grid communications: challenges, techniques, and future trends.
Comput. Electr. Eng. 2014, 40, 270–288. [CrossRef]
34. Madani, V.; Das, R.; Aminifar, F.; McDonald, J.; Venkata, S.S.; Novosel, D.; Bose, A.; Shahidehpour, M.
Distribution Automation Strategies Challenges and Opportunities in a Changing Landscape. IEEE Trans.
Smart Grid 2015, 6, 2157–2165. [CrossRef]
35. Das, R.; Madani, V.; Aminifar, F.; McDonald, J.; Venkata, S.S.; Novosel, D.; Bose, A.; Shahidehpour, M.
Distributed Automation strategies: Evolution of Technologies and the business case. IEEE Trans. Smart Grid
2015, 6, 2166–2175. [CrossRef]
36. Barsali, S.; Ceraolo, M.; Giglioli, R.; Poli, D. Storage applications for Smartgrids. Electr. Power Syst. Res. 2015,
120, 109–117. [CrossRef]
37. Erdinc, O.; Paterakis, N.G.; Pappi, I.N.; Bakirtzis, A.G.; Catalao, J.P.S. A new perspective for sizing of
distributed generation and energy storage for smart house holds under demand response. Appl. Energy 2015,
143, 26–37. [CrossRef]
38. Sbordone, D.A.; Martirano, L.; Falvo, M.C.; Chiavaroli, L.; Pietra, B.D.; Bertini, I. Reactive power control for
an energy storage system: A real implementation in a Micro-Grid. Netw. Comput. Appl. 2015, 59, 250–263.
[CrossRef]
39. Hemmati, R.; Saboori, H.; Saboori, S. Assessing wind uncertainty impact on short term operation scheduling
of coordinated energy storage systems and thermal units. Renew. Energy 2016, 95, 74–84. [CrossRef]
40. Debnath, U.K.; Ahmad, I.; Habibi, D.; Saber, A.Y. Energy storage model with gridable vehicles for economic
load dispatch in smart grid. Electr. Power Energy Syst. 2015, 64, 1017–1024. [CrossRef]
41. Colak, I.; Kabalci, E.; Fulli, G.; Lazarou, S. A survey on the contributions of power electronics to smart grid
systems. Renew. Sustain. Energy Rev. 2015, 47, 562–579. [CrossRef]
42. Jian, L.; Zheng, Y.; Xiao, X.; Chan, C.C. Optimal scheduling for vehicle-to-grid operation with stochastic
connection of plug-in electrical vehicles to smart grid. Appl. Energy 2015, 146, 150–161. [CrossRef]
43. Shaaban, M.F.; Eajal, A.A.; El-Saadany, E.F. Coordinated charging of plug-in hybrid electrical vehicles in
smart hybrid AC/DC distribution systems. Renew. Energy 2015, 82, 92–99. [CrossRef]
44. Liu, L.; Fong, F.; Liu, X.; Peng, Y.; Wang, Q. A review on electric vehicles interacting with renewable energy
in smart grid. Renew. Sustain. Energy Rev. 2015, 51, 648–661. [CrossRef]
45. Yong, J.Y.; Ramachandaramurthy, V.K.; Tan, K.M.; Mithulananthan, N. A review on the state-of-the-art
technologies of electric vehicle, its impacts and prospects. Renew. Sustain. Energy Rev. 2015, 49, 365–385.
[CrossRef]
46. Tan, K.M.; Ramachandaramurthy, V.K.; Yong, J.Y. Integration of electric vehicles in smart grid: A review
on vehicle to grid technologies and optimization techniques. Renew. Sustain. Energy Rev. 2016, 53, 720–732.
[CrossRef]
47. Hare, J.; Shi, X.; Gupta, S.; Bazzi, A. Fault diagnostics in smart micro-grids: A survey. Renew. Sustain.
Energy Rev. 2016, 60, 1114–1124. [CrossRef]
48. Kamel, R.M.; Alsaffar, M.A.; Habib, M.K. Noval and simple scheme for Micro-Grid Protection by connecting
its loads neutral points: A review on Micro-Grid Protection techniques. Renew. Sustain. Energy Rev. 2016, 58,
931–942. [CrossRef]
49. Mirsaeidi, S.; Said, D.M.; Mustafa, M.W.; Habibuddin, M.H.; Ghaffari, K. Fault location and isolation in
micro-grids using a digital central protection unit. Renew. Sustain. Energy Rev. 2016, 56, 1–17. [CrossRef]
50. Khan, A.R.; Mahmood, A.; Safdar, A.; Khan, Z.A.; Khan, N.A. Load forecasting, dynamic pricing and DSM
in smart grid: A review 2016. Renew. Sustain. Energy Rev. 2016, 54, 1311–1322. [CrossRef]
51. Logenthiran, T.; Srinivasan, D.; Shun, T.Z. Demand side management in smart grid using heuristic
optimization. IEEE Trans. Smart Grid 2012, 3, 1244–1252. [CrossRef]
Energies 2017, 10, 501 42 of 47
52. Gelazanskas, L.; Gamage, K.A.A. Demand side management in smart grid: A review and proposals for
future direction. Sustain. Cities Soc. 2014, 11, 22–30. [CrossRef]
53. Siano, P. Demand response and smart grids—A survey. Renew. Sustain. Energy Rev. 2014, 30, 461–478. [CrossRef]
54. Evangelopoulos, V.A.; Georgilakis, P.S.; Hatziargyriou, N.D. Optimal operation of smart distribution
networks: A review of models, methods and future research 2016. Electr. Power Syst. Res. 2016, 140,
95–106. [CrossRef]
55. Wright, P.S.; Christensen, A.E.; Davis, P.N.; Larson, B.; Lippert, T.; Patel, P. Power Quality Propagation
Measurements in Smart Grids. In Proceedings of the IEEE Conference on Precision Electromagnetic
Measurements, Ottawa, ON, Canada, 10–15 July 2016; pp. 1–2.
56. Wang, P.; Liang, D.H.; Yi, J.; Lyons, P.F.; Davison, P.J.; Taylor, P.C. Integrating electrical energy storage
into coordinated voltage control schemes for distribution networks 2014. IEEE Trans. Smart Grid 2014, 5,
1018–1032. [CrossRef]
57. Pathirikkat, G.; Reddy, M.J.B.; Mohanta, D. Stability concerns in smart grid with emerging renewable energy
technologies. Electr. Power Comput. Syst. 2014, 42, 418–425.
58. Hasanvand, S.; Nayeripour, M.; Waffenschmidt, E.; Abarghouei, H.F. A new approach to transform
an existing distribution network into a set of micro-grids for enhancing reliability and sustainability.
Appl. Soft Comput. 2017, 52, 120–134. [CrossRef]
59. Depuru, S.S.S.R.; Wang, L.; Devabhaktuni, V. Smart Meters for Power Grid: Challenges, Issues, Advantages
and Status. Renew. Sustain. Energy Rev. 2011, 15, 2736–2742. [CrossRef]
60. Yang, Q.; Barria, J.A.; Green, T.C. Communication infrastructures for distributed control of power distribution
networks. IEEE Trans. Ind. Inform. 2011, 7, 316–327. [CrossRef]
61. Ting, L.; Yanan, S.; Yang, L.; Yuhong, Z.; Yucheng, D.; Wang, C.S. Abnormal traffic-indexed state estimation:
A cyber–physical fusion approach for smart grid attack detection. Future Gener. Comput. Syst. 2015, 49,
94–103.
62. Fan, X.; Gong, G. Security challenges in smart-grid metering and control systems. Technol. Innov. Manag. Rev.
2013, 3, 42–49.
63. Yu, X.; Xue, Y. Smart Grids: A Cyber–Physical Systems Perspective. Proc. IEEE 2016, 104, 1058–1070. [CrossRef]
64. Divshali, P.H.; Choi, B.J. Electrical Market Management Considering Power System Constraints in Smart
Distribution Grids. Energies 2016, 9, 405. [CrossRef]
65. Tafreshi, S.M.M.; Lahiji, A.S. Long-term market equilibrium in smart grid paradigm with introducing
demand response provider in competition. IEEE Trans. Smart Grid 2015, 6, 2794–2806. [CrossRef]
66. Safdarian, A.; Firuzabad, M.F.; Lehtonen, M. Benefits of Demand Response on Operation of Distribution
Networks: A Case Study. IEEE Syst. J. 2016, 10, 189–197. [CrossRef]
67. Kalambe, S.; Agnihotri, G. Loss minimization techniques used in distribution network: bibliographical
survey. Renew. Sustain. Energy Rev. 2014, 29, 184–200. [CrossRef]
68. Chen, T.H.; Huang, W.T.; Gu, J.C.; Pu, G.C.; Hsu, Y.F.; Guo, T.Y. Feasibility study of upgrading primary
feeders from radial and open loop to normally closed-loop arrangement. IEEE Trans. Power Syst. 2004, 19,
1308–1316. [CrossRef]
69. Simanjorang, R.; Miura, Y.; Ise, T. Controlling voltage profile in loop distribution system with Distributed
Generation using series type BTB converter. In Proceedings of the 7th International Conference on Power
Electronics, Daegu, Korea, 22–26 October 2007; pp. 1167–1172.
70. Jeong, B.S.; Chun, Y.H. Feeder Loop Line Control for the Voltage Stabilization of Distribution Network with
Distributed Generators. J. Electr. Eng. Technol. 2014, 9, 1–5. [CrossRef]
71. Sayed, M.A.; Takeshita, T. Line Loss Minimization in Isolated Substations and Multiple Loop Distribution
Systems Using the UPFC 2014. IEEE Trans. Power Electron. 2014, 29, 5813–5822. [CrossRef]
72. Kazmi, S.A.A.; Shahzad, M.K.; Shin, D.R. Voltage stability index for Distribution Network connected in Loop
Configuration. IETE J. Res. Taylor Francis 2017, 63, 1–13. [CrossRef]
73. Kazmi, S.A.A.; Hasan, S.F.; Shin, D.R. Multi criteria decision analysis for optimum DG placement in smart
grids. In Proceedings of the 2015 IEEE Innovative Smart Grid Technologies—Asia (ISGT ASIA), Bangkok,
Thailand, 3–6 November 2015; pp. 1–5.
74. Roy, N.K.; Pota, H.R. Current Status and Issues of Concern for the Integration of Distributed Generation into
Electricity Networks. IEEE Syst. J. 2015, 9, 933–944. [CrossRef]
Energies 2017, 10, 501 43 of 47
75. Herault, M.C.A.; Doye, N.N.; Gandioli, C.; Hadjsaid, N.; Tixador, P. Meshed distribution network vs.
reinforcement to increase the distributed generation connection. Sustain. Energy Grids Netw. 2015, 1, 20–27.
[CrossRef]
76. Hadjsaid, N.; Alvarez-Hérault, M.C.; Caire, R.; Raison, B.; Descloux, J.; Bienia, W. Novel architectures and
operation modes of Distribution Network to increase DG integration. In Proceedings of the 2010 IEEE Power
and Energy Society General Meeting, Minneapolis, MN, USA, 25–29 July 2010; pp. 1–6.
77. Sharma, S.; Abhyankar, A. Loss Allocation for Weakly Meshed Distribution System using Analytical
Formulation of Shapley Value. IEEE Trans. Power Syst. 2017, 32, 1369–1377. [CrossRef]
78. Akorede, M.F.; Hizam, H.; Aris, I.; Ab-Kadir, M.Z.A. Effective method for optimal allocation of distributed
generation units in meshed electric power systems. IET Gener. Transm. Distrib. 2011, 5, 276–287. [CrossRef]
79. Lasseter, R.H.; Paigi, P. Microgrid: A Conceptual Solution. In Proceedings of the IEEE 35th Annual Power
Electronics Specialists Conference (PESC’04), Aachen, Germany, 20–25 June 2004; pp. 4285–4290.
80. Guerrero, J.M.; Chandorkar, M.; Lee, T.L.; Loh, P.C. Advanced control architectures for intelligent
microgrids—Part I: Decentralized and hierarchical control. IEEE Trans. Ind. Electron. 2013, 60, 1254–1262.
[CrossRef]
81. Guerrero, J.M.; Loh, P.C.; Lee, T.L.; Chandorkar, M. Advanced Control Architectures for Intelligent
Microgrids—Part II: Power Quality, Energy Storage, and AC/DC Microgrids. IEEE Trans. Ind. Electron. 2013,
60, 1263–1270. [CrossRef]
82. Che, L.; Khodayar, M.; Shahidehpour, M. Only connect: Microgrids for distribution system restoration.
IEEE Power Energy Mag. 2014, 12, 70–81.
83. Kazmi, S.A.A.; Hasan, S.F.; Shin, D.R. Analyzing the integration of Distributed Generation into smart grids.
In Proceedings of the IEEE 10th Conference Industrial Electronics and Applications (ICIEA), Auckland,
New Zealand, 15–17 June 2015; pp. 1–5.
84. IEEE Std. 1547.4. IEEE Guide for Design, Operation and Integration of Distributed Resource Island Systems
with Electric Power Systems. 2011. Available online: www.seari-nc.com/iec/2012828152334.pdf (accessed on
14 August 2016).
85. Che, L.; Zhang, X.; Shahidehpour, M.; Alabdulwahab, A.; Al-Turki, Y. Optimal planning of Loop-Based
Microgrid Topology. IEEE Trans. Smart Grid 2016, 99, 1–11. [CrossRef]
86. Chaouachi, A.; Kamel, R.M.; Andoulsi, R.; Nagasaka, K. Multiobjective Intelligent Energy Management for a
Microgrid. IEEE Trans. Ind. Electron. 2013, 60, 1688–1699. [CrossRef]
87. Lasseter, R.H.; Eto, J.H.; Schenkman, B.; Stevens, J.; Vollkommer, H.; Klapp, D.; Linton, E.; Hurtado, H.;
Roy, J. CERTS Microgrid Laboratory Test Bed. IEEE Trans. Power Deliv. 2011, 26, 325–332. [CrossRef]
88. Mandelli, S.; Barbieri, J.; Mereu, R.; Colombo, E. Off-grid systems for rural electrification in developing
countries: Definitions, classification and a comprehensive literature review. Renew. Sustain. Energy Rev. 2016,
58, 1621–1646. [CrossRef]
89. Vasiljevska, J.; Lopes, J.A.P.; Matos, M.A. Integrated micro-generation, load and energy storage control
functionality under the multi micro-grid concept. Electr. Power Syst. Res. 2013, 95, 292–301. [CrossRef]
90. Asmus, P. Microgrids, virtual power plants and our distributed energy future. Electr. J. 2010, 23, 72–82. [CrossRef]
91. Mancarella, P. MES (multi-energy systems): An overview of concepts and evaluation models. Energy 2014,
65, 1–17. [CrossRef]
92. Peik-Herfeh, M.; Seifi, H.; Sheikh-El-Eslami, M.K. Decision making of a virtual power plant under
uncertainties for bidding in a day-ahead market using point estimate method. Electr. Power Energy Syst.
2013, 44, 88–98. [CrossRef]
93. Saponara, S.; Bacchillone, T. Network architecture, security issues, and hardware implementation of a home
area network for smart grid. J. Comput. Netw. Commun. 2012, 2012, 5345121. [CrossRef]
94. Zhang, D.; Shah, N.; Papageorgiou, L.G. Efficient energy consumption and operation management in a smart
building with microgrid. Energy Convers. Manag. 2013, 74, 209–222. [CrossRef]
95. Wang, Z.; Wang, L.; Dounis, A.I.; Yang, R. Integration of plug-in hybrid electric vehicles into energy and
comfort management for smart building. Energy Build. 2012, 47, 260–266. [CrossRef]
96. Romero, S.R.; Santos, A.C.; Pérez, F.M.; Rey, A.L. Integration of distributed generation in the power
distribution network: The need for smart grid control systems, communication and equipment for a
smart city—Use cases. Renew. Sustain. Energy Rev. 2014, 38, 223–234. [CrossRef]
Energies 2017, 10, 501 44 of 47
97. European Commission. European Smart Grids technology platform, vision and strategy for
Europe’s electricity. 2006. Available online: http://ec.europa.eu/research/energy/smart-grid (accessed on
14 September 2016).
98. Gangale, F.; Mengolini, A.; Onyeji, I. Consumer engagement: An insight from smart grid projects in Europe.
Energy Policy 2013, 60, 621–628. [CrossRef]
99. IqtiyaniIlham, N.; Hasanuzzaman, M.; Hosenuzzaman, M. European smart grid prospects, policies,
and challenges. Renew. Sustain. Energy Rev. 2017, 67, 776–790. [CrossRef]
100. Brown, R.E. Impact of Smart Grid on Distribution System Design. In Proceedigns of the 2008 IEEE Power
and Energy Society General Meeting—Conversion and Delivery of Electrical Energy in the 21st Century,
Pittsburgh, PA, USA, 20–24 July 2008; pp. 1–4.
101. Smart Energy Reference Architecture SERA; Microsoft: Redmond, WA, USA, 2009.
102. NIST Special Publication 1108 NIST Framework and Roadmap for Smart Grid Interoperability Standards; NIST:
Gaithersburg, MD, USA, 2010.
103. Zhao, X.; Yusheng, X.; Po, W.K. Recent advancements on smart grids in China. Electr. Power Comput. Syst.
2014, 42, 251–261.
104. The Strategic Energy Plan of Japan; Summary; Ministry of Economy Trade and Industry Japan: Tokyo,
Japan, 2010.
105. Korean Smart Grid Institute. 2016. Available online: http://www.smartgrid.or.kr/eng.html (accessed on
16 August 2016).
106. Kim, S.T.; Lim, B.I.; Park, W.K.; Kim, M.K.; Son, S.Y. An analysis on the effectiveness of a smart grid test-bed
project: The Korean case. Renew. Sustain. Energy Rev. 2016, 59, 868–875. [CrossRef]
107. Smart Grid Australia. Available online: http://www.smartgridsmartcity.com.au (accessed on 20 August 2016).
108. Haidar, A.M.A.; Muttaqi, K.; Sutanto, D. Smart Grid and its future perspectives in Australia. Renew. Sustain.
Energy Rev. 2015, 51, 1375–1389. [CrossRef]
109. Selvam, M.M.; Gnanadass, R.; Padhy, N.P. Initiatives and technical challenges in smart distribution grid.
Renew. Sustain. Energy Rev. 2016, 58, 911–917. [CrossRef]
110. Durieux, O.; Wilde, V.D.; Lambin, J.J.; Otjacques, S.; Lefort, M. Smart Grid Technologies Feasibility
Study: Increasing Decentralized Generation Power Injection Using Global Active Network Management.
In Proceedings of the CIRED 21st International Conference on Electricity Distribution Frankfurt, Frankfurt,
Germany, 6–9 June 2011; pp. 1–6.
111. International Energy Commission (IEA). How2Guide for Smart Grids in Distribution Networks, Roadmap
Development and Implementation. 2016. Available online: http://cluergal.org/media/zinnia/files/Smart_
Grids_in_DistributionNetorks.pdf (accessed on 25 December 2016).
112. Lawrence Berkeley National Laboratory. CERTS Microgrid Laboratory Test Bed. Available online:
http://certs.lbl.gov/pdf/certs-mgtb-app-o.pdf (accessed on 29 December 2016).
113. DER IREC 22@Microgrid Project (n.d.). Available online: der-microgrid.gtd.es (accessed on 26 December 2016).
114. Enrich, R.; Skovron, P.; Tolos, M.; Moreno, M.T. Microgrid Management Based on Economic and Technical
Criteria. In Proceedings of the IEEE International Energy Conference and Exhibition (ENERGYCON),
Florence, Italy, 9–12 September 2012; pp. 551–556.
115. Jayawarna, N.; Jenkins, N.; Barnes, M.; Lorentzou, M.; Papthanassiou, S.; Hatziagyriou, N. Safety Analysis
of a MicroGrid. In Proceedings of the 2005 International Conference on Future Power Systems (FPS),
Amsterdam, The Netherlands, 16–18 November 2005; pp. 1–7.
116. Warmer, C.J.; Hommelberg, M.P.F.; Roossien, B.; Kok, J.K.; Turkstra, J.W. A field test using agents for
coordination of residential micro-chip. In Proceedings of the 2007 International Conference on Intelligent
Systems Applications to Power Systems, Kaohsiung, Taiwan, 5–8 November 2007; pp. 1–4.
117. Gungor, V.C.; Sahin, D.; Kocak, T.; Ergüt, S.; Buccella, C.; Cecati, C.; Hancke, G.P. Smart Grid and Smart
Homes: Key Players and Pilot Projects. IEEE Ind. Electron. Mag. 2012, 6, 18–34. [CrossRef]
118. Kohno, M.; Masuyama, Y.; Kato, N.; Tobe, A. Hitachi’s Smart City Solutions for New Era of Urban
Development.pdf. pp. 79–88. Available online: http://www.hitachi.com/rev/pdf/2011/r2011_02_101.pdf
(accessed on 25 August 2016).
119. Yamagata, Y.; Seya, H. Proposal for a local electricity-sharing system: A case study of Yokohama city, Japan.
IET Intell. Transp. Syst. 2015, 9, 38–49. [CrossRef]
Energies 2017, 10, 501 45 of 47
120. Izadian, A.; Girrens, N.; Khayyer, P. Renewable Energy Policies, a Brief Review of the Latest U.S. and E.U.
Policies. IEEE Ind. Electron. Mag. 2013, 7, 21–34. [CrossRef]
121. Zakariazadeh, A.R.; Jadid, S.; Siano, P. Stochastic multi-objective operational planning of smart distribution
systems considering demand response programs. Electr. Power Syst. Res. 2014, 111, 156–168. [CrossRef]
122. Mena, M.; Hennebel, Y.F.; Li, C.; Ruiz, E.Z. A risk-based simulation and multi-objective optimization
framework for the integration of distributed renewable generation and storage. Renew. Sustain. Energy Rev.
2014, 37, 778–793. [CrossRef]
123. Kumar, D.; Samantaray, S.R. Design of an advanced electric power distribution systems using seeker
optimization algorithm. Electr. Power Energy Syst. 2014, 63, 196–217. [CrossRef]
124. Nick, M.; Cherkaoui, R.; Paolone, M. Optimal Allocation of Dispersed Energy Storage Systems in Active
Distribution Networks for Energy Balance and Grid Support 2014. IEEE Trans. Power Syst. 2014, 29, 2300–2310.
125. Kayal, P.; Chanda, C.K. A multi-objective approach to integrate solar and wind energy sources with electrical
distribution network. Sol. Energy 2015, 112, 397–410.
126. Kumar, D.; Samantaray, S.R. Implementation of multi-objective seeker-optimization-algorithm for optimal
planning of primary distribution systems including DSTATCOM. Electr. Power Energy Syst. 2016, 77, 439–449.
127. Arasteha, H.; Sepasiana, M.S.; Vahidinasab, V.; Siano, P. SoS-based multiobjective distribution system
expansion planning. Electr. Power Syst. Res. 2016, 141, 392–406. [CrossRef]
128. Buayai, K.; Ongsaku, W.; Mithulananthan, N. Multi-objective micro-grid planning by NSGA-II in primary
distribution system. Eur. Trans. Electr. Power 2012, 22, 170–187.
129. Chen, T.H.; Lin, E.H.; Yang, N.C.; Hsieh, T.Y. Multi-objective optimization for upgrading primary feeders
with distributed generators from normally closed loop to mesh arrangement. Electr. Power Energy Syst. 2012,
45, 413–419. [CrossRef]
130. Ganguly, S.; Sahoo, N.C.; Das, D. A novel multi-objective PSO for electrical distribution system planning
incorporating distributed generation. Energy Syst. 2010, 1, 291–337. [CrossRef]
131. Sanseverino, E.R.; Di Silvestre, M.L.; Ippolito, M.G.; Re, G.L. An execution, monitoring and replanning
approach for optimal energy management in microgrids. Energy 2011, 36, 3429–3436.
132. Moghaddam, A.A.; Seifi, A.; Niknam, T.; Pahlavani, M.R.A. Multi-objective operation management of a
renewable MG (micro-grid) with back-up micro-turbine/fuel cell/battery hybrid power source. Energy 2011,
36, 6490–6507. [CrossRef]
133. Niknam, T.; Abarghooee, R.A.; Narimani, M.R. An efficient scenario-based stochastic programming
framework for multi-objective optimal micro-grid operation. Appl. Energy 2012, 99, 455–470. [CrossRef]
134. Motevasel, M.; Seifi, A.R.; Niknam, T. Multi-objective energy management of CHP (combined heat and
power)-based micro-grid. Energy 2013, 51, 123–136. [CrossRef]
135. Aghaei, J.; Alizadeh, M.I. Multi-objective self-scheduling of CHP (combined heat and power)-based
microgrids considering demand response programs and ESSs (energy storage systems). Energy 2013, 55,
1044–1054. [CrossRef]
136. Carpinelli, G.; Caramia, P.; Mottola, F.; Proto, D. Exponential weighted method and a compromise
programming method for multi-objective operation of plug-in vehicle aggregators in microgrids. Electr. Power
Energy Syst. 2014, 56, 374–384. [CrossRef]
137. Sheng, W.; Liu, K.; Meng, X.; Ye, X.; Liu, Y. Research and practice on typical modes and optimal allocation
method for PV-Wind-ES in Microgrid. Electr. Power Syst. Res. 2015, 120, 242–255. [CrossRef]
138. Prommee, W.; Ongsakul, W. Multi-objective optimal placement of protective devices on microgrid using
improved binary multi-objective PSO. Int. Trans. Electr. Energy Syst. 2015, 25, 2621–2638. [CrossRef]
139. Shadmand, M.B.; Balog, R.S. Multi-Objective Optimization and Design of Photovoltaic-Wind Hybrid System
for Community Smart DC Microgrid. IEEE Trans. Smart Grid 2014, 5, 2635–2643. [CrossRef]
140. Wu, H.; Zhuang, H.; Zhang, W.; Ding, M. Optimal allocation of microgrid considering economic dispatch
based on hybrid weighted bilevel planning method and algorithm improvement. Electr Power Energy Syst.
2016, 75, 28–37. [CrossRef]
141. Perera, A.T.D.; Attalage, R.A.; Perera, K.K.C.K.; Dassanayake, V.P.C. A hybrid tool to combine multi-objective
optimization and multi-criterion decision making in designing standalone hybrid energy systems.
Appl. Energy 2013, 107, 412–425. [CrossRef]
Energies 2017, 10, 501 46 of 47
142. Perera, A.T.D.; Attalage, R.A.; Perera, K.K.C.K.; Dassanayake, V.P.C. Designing standalone hybrid energy
systems minimizing initial investment, life cycle cost and pollutant emission. Appl. Energy 2013, 107, 220–230.
[CrossRef]
143. Ippolito, M.G.; Silvestre, M.L.D.; Sanseverino, E.R.; Zizzo, G.; Graditi, G. Multi-objective optimized
management of electrical energy storage systems in an islanded network with renewable energy sources
under different design scenarios. Energy 2014, 64, 648–662. [CrossRef]
144. Zhao, B.; Zhang, X.; Li, P.; Wang, K.; Xue, M.; Wang, C. Optimal sizing, operating strategy and operational
experience of a stand-alone microgrid on Dongfushan Island. Appl. Energy 2014, 113, 1656–1666. [CrossRef]
145. Guo, L.; Liu, W.; Jiao, B.; Hong, B.; Wang, C. Multi-objective stochastic optimal planning method for
stand-alone microgrid system. IET Gener. Transm. Distrib. 2014, 8, 1263–1273. [CrossRef]
146. Lopez, R.D.; Monreal, I.R.C.; Yusta, J.M. Optimisation of PV-wind-diesel-battery stand-alone systems to
minimise cost and maximise human development index and job creation. Renew. Energy 2016, 94, 280–293.
[CrossRef]
147. Guo, L.; Wang, N.; Lu, H.; Li, X.; Wang, C. Multi-objective optimal planning of the stand-alone microgrid
system based on different benefit subjects. Energy 2016, 116, 353–363. [CrossRef]
148. Vasiljevska, J.; Pecas, J.A.; Lopes, J.A.; Matos, M.A. Evaluating the impacts of the multi microgrid concept
using multicriteria decision aid. Electr. Power Syst. Res. 2012, 91, 44–51. [CrossRef]
149. Zhang, L.; Gari, N.; Hmurcik, L.V. Energy management in a microgrid with distributed energy resources
2014. Energy Convers. Manag. 2014, 78, 297–305. [CrossRef]
150. Arefifar, S.A.; Mohamed, Y.A.R.I.; El-Fouly, T. Optimized Multiple Microgrid-Based Clustering of Active
Distribution Systems Considering Communication and Control Requirements 2015. IEEE Trans. Ind. Electron.
2015, 62, 711–723. [CrossRef]
151. Belgana, A.; Rimal, B.P.; Maier, M. Open Energy Market Strategies in Microgrids: A Stackelberg Game
Approach Based on a Hybrid Multiobjective Evolutionary Algorithm. IEEE Trans. Smart Grid 2015, 6,
1243–1252. [CrossRef]
152. Lv, T.; Ai, Q.; Zhao, Y. A bi-level multi-objective optimal operation of grid-connected microgrids. Electr. Power
Syst. Res. 2016, 131, 60–70. [CrossRef]
153. Gong, J.; Xie, D.; Jiang, C.; Zhang, Y. Multiple Objective Compromised Method for Power Management in
Virtual Power Plants. Energies 2011, 4, 700–716. [CrossRef]
154. Yang, H.; Yi, D.; Zhao, J.; Dong, Z.Y. Distributed Optimal Dispatch of Virtual Power Plant via Limited
Communication. IEEE Trans. Power Syst. 2013, 28, 3511–3512. [CrossRef]
155. Papaefthymiou, S.V.; Papathanassiou, S.A. Optimum sizing of wind-pumped-storage hybrid power stations
in island systems. Renew. Energy 2013, 64, 187–196. [CrossRef]
156. Dietrich, K.; Latorre, J.M.; Olmos, L.; Ramos, A. Modelling and assessing the impacts of self supply and
market-revenue driven Virtual Power Plants. Electr. Power Syst. Res. 2015, 119, 462–470. [CrossRef]
157. Songli, F.; Qian, A.; Longjian, P. Fuzzy day-ahead scheduling of virtual power plant with optimal confidence
level. IET Gener. Transm. Distrib. 2016, 10, 205–212.
158. Nosratabadi, S.M.; Hooshmand, R.A.; Gholipour, E.; Parastegari, M. A new simultaneous placement of
distributed generation and demand response resources to determine virtual power plant. Trans. Electr.
Energy Syst. 2016, 26, 1103–1120. [CrossRef]
159. Shahnia, F.; Wishart, M.T.; Ghosh, A.; Ledwich, G.; Zare, F. Smart demand side management of low-voltage
distribution networks using multi-objective decision making. IET Gener. Transm. Distrib. 2012, 6, 986–1000.
[CrossRef]
160. Hong, Y.Y.; Lin, J.K.; Wu, C.P.; Chuang, C.C. Multi-Objective Air-Conditioning Control Considering Fuzzy
Parameters Using Immune Clonal Selection Programming 2012. IEEE Trans. Smart Grid 2012, 3, 1603–1610.
[CrossRef]
161. Zhang, D.; Evangelisti, S.; Lettieri, P.; Papageorgiou, L.G. Economic and environmental scheduling of smart
homes with microgrid: DER operation and electrical tasks. Energy Convers. Manag. 2016, 110, 113–124.
[CrossRef]
162. Muralitharan, K.; Sakthivel, R.; Shi, Y. Multiobjective optimization technique for demand side management
with load balancing approach in smart grid. Neurocomputing 2016, 177, 110–119. [CrossRef]
163. Hu, M.; Weir, J.D.; Wu, T. An augmented multi-objective particle swarm optimizer for building cluster
operation decisions. Appl. Soft Comput. 2014, 25, 347–359. [CrossRef]
Energies 2017, 10, 501 47 of 47
164. Safaei, A.; Freire, F.; Antunes, C.H. A life cycle multi-objective economic and environmental assessment of
distributed generation in buildings. Energy Convers. Manag. 2015, 97, 420–427. [CrossRef]
165. Shaikh, P.H.; Nor, N.B.M.; Nallagownden, P.; Elamvazuthi, I.; Ibrahim, T. Intelligent multi-objective control
and management for smart energy efficient buildings. Electr. Power Energy Syst. 2016, 74, 403–409. [CrossRef]
166. Mahbub, M.S.; Cozzini, M.; Ostergaard, P.A.; Alberti, F. Combining multi-objective evolutionary algorithms
and descriptive analytical modelling in energy scenario design. Appl. Energy 2016, 164, 140–151. [CrossRef]
167. Castillo, A.; ONeill, R.P. Computational Performance of Solution Techniques Applied to the ACOPF. 2013.
Available online: http://www.ferc.gov/industries/electric/indus-act/market-planning/opf-papers/acopf-
5-computational-testing.pdf (accessed on 27 December 2016).
168. Wang, J.J.; Jing, Y.Y.; Zhang, C.F.; Zhao, J.H. Review on multi-criteria decision analysis aid in sustainable
energy decision-making. Renew. Sustain. Energy Rev. 2009, 13, 2263–2278. [CrossRef]
169. Kumar, K.; Sah, B.; Singh, A.R.; Deng, Y.; He, X.; Kumar, P.; Bansal, R.C. A review of multi criteria decision
making (MCDM) towards sustainable renewable energy development. Renew. Sustain. Energy Rev. 2017, 69,
596–609. [CrossRef]
© 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access
article distributed under the terms and conditions of the Creative Commons Attribution
(CC BY) license (http://creativecommons.org/licenses/by/4.0/).