Multi-Objective Dynamic Economic Emission Dispatch with Electric Vehicle–Wind Power Interaction Based on a Self-Adaptive Multiple-Learning Harmony-Search Algorithm

Abstract

Dynamic economic emission dispatch (DEED) in combination with renewable energy has recently attracted much attention. However, when wind power is considered in DEED, due to its generation uncertainty, some additional costs will be introduced and the stability of the dispatch system will be affected. To address this problem, in this paper, the energy-storage characteristic of electric vehicles (EVs) is utilized to smooth the uncertainty of wind power and reduce its impact on the system. As a result, an interaction model between wind power and EV (IWEv) is proposed to effectively reduce the impact of wind power uncertainty. Further, a DEED model based on the IWEv system (${\mathrm{DEED}}_{\mathrm{IWEv}}$) is proposed. For solving the complex model, a self-adaptive multiple-learning multi-objective harmony-search algorithm is proposed. Both elite-learning and experience-learning operators are introduced into the algorithm to enhance its learning ability. Meanwhile, a self-adaptive parameter adjustment mechanism is proposed to adaptively select the two operators to improve search efficiency. Experimental results demonstrate the effectiveness of the proposed model and the superiority of the proposed method in solving the ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model.

1. Introduction

With the rapid development of society and the economy, the demand for electric energy is also rising rapidly. Meanwhile, the electric power industry is strictly controlled by the government for energy-saving and emission reduction. In this context, it is crucial to optimize the operation of the power system by scheduling the generator outputs according to the predicted load demands over a certain period to reduce, simultaneously, fuel costs and pollution emissions. Therefore, dynamic economic emission dispatch (DEED) has attracted much attention due to its practical nature and because it is more in line with the actual short-term load demands.

A typical DEED problem is a multi-objective optimization problem that generally aims to minimize the fuel costs and the pollution emissions simultaneously. Moreover, several practical constraints should be considered at the same time when optimizing the two objectives, such as power balance constraints, ramp rate limits, output power constraints, spinning reserve constraints, etc. The DEED model is not only suitable for dynamically dispatching the generator outputs of the system according to the different load demands at a certain interval [1], but also accords with the dynamic properties of EV charging and discharging behaviors and the uncertainty of wind power. Therefore, the research of combining DEED and renewable energy has recently gained much interest.

As a renewable energy, wind power was introduced into the grid to reduce the generation of traditional thermal power units, thus reducing the consumption of fossil fuels and pollution emissions [2,3,4]. As for the existing literature on power dispatch with wind power generation, Liu et al. in [5] developed a load allocation model to consider the impact of wind power on emission control. Zhang et al. in [6] proposed a probability distribution model with a “generic distribution” to predict the wind power errors in economic dispatch problems. Hu et al. in [7] considered dynamic economic emission dispatch (DEED) with wind power under energy market reforms. Aghaei et al. in [8] proposed a scenario-based stochastic programming framework to model the stochastic nature of load demand. In [9], Jangir et al. proposed to solve the economic-emission constraint problem in wind power integrated systems using the grey wolf optimizer algorithm. Due to its uncertainty, when wind power generation exceeds the needs of the dispatching system, it will cause waste. When wind power generation is insufficient to meet the needs of the dispatching system, an additional spinning reserve from the system is required and some cost will be incurred. It is also worthwhile studying how to eliminate the additional costs caused by the uncertainty of wind power generation. Chen et al. [10] proposed a constrained multi-objective population extreme value optimization algorithm considering the uncertainty of wind power generation. Hagh et al. in [11] used the exchange market algorithm to solve the EED problem with wind farms. In [12], Jin et al. considered the factors that available wind power is both overestimated and underestimated, and proposed an EED model for to address this.

Moreover, with the rapid development of EVs, an increasing number of them are integrated into our life [13], and the vast number of EVs also impose a burden on the power grid. Still, a certain number of EVs can also be used as energy storage elements to reserve the power [14,15,16,17]. Researchers have added EVs to the grid in a V2G manner [18,19,20,21], but have not realized the dynamic management of EV charging and discharging, and have not truly integrated EVs to the DEED model. To address the uncertainty of wind power and take advantage of electric vehicles as energy storage elements, several studies were conducted combining EVs with wind power [22]. In [23], Qu et al. considered EVs and wind power generation in dynamic power dispatch using the MOEA/D algorithm. Zhang et al. in [24] combined EVs and wind power to develop a multi-objective hydrothermal wind power with the EV dispatch (MOHTWES) model. Zou et al. in [25] proposed a multi-objective virus colony search algorithm for optimizing dynamic economic and emission scheduling of EVs and wind power. The above studies combine EVs and wind power.

It follows from the above that current research analyzes the additional cost caused by wind power uncertainty, but does not provide a satisfactory solution to reduce such cost. Further, in these studies, the EVs and wind power are hybridized in a simple way and there is no actual interaction between them. Therefore, in this paper, we propose a model based on the interaction between wind power generation and EVs: when the generated wind power cannot meet the dispatch demand, the EV will discharge to compensate, and when the generated wind power exceeds the dispatch demand, the EV will be charged to absorb the excessive power. Further, a new DEED model based on the interaction between EVs, and wind power is proposed to reduce the additional cost of wind power. The proposed ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model integrates two objective functions of cost and emission, and combines some equality and inequality constraints, such as the power balance constraint, owner travel constraint, spinning reserve constraint, and so on.

In recent years, swarm intelligence optimization algorithms were widely used to solve the practical optimization problem in many fields [26,27] because of their good global search and convergence performance and strong robustness. Meanwhile, such algorithms were also applied to solve the DEED problem. For example, Yan et al. in [1] developed a novel multi-objective pigeon-inspired optimization with double disturbance to solve the basic DEED problem. Basu et al. in [28] employed the particle swarm optimization algorithm to optimize the DEED. Jangir et al. in [9] used the grey wolf optimizer algorithm to solve the economic emission dispatch problem with the integration of wind power.

The proposed ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model is a high-dimensional, strongly coupled, nonlinear, non-convex, and constrained multi-objective problem. To solve this complex problem, a new self-adaptive multiple-learning multi-objective harmony-search algorithm, termed SAMLHS is proposed. Two new learning operators, namely, elite-learning and experience-learning operators are introduced into the HS algorithm to enhance its global and local search abilities, respectively. In addition, a self-adaptive parameter-adjustment mechanism is proposed to adaptively select the two operators to improve the search efficiency of the population. In the experiments, we compare the proposed SAMLHS algorithm with six state-of-the-art algorithms and validate the proposed ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model in different scenarios, while considering different confidence levels, different scales of EVs, and different wind powers. The results show that the proposed model and algorithm are reasonable and effective. The major contributions of this paper are as follows: (i) a new DEED model considering the interaction between EVs and wind power is proposed; (ii) a new self-adaptive multiple-learning multi-objective harmony-search algorithm is proposed to optimize the ${\mathrm{DEED}}_{\mathrm{IWEv}}$ problem; and (iii) numerous experiments are conducted to validate the correctness and effectiveness of the model and the algorithm. It can be concluded that the model and algorithm proposed in this paper provide a good framework and method for addressing the uncertainty of wind power generation.

The rest of the paper is organized as follows. Section 2 studies the modeling of DEED with the $\mathrm{IWEv}$ system. Section 3 describes in detail the proposed SAMLHS algorithm and its implementation in solving the model. The experiment settings, results, and discussion are presented in Section 4. The conclusions are given in Section 5.

2. Modeling of $DEE{D}_{IWEv}$

This section describes the model in detail, and the parameters involved are described in

Table 1. System parameters and their descriptions.

Parameters	Description
$v_t$	wind speed at time $t$
$k_t$, $c_t$	shape and scale parameters
${\mu }_t$, ${\sigma }_t$	mean value and the standard deviation of wind speed
$P_{rate}$	rated power of the wind turbines
$v_{rate}$, $v_{in}, v_{out}$	rated wind speed, the cut-in wind speed and cut-out wind speed
$P_{e.i}$, $N_e$	rated power of the $i$th EV, number of EVs
$P_{w.cur}$, $P_{w.ncur}$	wind power curtailment and no curtailment of $IWEv$ system
$P_{wa.j.t}$	actual wind power from the $j$th wind turbine at time $t$
$P_{wdis.j.t}$	dispatch power of the $j$th wind turbine at time $t$
$T$, $N$	dispatching period, the number of units
${\alpha }_i$, ${\beta }_i$, ${\gamma }_i$, ${\zeta }_i$, ${\mathsf{\phi } }_i$	cost coefficients of the $i$th unit
$P_{i.t}$	the active power of the $i$th unit at time $t$
$D_{j.t}$	direct cost coefficient of the $j$th wind turbine
$N_w$	number of wind turbines
$C_{cwj.t}$, $C_{rwj.t}$	cost coefficient for wind power curtailment and reserve
$F_{int}$	cost of interaction between wind power and EVs.
$a_i$, $b_i$, $c_i$, $d_i, e_i$	emission coefficients of the $i$th unit
$P_{D.t}$, $P_{L.t}$	load demand of the system at time $t$, system loss at time $t$
$B_{ij}$, $B_{i0},$ $B_{00}$	coefficients of the B-coefficient method
$E_{con.t}$	amount of power consumed during the driving of EV
$∆E$, $L$	power consumption per unit time of EVs driving, driving distance.
${\partial }_C \mathrm{and} {\partial }_D$, $∆t$	charging and discharging efficiency, dispatch interval.
$P_{Rch}, P_{RDch}$	charging and discharging rate power
$U_{Rt}$ and $D_{Rt}$	Increase and decrease the rate of the thermal power unit at time $t$
${\omega }_u$ and ${\omega }_d$	spinning reserve coefficients of the wind power
${\vartheta }_u$ and ${\vartheta }_d$	reserve coefficients of EVs
${\eta }_1$ and ${\eta }_2$	two pre-specified confidence levels
$S_{R.t}^u$	spinning reserve demand at time $t$
NP	population size
iteration	the number of iterations
FEs	function evaluations
$r$	penalty coefficient
$\epsilon$	threshold value
$K$	maximum adjustment
$P_{Rch}$, $P_{RDch}$	rate power charging and discharging
SOC	remaining capacity of electric vehicle batteries

.

2.1. Wind Power Modeling

The wind power output is determined by the stochastic wind speed [29,30,31], which is modeled using the widely used two-parameter Weibull distribution function. For each interval, the Cumulative distribution function (CDF) and Probability density function (PDF) of the wind speed is expressed as in the following two equations, respectively.

$$F\left(v_t\right)=1-exp\left[-{\left(v_t/c_t\right)}^{k_t}\right],v_t\ge 0$$

(1)

$$f\left(v_t\right)=\left(k_t/c_t\right){\left(v_t/c_t\right)}^{k_t-1}exp\left[-{\left(v_t/c_t\right)}^{k_t}\right],v_t\ge 0$$

(2)

$k_t$ and $c_t$ are calculated by ${\mu }_t$ and ${\sigma }_t$; the detailed calculation can be found in [32].

The active power of wind turbine $P_{w.t}$ and wind speed $v_t$ are related by:

$$P_{w.t}=\{\begin{array}{c}0, v_t<v_{in} or v_t\ge v_{out} \hfill \\ P_{rate}\frac{v_t-v_{in}}{v_{rate}-v_{in}}, v_{in}\le v_t<v_{rate} \hfill \\ P_{rate}, v_{rate}\le v_t<v_{out} \hfill \end{array}$$

(3)

The PDF of $P_{w.t}$ in the $t$th interval is derived by combining (2) and (3)

$$f\left(P_{w.t}\right)=\{\begin{array}{c}\frac{k_t\left(v_{rate}-v_{in}\right)}{p_{rate}{c}_t}{\left[\left(1+v_{rate}-v_{in}\right)\frac{v_{in}}{c_t}\right]}^{k_t-1}exp\left\{-{\left[\left(1+\frac{v_{rate}-v_{in}}{v_{in}{p}_{rate}}{P}_{w.t}\right)\frac{v_{in}}{c_t}\right]}^{k_t}\right\},0<P_{w.t}<P_{rate}\hfill \\ 1-exp\left[-{\left(\frac{v_{in}}{c_t}\right)}^{k_t}\right]+exp\left[-{\left(\frac{v_{out}}{c_t}\right)}^{k_t}\right], P_{w.t}=0 \hfill \\ exp\left[-{\left(\frac{v_{rate}}{c_t}\right)}^{k_t}\right]-exp\left[-{\left(\frac{v_{out}}{c_t}\right)}^{k_t}\right], P_{w.t}=P_{rate} \hfill \end{array}$$

(4)

Therefore, the CDF of wind power is also be defined by the discrete probability in (−∞, +∞), and can be derived by Equations (1) and (4), expressed as follows,

$$\begin{array}{cc}F\left(P_{w.t}\right)\hfill & = \mathrm{Pr}\left(P_{w.t}<P_{w.t}\right)\hfill \\ & = \{\begin{array}{c}0, P_{w.t}<0\hfill \\ 1-exp\left\{-{\left[\left(1+\frac{v_{rate}-v_{in}}{v_{in}{p}_{rate}}{P}_{w.t}\right)\frac{v_{in}}{c_t}\right]}^{k_t}\right\}+exp\left[-{\left(\frac{v_{out}}{c_t}\right)}^{k_t}\right],0\le P_{w.t}<P_{rate}\hfill \\ 1, P_{w.t}\ge P_{rate} \hfill \end{array}\hfill \end{array}$$

(5)

2.2. EV Dispatch Model

In this model, private vehicles and commuter vehicles are the main research objectives. Because most EVs are used for commuting, their travel time is mainly in the morning and evening, and they are immobile most of the time. When they are immobile, they can participate in grid dispatching by means of V2G. Note that it is not necessary to control the charging/discharging of each EV individually. The hierarchical dispatch model [23] is employed for the EVs, dividing EVs in the same area into several aggregates; these aggregates are controlled by the corresponding aggregation mechanism for charging and discharging. The charging and discharging states of the EVs are represented by a sign function at each dispatching interval:

$$\{\begin{array}{c}{P}_{ch.t}=sign\left(x\right){\displaystyle {\displaystyle \sum }_{i=1}^{N_e}}{P}_{e.i}, x<0\hfill \\ P_{Dch.t = }sign\left(x\right){\displaystyle {\displaystyle \sum }_{i=1}^{N_e}}{P}_{e.i}, x>0\hfill \\ P_{ch.t} and P_{Dch.t}=0, x=0\hfill \end{array}$$

(6)

The description of EV charging and discharging states is shown in

Table 2. The description of EV charging and discharging states.

State	Description
charging	$x<0$, $\mathrm{sign}\left(x\right)$ = −1 and $P_{ch.t}$ < 0, the dispatch system needs to provide power for the EVs.
discharging	$x>0$, $\mathrm{sign}\left(x\right)$ = 1 and $P_{Dch.t}$ > 0, the EVs can feedback power to the dispatch system.
No charging/discharging	$x=0$, EVs do not participate in the power system dispatch.

.

2.3. Interaction between Wind Power and EVs

Because wind power generation is uncertain, it is not always consistent with the demand of the dispatching system [23,32]. Therefore, an interaction model between wind power and EVs is proposed to reduce the impact of the uncertainty and is specified as follows.

When the available wind power produces too much, exceeding the demand of the dispatching system, wind power curtailment occurs. At this time, the EVs can absorb the surplus power by charging; however, the wind power may still exceed the amount that can be dispatched, i.e., $P_{w.j.t}>P_{ch.t}+P_{wdis.j.t}$. At this time, the abandoned wind power can be computed by

$$P_{w.cur}={\displaystyle \sum }_{t=1}^T{\displaystyle \sum }_{j=1}^{N_w}{E}_{ce} \left(P_{w.j.t}-P_{ch.t}-P_{wdis.j.t}\right)$$

(7)

On the contrary, when the available wind power is insufficient, it cannot meet the demand of the dispatching system. In this case, the EVs are required to discharge to compensate for the gap. Nevertheless, the demand of the dispatching system may still not be met. The generated wind power is fully used at this time, and thus there is no curtailment required for the wind power, i.e., $P_{wdis.j.t}>P_{Dch.t}+P_{w.j.t}$. In this case, additional power is invoked from the reserve of the system, denoted as $P_{w.ncur}$, and can be calculated by

$$P_{w.ncur}={\displaystyle \sum }_{t=1}^T{\displaystyle \sum }_{j=1}^{N_w}{E}_{nce} \left(P_{wdis.j.t}-P_{Dch.t}-P_{w.j.t}\right)$$

(8)

$P_{w.j.t}$ is a random variable in the range $\left[0 P_{rate}\right]$, and its change probability is determined by the PDF defined in Equation (4). $E_{ce}$ (∙) and $E_{nce}$ (∙) are the expected values of the wind power curtailment and no curtailment occurring in the $IWEv$ system, respectively. Detailed calculations for $P_{w.cur}$ and $P_{w.ncur}$ can be found in [32].

2.4. Objective Functions

System costs and pollutant emissions are both objective functions of the proposed DEED model with the interaction between wind power and EVs. Specifically, the total system cost is the sum of the fuel cost of the thermal power units, the direct cost of the wind power, and the interaction cost of the $IWEv$ model, expressed as follows,

$$F_C=F_P+F_W+F_{int}$$

(9)

Fuel cost function: The fuel cost function considering the valve-point effect can be defined as the sum of the quadratic function and the sine function [33]:

$$F_P={\displaystyle \sum }_{t=1}^T{\displaystyle \sum }_{i=1}^N\left[{\alpha }_i+{\beta }_i{P}_{i.t}+{\gamma }_i{P}_{i.t}^2+\left|{\zeta }_{i}sin\left\{{\mathsf{\phi }}_i\left(P_i^{min}-P_{i.t}\right)\right\}\right|\right]$$

(10)

$F_W$ is the direct wind power cost that can be expressed in terms of the dispatch wind power,

$$F_W={\displaystyle \sum }_{t=1}^T{\displaystyle \sum }_{i=1}^{N_w}{D}_{j.t}{P}_{wdis.j.t}$$

(11)

Interaction cost of the $\mathrm{IWEv}$ model: Based on the analysis in Section 2.3, the interaction cost can be divided into two parts corresponding to the two interaction scenarios considered in the model, respectively. Specifically, when the available wind power over-exceeds the system demand, and even the excessive power cannot be consumed by the EVs, a curtailment cost will be incurred. On the contrary, when the wind power cannot meet the system demand and the discharging of the EVs still cannot fill the gap, some extra spinning reserve is required and the corresponding cost is generated [34]. Here, both costs are collectively referred to as the interaction cost, which can be expressed as follows:

$$F_{int}={\displaystyle \sum }_{t=1}^T{\displaystyle \sum }_{j=1}^{N_w}{C}_{cwj.t}\times P_{w.cur}+{\displaystyle \sum }_{t=1}^T{\displaystyle \sum }_{j=1}^{N_w}{C}_{rwj.t}\times P_{w.ncur}$$

(12)

Emissions are mainly caused by the process of thermal power generation, including $C{O}_x$, $S{O}_x$, and so on. The relationship between the emission and the active power of the units can be expressed as follows:

$$F_M={\displaystyle \sum }_{t=1}^T{\displaystyle \sum }_{i=1}^N\left[\left(a_i+b_i{P}_{i.t}+c_i{P}_{i.t}^2+d_i\exp \left(e{ }_i P_{i.t}\right) \right)\right]$$

(13)

2.5. System Constraints

The following equality and inequality constraints are considered in the proposed ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model.

System power balance constraints: In each interval, the sum of the total active power of thermal power units, EV charging or discharging power, and the wind power should satisfy the load demands and the system loss. $P_{i.t}$ and $P_{wdis.j.t}$ should also meet the boundary limits.

$${\displaystyle \sum }_{t=1}^N{P}_{i.t}+{\displaystyle \sum }_{j=1}^{N_w}{P}_{wdis.j.t}+P_{Dch.t}=P_{D.t}+P_{L.t}+P_{ch.t}$$

(14)

$$P_i^{min}\le P_{i.t}\le P_i^{max}$$

(15)

$$0\le P_{wdis.j.t}\le P_{rate}$$

(16)

Note that $P_{L.t}$ is calculated using the B-coefficient method [35].

$$P_{L.t}={\displaystyle \sum }_{t=1}^T{\displaystyle \sum }_{i=1}^N{P}_{i.t}{B}_{ij}{P}_{j.t}+{\displaystyle \sum }_{i=1}^N{P}_{i.t}{B}_{i0}+B_{00}$$

(17)

Travel constraint of the EVs owners: The primary purpose of EVs is to meet the travel needs of their owners.

$${\displaystyle \sum }_{t=1}^T{E}_{con.t}={\displaystyle \sum }_{t=1}^T{\partial }_C{P}_{ch.t}∆t-{\displaystyle \sum }_{t=1}^T\frac{1}{{\partial }_D}{P}_{Dch.t}∆t$$

(18)

$E_{con.t}$ can be calculated as,

$$E_{con.t}=∆EL$$

(19)

EVs′remaining power constraint: The remaining power $E_t$ of the EVs at time $t$ is defined as,

$$E_t=E_{t-1}+{\partial }_C{P}_{ch.t}∆t-\frac{1}{{\partial }_D}{P}_{Dch.t}∆t-E_{con.t}$$

(20)

Charging and discharging power constraints: The charging and discharging power of the EVs in each interval should meet the following limits:

$$\{\begin{array}{c}\left|P_{ch.t}\right|\le P_{Rch}\hfill \\ P_{Dch.t}\le P_{RDch}\hfill \end{array}$$

(21)

Ramp rate limits: The ramp rates of the thermal power units should satisfy the following inequality constraints:

$$\{\begin{array}{c}{P}_{i.t}-P_{i.t-1}\le U_{Rt}∆t\\ P_{i.t-1}-P_{i.t}\le D_{Rt}∆t\end{array}$$

(22)

Spinning reserve constraints: To cope with the impact caused by EV charging/discharging and wind power uncertainties, the up and down spinning reserves must be considered in the model, modeled using the form of the chance-constraint expressed as:

$$\mathrm{Pr}\left\{{\displaystyle \sum }_{i=1}^N\min (P_{i.t}^{max}-P_{i.t},\frac{U_{Rt}}{6})+{\vartheta }_u\left(P_{Dch.t}+P_{ch.t}\right)-{\omega }_u{P}_{w.t}-S_{R.t}^u\ge 0\right\}\ge {\eta }_1$$

(23)

$$\mathrm{Pr}\left\{{\displaystyle \sum }_{i=1}^N\min (P_{i.t}-P_{i.t}^{min},\frac{D_{Rt}}{6})+{\vartheta }_d\left(P_{Dch.t}+P_{ch.t}\right)-{\omega }_d\left(P_{rate}-P_{w.t}\right)\ge 0\right\}\ge {\eta }_2$$

(24)

Equations (23) and (24) can be transformed into a deterministic form by Equation (5) and then solved, expressed as Equations (25) and (26),

$$\begin{gathered} \frac{1}{{\omega }_u} \left[{\displaystyle \sum }_{i=1}^N(P_{i.t}^{max}-P_{i.t})+{\vartheta }_u\left(P_{Dch.t}+P_{ch.t}\right)-S_{R.t}^u\right]+\frac{v_{in}{p}_{rate}}{v_{rate}-v_{in} } \\ \ge \frac{c_t{p}_{rate}}{v_{rate}-v_{in}}{\left|\ln \left[1-{\eta }_1+exp\left(-{\left(\frac{v_{out}}{c_t}\right)}^{k_t}\right)\right]\right|}^{1/k_t} \end{gathered}$$

(25)

$$P_{rate}-\frac{1}{{\omega }_d} \left[{\displaystyle \sum }_{i=1}^N(P_{i.t}^{max}-P_{i.t})+{\vartheta }_d\left(P_{Dch.t}+P_{ch.t}\right)\right]+\frac{v_{in}{p}_{rate}}{v_{rate}-v_{in}}\le \frac{c_t{p}_{rate}}{v_{rate}-v_{in}}{\left|\ln \left[{\eta }_2+exp\left(-{\left(\frac{v_{out}}{c_t}\right)}^{k_t}\right)\right]\right|}^{1/k_t}$$

(26)

${\eta }_1$ and ${\eta }_2$ represent the tolerance of the spinning reserve when the available wind power is insufficient for the dispatching demand. $S_{R.t}^u$ is usually taken as 5–10% of load demand.

3. Self-Adaptive Multi-Learning Harmony-Search Algorithm and Its Implementation in the $DEE{D}_{IWEv}$

In this section, the basic HSA and the proposed SAMLHS are introduced in detail. The procedure of SAMLHS and its implementation in solving the model are then given.

3.1. The Basic HSA

The HSA is a population-based intelligent optimization algorithm proposed by Geem and Kim [36] that imitates the process of musicians looking for harmony. When composing harmonies, musicians usually try to memorize the various possible combinations of tones in their memory stores. This process of finding the perfect harmony is similar to the process of finding the optimal solution to a practical problem. As a popular global optimization algorithm, the HSA has been utilized in the fields of function optimization, mechanical structure design, data classification system optimization, and so on [37]. The steps of the basic HSA are described as follows:

Step 1: Initialize the algorithm parameters and harmony memory (HM). Assign the predefined values to the following parameters: HM size (HMS), HM consideration rate (HMCR), pitch adjusting rate (PAR), bandwidth (bw), and the maximum number of function evaluations (Max_FEs). The initial population stored in HM can be generated by:

$$x_{i, j}=L{B}_j+rand·\left(U{B}_j-L{B}_j\right) j=1, 2, \dots ,d$$

(27)

where $rand\in \left[0, 1\right]$, $U{B}_j$ and $L{B}_j$ are, respectively, the upper and lower bounds of the $j$th dimension of the decision variables. d is the variable dimension.

Step 2: Improvise new solutions. A new harmony solution $x_{new}=\left(x_{new, 1}, x_{new, 2},\dots ,x_{new, n}\right)$ is created. The detailed improvision procedure is described in Algorithm 1.

Algorithm 1. The procedure of improvisation in HSA.

1. for $\mathit{j}\mathbf{=}1 to \mathit{d}$

2.       if $\mathit{r}\mathit{a}\mathit{n}\mathit{d}\mathbf{<}\mathit{H}\mathit{M}\mathit{C}\mathit{R}$

3.        ${\mathit{x}}_{\mathit{n}\mathit{e}\mathit{w}, \mathit{j}}\mathbf{\in } \mathbf{\left\{}{\mathit{x}}_{1,\mathit{j}}\mathbf{,} {\mathit{x}}_{2,\mathit{j}},\mathbf{\dots }, {\mathit{x}}_{\mathit{H}\mathit{M}\mathit{S},\mathit{j}\mathit{j}} \mathbf{\right\}} \mathbf{/}\mathbf{/} \mathit{m}\mathit{e}\mathit{m}\mathit{o}\mathit{r}\mathit{y} \mathit{c}\mathit{o}\mathit{n}\mathit{s}\mathit{i}\mathit{d}\mathit{e}\mathit{r}\mathit{a}\mathit{t}\mathit{i}\mathit{o}\mathit{n}$

4.             if $\mathit{r}\mathit{a}\mathit{n}\mathit{d}\mathbf{<}\mathit{P}\mathit{A}\mathit{R}$

5.               ${\mathit{x}}_{\mathit{n}\mathit{e}\mathit{w}\mathbf{,} \mathit{j}}\mathbf{=}{\mathit{x}}_{\mathit{n}\mathit{e}\mathit{w}\mathbf{,} \mathit{j}}\mathbf{+}\mathit{b}\mathit{w} \mathbf{/}\mathbf{/} \mathit{p}\mathit{i}\mathit{t}\mathit{c}\mathit{h} \mathit{a}\mathit{d}\mathit{j}\mathit{u}\mathit{s}\mathit{t}\mathit{m}\mathit{e}\mathit{n}\mathit{t}$

6.             end if

7.         else

8.                ${\mathit{x}}_{\mathit{n}\mathit{e}\mathit{w}\mathbf{,} \mathit{j}}\mathbf{=}\mathit{L}{\mathit{B}}_{\mathit{j}}\mathbf{+}\mathit{r}\mathit{a}\mathit{n}\mathit{d}\mathbf{·}\mathbf{\left(}\mathit{U}{\mathit{B}}_{\mathit{j}}\mathbf{-}\mathit{L}{\mathit{B}}_{\mathit{j}}\mathbf{\right)} \mathbf{/}\mathbf{/} \mathit{r}\mathit{a}\mathit{n}\mathit{d}\mathit{o}\mathit{m}\mathit{i}\mathit{z}\mathit{a}\mathit{t}\mathit{i}\mathit{o}\mathit{n}$

9.       end if

10.end for

Step 3: Update the harmony memory. The HM will be updated if the fitness value of the newly generated harmony vector is better than that of the worst one in the HM.

Step 4: Repeat Steps 2–3 until Max_FEs is reached.

3.2. The Proposed SAMLHS Algorithm

The basic HSA only uses two simple parameters to control the generation of new individuals throughout the whole evolutionary process. It lacks control over the evolutionary process and cannot guide the evolution of individuals according to the different search needs at different evolutionary stages. Therefore, search efficiency and convergence speed cannot be ensured. In addition, in the basic HSA, the individuals only learn from the HM, while the search experience of the global optimal solution and other individuals is not extracted and learned sufficiently. It is, therefore, easy to fall into the local optimum, and the solution quality cannot be ensured. Further, the DEED problem to be solved is a high-dimensional, nonlinear, strongly coupled, and constrained multi-objective problem, which may be a great challenge to the basic HSA. Therefore, this paper proposes a novel self-adaptive multiple-learning harmony-search algorithm to solve the complex ${\mathrm{DEED}}_{\mathrm{IWEv}}$.

3.2.1. Self-Adaptive Parameter Adjustment

As shown in Algorithm 1, in the basic HSA, the two updating methods (shown in Lines 3 and 8, respectively) are selected with a fixed probability HMCR in the iteration process. Once the population has been trapped into a local optimum, it is hard for the algorithm to jump out of the local region when the HMCR is large. Conversely, when the HMCR is small, it is hard for the population to converge. Even though the HMCR is set to a median, its search efficiency and convergence speed may be not satisfactory. Thus, it can be concluded that the basic HSA is sensitive to the value of HMCR and thus the parameters should be elaborately controlled to ensure the performance of the algorithm.

A self-adaptive parameter adjustment mechanism is, therefore, proposed to adaptively control the two parameters HMCR and PAR according to the current number of function evaluations (FEs), which can be expressed as follows:

$$HMCR=HMC{R}_{min}+\left(HMC{R}_{max}-HMC{R}_{min}\right)\times e^{\left(-2\times \frac{FEs}{Max\_FEs}\right)}$$

(28)

$$PAR=PA{R}_{min}+\left(PA{R}_{max}-PA{R}_{min}\right)\times e^{\left(-2\times \frac{MaxFEs-FEs}{Max\_FEs}\right)}$$

(29)

where $HMC{R}_{min}$ and $HMC{R}_{max}$ are, respectively, the minimum and maximum of HMCR and $PA{R}_{min}$ and $PA{R}_{max}$ are, respectively, the minimum and maximum of PAR. It can be seen that the value of HMCR reduces gradually with the increase in the number of FEs. On the contrary, the value of PAR increases as the consumed FEs increase. As a result, at different evolutionary stages, different learning methods can be preferentially selected, and thus different search abilities can be preferentially assigned to the population.

3.2.2. Multiple Learning

In this work, a multiple-learning strategy is introduced into the basic HSA to enhance learning ability and improve search efficiency. More specifically, an elite-learning operator is introduced to implement the memory consideration operation, expressed as:

$$X_{new,i}=X_i+rand\times \left(X_{best}-X_i\right)+rand\times \left(X_{r1}-X_{r2}\right)$$

(30)

where $X_i$ is the $i$th solution of the current population. $X_{r1}$ and $X_{r2}$ are two solutions randomly selected from the population, where $r1\ne r2\ne i$. $X_{best}$ is randomly selected from the current nondominated solution. Moreover, an experience-learning operator is utilized to execute the randomization operation, which can be shown as:

$$X_{new,i}=X_{r1}+rand\times \left(X_{r2}-X_{r3}\right)$$

(31)

where $X_{r1}$,$X_{r2}$, and $X_{r3}$ are three individuals randomly selected from the population, where $r1\ne r2\ne r3\ne i$.

With the self-adaptive control to HMCR shown in Equation (28), the two learning operators can be selected adaptively at different evolutionary stages. Specifically, the evolutionary process of the SAMLHS can be divided into three stages, namely, the early stage, middle stage, and later stage. In the early stage, HMCR has a large value, and the elite-learning operator has a high probability of being chosen. Thus, as shown in Equation (30), the elite solution is used to guide the population to move to the optimal region rapidly, and the convergence ability can be enhanced. Meanwhile, a differential vector is also added to increase the exploration ability and avoid premature convergence. In the later stage, the HMCR is small, and the experience-learning operator is more likely to be selected. At this time, the population may have converged. The experience of other solutions is introduced, as shown in Equation (31), to maintain the diversity and enhance the local exploitation ability. In the middle stage, the two learning operators are selected with almost the same probability.

In addition, to prevent premature convergence and to further improve the quality of the solutions, a disturbance based on Levy flight is introduced to conduct the pitch adjustment in the HSA, which can be defined as follows:

$$X_{new,i}=X_{new,i}+Levy\left(\psi \right)$$

(32)

The $Levy\left(\psi \right)$ can be calculated as follows:

$$Levy\left(\psi \right)=\frac{L}{100}·\frac{u}{{\left|v\right|}^{\frac{1}{\omega }}}·\psi$$

(33)

where $L$ is the typical length scale ($L=1$); $\omega$ is a constant between 1 and 2; $u$, $v$ and $\psi$ are drawn from normal distributions, respectively;

$$u~N\left(0,{\sigma }_v^2\right), v~N\left(0,{\sigma }_v^2\right), \psi ~N\left(0,1\right)$$

(34)

where

$${\sigma }_u={\left[\frac{\mathsf{\Gamma }\left(1+\beta \right)·\sin \left(\frac{\pi \beta }{2}\right)}{\mathsf{\Gamma }\left(\frac{1+\beta }{2}\right)·\beta ·2^{\frac{\beta -1}{2}}}\right]}^{\frac{1}{\beta }} , {\sigma }_v=1,$$

(35)

where $\mathsf{\Gamma }$ is the gamma function.

Controlled by the adaptive PAR, the disturbance operator mainly works in the later evolutionary stage. The employed Levy flight can occasionally generate a large step size, which is beneficial for global exploration and can help the individual escape from the local region. In addition, due to its randomicity, it is helpful for further improving the solution quality.

3.3. Implementation of SAMLHS in Solving the $DEE{D}_{IWEv}$

The implementation of the proposed SAMLHS for solving the ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model is shown in Algorithm 2. The decision variables include the output power of thermal generator units and the V2G power. It should be noted that the fast nondominated sorting and crowding distance proposed in [38] are used to conduct the environmental selection (shown in Lines 19 and 20). Moreover, a dynamic heuristic constraint-handling method based on penalty function is employed in our method. Moreover, the best compromise solution is extracted based on a fuzzy-based decision-making method. Details of the constraints-handling and decision-making methods used can be found in our previous work [32].

Algorithm 2. The implementation of SAMLHS in solving the $DEE{D}_{IWEv}$.

1       Initialize population size ( $\mathit{N}\mathit{P}$ ), maximum number of function evaluations ( $\mathit{M}\mathit{a}\mathit{x}\mathbf{\_}\mathit{F}\mathit{E}\mathit{s}$ ), and other parameters. Set $\mathit{F}\mathit{E}\mathit{s}\mathbf{=}\mathbf{0}$;

2         Generate the initial population randomly;

3         Evaluate the fitness value of each individual by (10) and (14), and then set $\mathit{F}\mathit{E}\mathit{s}\mathbf{=}\mathit{F}\mathit{E}\mathit{s}\mathbf{+}\mathit{N}\mathit{P}$;

4          Sort POP based on fast nondominated sorting and crowding distance sorting;

5         while ( $\mathit{F}\mathit{E}\mathit{s}\mathbf{\le }\mathit{M}\mathit{a}\mathit{x}\mathbf{\_}\mathit{F}\mathit{E}\mathit{s}$) do

6                                                                            Update HMCR and PAR according to (28) and (29);

7                             for $\mathit{i}\mathbf{=}\mathbf{1} \mathbf{t}\mathbf{o} \mathit{N}\mathit{P}$

8                                                         if $\mathit{r}\mathit{a}\mathit{n}\mathit{d}\mathbf{<}\mathit{H}\mathit{M}\mathit{C}\mathit{R}$

9                                                                       Update ${\mathit{X}}_{\mathit{n}\mathit{e}\mathit{w}\mathbf{,}\mathit{i}}$ by (30);

10                                                             if $\mathit{r}\mathit{a}\mathit{n}\mathit{d}\mathbf{<}\mathit{P}\mathit{A}\mathit{R}$

11                                                   ${\mathit{X}}_{\mathit{n}\mathit{e}\mathit{w}\mathbf{,}\mathit{i}}\mathbf{=}{\mathit{X}}_{\mathit{n}\mathit{e}\mathit{w}\mathbf{,}\mathit{i}}\mathbf{+}\mathit{L}\mathit{e}\mathit{v}\mathit{y}\mathbf{\left(}\mathbf{\psi }\mathbf{\right)}$;

12                                                   end if

13                                            else

14                                                          Update ${\mathit{X}}_{\mathit{n}\mathit{e}\mathit{w}\mathbf{,}\mathit{i}}$ by (31);

15                                           end if

16                                     Evaluate ${\mathit{X}}_{\mathit{n}\mathit{e}\mathit{w}\mathbf{,}\mathit{i}}$ and Store ${\mathit{X}}_{\mathit{n}\mathit{e}\mathit{w}\mathbf{,}\mathit{i}}$ into POP;

17                                     $\mathit{F}\mathit{E}\mathit{s}\mathbf{=}\mathit{F}\mathit{E}\mathit{s}\mathbf{+}\mathbf{1}$;

18                                end for

19          Sort POP based on fast nondominated sorting and crowding distance sorting;

20         Reserve Only the best NP individuals into POP;

21         end while;

22         Return POP;

4. Numerical Experiments

4.1. Problem Description and Parameter Settings

In this section, we describe the testing of all the algorithms on five typical multi-objective benchmark problems, which are ZDT1-ZDT4 and ZDT6 with double objectives proposed by Zitzler et al. in [39]. The performance of the algorithms was evaluated by the inverted generational distance (IGD). The selected test problems and the definition of IGD are detailed in [40]. The parameter settings of all the employed algorithms are given in

Table 3. Algorithm parameters.

Algorithm	Description
SAMLHS [41]	$HMC{R}_{max}$ and $HMC{R}_{min}$ were set to 0.95 and 0.06, $PA{R}_{max}$ and $PA{R}_{min}$ were set to 0.95 and 0.35.
SaMODE_LS [32]	Ls was set to 0.1, $F_{min}$ and $F_{max}$ were set to 0.3 and 0.9,$C{R}_{min}$ and $C{R}_{max}$ were set to 0.1 and 0.9, and the DE/rand/1 operation was employed.
MODE [42,43]	$F$ and $CR$ were set to 0.5 and 0.5, and the DE/rand/1 operation was employed.
MOEA/D [44]	$F$ and $CR$ were set to 0.6 and 0.9, respectively. Both the distribution indexes and neighborhood size were set to 20. The mutation rate was set to 1/d.
MOPSO [45]	the personal and global learning coefficients were set to 2.05. The inertia weight coefficient was set to 0.729.
NSGA-II [46]	the crossover and mutation probabilities were set to 0.9 and 0.2. The distribution indices for crossover and mutation operators were ${\eta }_c$ $=$ 20 and ${\eta }_m$ $=$ 20, respectively.
SPEA2 [47]	the crossover and mutation probabilities were set to 0.7 and 0.3, respectively, and the archive size was set to 100.

. The population size NP was 100 and the maximum function evaluation was 30,000 for all the test problems. All the algorithms were independently run 30 times for each problem. The Wilcoxon test at a significance level of 5% was used to find the statistically significant difference between different algorithms.

4.2. Performance Comparison

The mean and standard deviation values of IGD over 30 runs are presented in

Table 4. Comparison of the IGD measure between SAMLHS and other MOEAs, mean (Std).

Problems	SAMLHS	SaMODE_LS	MOEA/D	MODE	NSGA-II	SPEA2	MOPSO
ZDT1	$4.799\times {10}^{-3}$ $(5.54\times {10}^{-8}$)	$6.108\times {10}^{-3}$ $(9.59\times {10}^{-8}$)+	$5.265\times {10}^{-3}$ $(1.86\times {10}^{-7}$)+	$1.442\times {10}^{-2}$ $(3.79\times {10}^{-6}$)+	$4.732\times {10}^{-3}$ $(1.53\times {10}^{-4}$)=	$\mathbf{3.962}\mathbf{\times }{\mathbf{10}}^{\mathbf{-}\mathbf{3}}$ $\mathbf{(}\mathbf{5.83}\mathbf{\times }{\mathbf{10}}^{\mathbf{-}\mathbf{5}}$)−	$1.819\times {10}^{-2}$ $(3.572\times {10}^{-5}$)+
ZDT2	$4.713\times {10}^{-3}$ $(5.24\times {10}^{-8}$)	$5.734\times {10}^{-3}$ $(4.84\times {10}^{-8}$)+	$4.409\times {10}^{-3}$ $(3.90\times {10}^{-8}$)−	$2.021\times {10}^{-2}$ $(1.16\times {10}^{-5}$)+	$4.894\times {10}^{-3}$ $(1.72\times {10}^{-4}$)+	$\mathbf{3.942}\mathbf{\times }{\mathbf{10}}^{\mathbf{-}\mathbf{3}}$ $\mathbf{(}\mathbf{5.44}\mathbf{\times }{\mathbf{10}}^{\mathbf{-}\mathbf{5}}$)−	$6.968\times {10}^{-1}$ $(9.07\times {10}^{-3}$)+
ZDT3	$\mathbf{5.109}\mathbf{\times }{\mathbf{10}}^{\mathbf{-}\mathbf{3}}$ $\mathbf{(}\mathbf{5.24}\mathbf{\times }{\mathbf{10}}^{\mathbf{-}\mathbf{8}}$)	$5.818\times {10}^{-3}$ $(5.44\times {10}^{-8}$)+	$1.022\times {10}^{-2}$ $(1.10\times {10}^{-8}$)+	$2.136\times {10}^{-2}$ $(1.42\times {10}^{-5}$)+	$6.415\times {10}^{-3}$ $(5.33\times {10}^{-3}$)+	$6.164\times {10}^{-3}$ $(5.52\times {10}^{-3}$)+	$5.498\times {10}^{-2}$ $(5.36\times {10}^{-4}$)+
ZDT4	$4.661\times {10}^{-3}$ $(7.84\times {10}^{-8}$)	$4.743\times {10}^{-3}$ $(7.20\times {10}^{-8}$)=	$\mathbf{3.865}\mathbf{\times }{\mathbf{10}}^{\mathbf{-}\mathbf{3}}$ $\mathbf{(}\mathbf{1.86}\mathbf{\times }{\mathbf{10}}^{\mathbf{-}\mathbf{10}}$)−	$4.513\times {10}^{-3}$ $(5.173\times {10}^{-8}$)−	$5.938\times {10}^{-3}$ $(1.27\times {10}^{-3}$)+	$5.194\times {10}^{-3}$ $(1.50\times {10}^{-3}$)=	$2.998\times {10}^{-1}$ $(1.62\times {10}^{-1}$)+
ZDT6	$3.259\times {10}^{-3}$ $(1.71\times {10}^{-7}$)	$3.300\times {10}^{-3}$ $(2.81\times {10}^{-7}$)=	$\mathbf{2.059}\mathbf{\times }{\mathbf{10}}^{\mathbf{-}\mathbf{3}}$ $\mathbf{(}\mathbf{8.37}\mathbf{\times }{\mathbf{10}}^{\mathbf{-}\mathbf{11}}$)−	$3.398\times {10}^{-3}$ $(3.42\times {10}^{-7}$)=	$3.736\times {10}^{-3}$ $(1.35\times {10}^{-4}$)+	$3.145\times {10}^{-3}$ $(4.84\times {10}^{-5}$)=	$3.392\times {10}^{-3}$ $(2.38\times {10}^{-7}$)=
Sum-up	+\=\−	3\2\0	2\0\3	3\1\1	4\1\0	1\2\2	4\1\0

, where “+”, “−” and “=” indicate that SAMLHS performed significantly better or worse than or equivalently to the corresponding algorithm, respectively. The sum up results given in the last line show that the proposed SAMLHS performs better than most of the compared algorithms. More specifically, SAMLHS performs significantly better than SaMODE_LS on ZDT1, ZDT2, and ZDT3 problems, and equivalently on ZDT4 and ZDT6 problems, which indicates that SAMLHS has a better performance than SaMODE_LS on the problems employed. Moreover, SAMLHS outperforms MODE, NSGA-II, and MOPSO on most of the problems. Compared with MOEA/D, SAMLHS performs better on two problems and worse on the other three problems. This may be because the MOEA/D is a decomposition-based algorithm and has a natural advantage in optimizing MOPs. Compared with SPEA2, SAMLHS shows a better performance on ZDT3 and an equivalent performance on both ZDT4 and ZDT6. For the remaining two problems, SPEA2 shows better performance.

5. Experimental Results of Solving the $DEE{D}_{IWEv}$ Model

In this paper, a 10-unit system is involved in the $DEE{D}_{IWEv}$ model. The load demand and parameters of the used 10-unit system were obtained from the references [23,46]. All experiments were conducted in MATLAB R2021a on a PC with Core I7-10700 CPU, and 32G RAM. The type of the EV used in the model was the Toyota RAV4. The parameters $\mu$ and $\sigma$ of wind speed are from [32]. Other parameter settings of the system and EV are shown in

Table 5. System and EV parameter settings.

Parameters	Value	Parameters	Value
NP	100	Battery capacity	21.6 kWh
iteration	5000	$∆E$	0.139 kWh/km
FEs	500,000	$L$	43 km
$D_{j.t}$	50	Travel time	$07:00–08:00 \mathrm{and} 17:00–18:00, \mathrm{other} \mathrm{time} \mathrm{participate} \mathrm{in} \mathrm{the} IWEv$ system
$C_{cwj.t}$$, C_{rwj.t}$	75
${\eta }_1$$, {\eta }_2$	0.95	Initial SOC	100%
T	24 h	Minimum SOC	20% of the battery capacity
${\partial }_C$$, {\partial }_D$	0.85	$P_{Rch}$$, P_{RDch}$	20% of the battery capacity
${\vartheta }_u$$, {\vartheta }_d$	0.3	$K$	10
$r$	100	$\epsilon$	${10}^{-6}$

.

5.1. Verifying the Effectiveness of the Proposed SAMLHS Algorithm

In this subsection, 50,000 EVs and 100 wind turbines were selected in the ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model. To verify the performance of the proposed SAMLHS algorithm, it was compared to the six state-of-the-art algorithms. All algorithms used the same constraint-handling method, introduced in Section 3.3. Each algorithm was run 30 times independently.

The obtained Pareto Frontiers (PFs) of all the algorithms are shown in Figure 1. Note that PF refers to a set of Pareto optimal solutions obtained by one algorithm in the objective space. The proposed SAMLHS yields a PF with good distribution and convergence. It locates at the bottom of all the PFs and has the widest spread, indicating its superiority compared with other algorithms. Moreover, the basic HSA gets an unsatisfactory PF that may have fallen into the local region. It also demonstrates the effectiveness of our proposed self-adaptive multiple-learning strategies.

The extreme solutions, including the best cost and best emission solutions, and the compromise solutions, obtained by all the algorithms are shown in

Table 6. The solutions for different algorithms ($F_C\left(\times {10}^6\$\right)$ ) and ($F_M\left(\times {10}^5\mathrm{lb}\right)$ ).

Algorithms	SAMLHS		SaMODE_LS		MODE		MOEA/D
	$F_C$	$F_M$	$F_C$	$F_M$	$F_C$	$F_M$	$F_C$	$F_M$
Best cost	2.4294	2.8232	2.4495	2.7481	2.4400	2.8092	2.5492	2.7102
Best emission	2.5523	2.5076	2.5452	2.5298	2.5483	2.5397	2.6347	2.5535
Best compromise	2.4632	2.6122	2.4872	2.5939	2.4706	2.6299	2.5787	2.6048
Algorithms	NSGA-II		SPEA2			MOPSO
	$F_C$	$F_M$	$F_C$		$F_M$	$F_C$		$F_M$
Best cost	2.5272	2.6050	2.5528		2.6350	2.5461		2.7863
Best emission	2.5354	2.5686	2.5661		2.5955	2.5988		2.7486
Best compromise	2.5319	2.5743	2.5577		2.6155	2.5747		2.7793

. We can see that both the best cost and the best emission are obtained by the proposed SAMLHS algorithm as $2.4294\times {10}^6\$$ and 2.5076$\times {10}^5\mathrm{lb}$, respectively. This means that the proposed algorithm can provide the best choice for the decision-maker in terms of both cost and emission. As for the best compromise solution, the best cost and best emission are obtained by SAMLHS and SaMODE_LS, respectively; compared with the SAMLHS algorithm, SaMODE_LS increases by 0.974% in terms of F_c, although $F_M$ decreases by 0.701%. On balance, our proposed SAMLHS algorithm shows better performance in reducing the total cost and emissions of the system.

The convergence process of cost and emissions for the seven algorithms are plotted in Figure 2 and Figure 3, respectively. It can be seen that in terms of cost, the proposed SAMLHS shows a significant advantage in the convergence performance compared with other algorithms. In terms of emissions, the SaMODE_LS shows a faster convergence speed than the SAMLHS; however, the solution for the final convergence of the SAMLHS is better than that of SaMODE_LS. By comprehensive comparison, the proposed SAMLHS algorithm shows a better convergence performance than the other algorithms. The reason for this may be that the elite-learning strategy speeds up the convergence of the SAMLHS.

Detailed information for the compromise solution obtained by the SAMLHS is shown in

Table 7. The best compromise solution obtained by SAMLHS.

$\mathit{t}$	${\mathit{P}}_1$	${\mathit{P}}_2$	${\mathit{P}}_3$	${\mathit{P}}_4$	${\mathit{P}}_5$	${\mathit{P}}_6$	${\mathit{P}}_7$	${\mathit{P}}_8$	${\mathit{P}}_9$	${\mathit{P}}_{10}$	$\mathit{V}2\mathit{G}$	${\mathit{P}}_{\mathit{w}\mathit{d}}$	${\mathit{P}}_{\mathit{L}}$	${\mathit{P}}_{\mathit{D}}$
1	152.00	137.07	113.99	136.89	174.91	143.30	99.93	103.56	58.60	33.16	−162.90	94.28	48.80	1036
2	155.49	138.16	121.96	117.50	208.19	158.73	120.25	119.02	78.45	47.56	−199.60	95.92	51.64	1110
3	156.99	140.79	143.91	143.51	212.62	150.45	126.50	118.16	79.10	51.55	−105.58	101.24	61.24	1258
4	173.87	170.04	179.96	191.12	225.68	159.53	129.05	118.80	79.35	53.86	−109.59	101.09	66.75	1406
5	175.63	198.57	208.89	191.49	236.87	158.49	129.16	118.69	79.30	53.80	−101.25	98.59	68.23	1480
6	169.01	198.66	250.58	202.35	243.00	159.95	130.00	120.00	79.99	54.92	−7.85	94.89	67.50	1628
7	176.62	201.13	255.06	261.45	242.82	159.68	130.00	119.78	79.81	54.85	0.00	89.67	68.87	1702
8	189.59	250.27	250.70	243.97	242.70	159.65	129.87	119.54	79.29	54.74	37.80	78.66	60.78	1776
9	240.10	285.23	270.18	281.41	242.60	159.56	129.53	119.57	79.70	54.69	51.04	71.55	61.16	1924
10	253.66	291.01	313.35	298.32	242.93	159.78	129.59	119.79	79.76	54.86	72.83	56.01	49.89	2022
11	263.62	299.20	311.10	300.00	243.00	160.00	130.00	120.00	80.00	55.00	138.03	41.39	35.34	2106
12	250.77	289.02	329.82	299.23	242.82	159.64	129.48	119.73	79.53	54.50	162.74	59.47	49.75	2127
13	259.70	296.08	330.73	299.60	242.57	159.68	129.68	119.68	79.62	54.68	92.24	68.27	60.53	2072
14	236.42	270.45	274.26	291.28	242.73	159.67	129.71	119.70	79.63	54.68	48.75	77.95	61.23	1924
15	256.29	278.79	259.94	278.40	242.81	159.78	129.23	119.52	79.92	54.78	−100.88	76.37	58.95	1776
16	183.88	221.07	246.82	258.48	242.59	159.77	129.55	119.44	79.82	54.76	−171.44	73.06	43.80	1554
17	156.59	158.51	172.34	212.10	202.48	154.91	127.73	116.73	77.73	54.93	0.00	80.86	34.91	1480
18	175.44	237.40	244.04	250.07	242.48	159.71	129.67	119.52	79.57	54.47	−90.04	56.65	30.98	1628
19	240.62	288.58	258.79	276.21	242.80	159.96	129.58	119.96	79.65	54.55	−86.01	34.40	23.09	1776
20	216.42	283.88	281.15	299.31	242.52	159.81	129.40	119.96	79.53	54.44	97.05	36.29	27.76	1972
21	231.34	257.17	280.87	277.88	242.33	159.47	129.61	119.73	79.57	54.65	80.90	40.73	30.25	1924
22	167.04	196.41	217.49	231.88	236.83	159.53	129.80	119.69	79.98	54.75	13.78	58.69	37.88	1628
23	155.70	145.74	166.33	198.91	227.53	158.15	128.45	118.20	78.26	49.74	−126.37	73.04	41.68	1332
24	161.55	151.87	132.79	171.62	201.94	145.86	126.27	114.71	77.50	53.91	−190.65	81.34	44.70	1184

. It can be seen that the charging of EVs is mainly concentrated from 23:00 to 6:00, which are the low load intervals of the day. During the load peak periods, from 08:00 to 14:00 and from 20:00 to 22:00, EVs discharge. This indicates that the dynamic management for EV charging and discharging is realized in the $DEE{D}_{IWEv}$ model. The power balance constraints can be checked for each interval in Figure 4.

5.2. Verifying the Proposed $DEE{D}_{IWEv}$ Model

To further validate the proposed ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model, the following three scenarios were proposed to make a comparison. In Scenario 1, our proposed ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model was employed, where EVs interact with wind power and both participate in the whole system. Scenario 2 was that EVs and wind power are involved in the entire system independently—the charging and discharging behavior of EVs no longer interact with wind power. The charging of EVs is provided by thermal power generators. Scenario 3 was that only wind power is involved in the whole system and EVs are no longer involved.

Table 8. The extreme solutions of different scenarios.

Scenarios	Extreme Solutions
		${\mathit{F}}_{\mathit{C}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{M}} \left(\mathit{l}\mathit{b}\right)$
1	Best cost	$\mathbf{2.4294}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.8232\times {10}^5$
	Best emission	$2.5523\times {10}^6$	$\mathbf{2.5076}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
2	Best cost	$\mathbf{2.5699}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.7535\times {10}^5$
	Best emission	$2.6762\times {10}^6$	$\mathbf{2.5263}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
3	Best cost	$\mathbf{2.5853}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.7668\times {10}^5$
	Best emission	$2.6731\times {10}^6$	$\mathbf{2.5618}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$

shows the extreme solutions obtained for the three scenarios, including best cost and best emission. First, comparing Scenario 2 and Scenario 3, we find that both the best cost and best emission of Scenario 2 are lower than those in Scenario 3. This shows that a certain number of EVs involved in the system can reduce the total costs and emissions. Next, comparing Scenario 1 and Scenario 2, we find that the $F_C$ and $F_M$ of Scenario 1 are reduced by 5.467% and 0.740%, respectively, compared with those of Scenario 2; this indicates that the interaction between EVs and wind power can reduce the cost and emission of the system.

Table 9. The best compromise solutions for different scenarios.

Scenarios	Best Compromise Solutions
	${\mathit{F}}_{\mathit{C}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{M}} \left(\mathit{l}\mathit{b}\right)$	${\mathit{F}}_{\mathit{W}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{i}\mathit{n}\mathit{t}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{P}} \left(\mathit{\$}\right)$
1	$\mathbf{2.4632}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.6122\times {10}^5$	87,019	100,718.432	$\mathbf{2.2755}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$
2	$2.6028\times {10}^6$	$\mathbf{2.6005}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$	87,019	168,338.7	$2.3474\times {10}^6$
3	$2.6172\times {10}^6$	$2.6355\times {10}^5$	87,019	168,338.7	$2.3618\times {10}^6$

shows the best compromise solutions obtained for the three scenarios. Comparing Scenario 2 and Scenario 3, the same conclusion can be drawn as in Table 7. Compared with Scenario 1, Scenario 2 shows a decrease of 0.448% in $F_M$ but an increase of 5.667% and 3.160% in $F_C$ and $F_P$, respectively. Figure 5 shows the cost of interaction between EVs and wind power at different periods. As analyzed in Section 2.3, although EVs and wind power do not interact in Scenario 2 and Scenario 3, the curtailment and reserve costs for wind power are considered the same as the interaction cost. It can be seen that the interaction cost for Scenario 1 is always the smallest at different dispatch intervals.

5.3. Different Confidence Levels

In this subsection, the impact of different confidence levels on the ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model is investigated. Note that the values of $\eta { }_1$ and $\eta { }_2$ are the same.

Table 10. The extreme solutions obtained at different confidence levels.

$\mathit{\eta }{ }_1$$, \mathit{\eta }{ }_2$	Extreme Solutions
		${\mathit{F}}_{\mathit{C} }\left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{M}} \left(\mathit{l}\mathit{b}\right)$
0.8	Best cost	$\mathbf{2.4328}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.7925\times {10}^5$
	Best emission	$2.5342\times {10}^6$	$\mathbf{2.5190}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
0.85	Best cost	$\mathbf{2.4351}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.7953\times {10}^5$
	Best emission	$2.5388\times {10}^6$	$\mathbf{2.5306}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
0.9	Best cost	$\mathbf{2.4300}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.7832\times {10}^5$
	Best emission	$2.5332\times {10}^6$	$\mathbf{2.5123}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
0.95	Best cost	$\mathbf{2.4294}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.8232\times {10}^5$
	Best emission	$2.5523\times {10}^6$	$\mathbf{2.5076}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$

shows the extreme solutions obtained at different confidence levels. We found that the results deteriorate when the confidence level increases from 0.8 to 0.85, and improve when the level increases from 0.85 to 0.95. The worst results are obtained at a confidence level of 0.85, and the best results are at a confidence level of 0.95.

Table 11. The best compromise solutions obtained at different confidence levels.

$\mathit{\eta }{ }_1$$, \mathit{\eta }{ }_2$	Best Compromise Solutions
	${\mathit{F}}_{\mathit{C} }\left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{M}} \left(\mathbf{lb}\right)$	${\mathit{F}}_{\mathit{W}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{i}\mathit{n}\mathit{t}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{P}} \left(\mathit{\$}\right)$
0.8	$2.4722\times {10}^6$	$2.5909\times {10}^5$	87019	103,983.54	$2.2812\times {10}^6$
0.85	$2.4634\times {10}^6$	$2.6219\times {10}^5$	87019	100,438.48	$2.2759\times {10}^6$
0.9	$\mathbf{2.4620}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$\mathbf{2.6105}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$	87019	98,723.295	$2.2763\times {10}^6$
0.95	$2.4632\times {10}^6$	$2.6122\times {10}^5$	87019	100,718.43	$\mathbf{2.2755}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$

shows the best compromise solutions obtained at different confidence levels. The best cost and emission values, 2.4620$\times {10}^6 \$$ and 2.6105$\times {10}^5$ $\mathrm{lb}$, were obtained at a confidence level of 0.9, but the minimum fuel cost was taken at a confidence level of 0.95. This suggests that the system may consume less fossil fuel when the confidence level increases. By comprehensive comparison, the best choice of confidence level is 0.95. Figure 6 shows the cost of the interaction between EVs and wind power at different confidence levels. It can be seen that the interaction costs obtained at different confidence levels show little difference.

5.4. Different Scales of EVs and Wind Power

In this subsection, the impact of different scales of EVs and wind power on the ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model is investigated.

Different scales of EVs:

Table 12. The extreme solutions obtained with different scales of EVs.

EVs	Extreme Solutions
		${\mathit{F}}_{\mathit{C}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{M}} \left(\mathit{l}\mathit{b}\right)$
20,000	Best cost	$\mathbf{2.5563}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.6746\times {10}^5$
	Best emission	$2.6169\times {10}^6$	$\mathbf{2.5614}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
30,000	Best cost	$\mathbf{2.5212}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.7496\times {10}^5$
	Best emission	$2.6185\times {10}^6$	$\mathbf{2.5459}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
40,000	Best cost	$\mathbf{2.5132}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.7668\times {10}^5$
	Best emission	$2.6149\times {10}^6$	$\mathbf{2.5390}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
50,000	Best cost	$\mathbf{2.4294}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.8232\times {10}^5$
	Best emission	$2.5523\times {10}^6$	$\mathbf{2.5076}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
60,000	Best cost	$\mathbf{2.5049}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.8540\times {10}^5$
	Best emission	$2.6412\times {10}^6$	$\mathbf{2.5040}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
70,000	Best cost	$\mathbf{2.5252}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.6943\times {10}^5$
	Best emission	$2.6284\times {10}^6$	$\mathbf{2.5061}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
80,000	Best cost	$\mathbf{2.5260}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.6923\times {10}^5$
	Best emission	$2.6375\times {10}^6$	$\mathbf{2.5125}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$

shows the extreme solutions obtained with different scales of EVs. In the process of increasing the number of EVs, the best cost tends to increase and then decrease, taking the best value of $2.4294\times {10}^6\$$ at 50,000 vehicles; the best emission shows the same trend, taking the best value of 2.5040$\times {10}^5\mathrm{lb}$ at 60,000 vehicles.

Table 13. The best compromise solutions obtained with different scales of EVs.

EVs	Best Compromise Solutions
	${\mathit{F}}_{\mathit{C}}\left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{M}}\left(\mathit{l}\mathit{b}\right)$	${\mathit{F}}_{\mathit{W}}\left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{i}\mathit{n}\mathit{t}}\left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{P}}\left(\mathit{\$}\right)$
20,000	$2.5817\times {10}^6$	$2.6001\times {10}^5$	87,019	111,574.49	$2.3831\times {10}^6$
30,000	$2.5685\times {10}^6$	$2.5927\times {10}^5$	87,019	106,148.157	$2.3753\times {10}^6$
40,000	$2.5416\times {10}^6$	$2.6314\times {10}^5$	87,019	97,532.175	$2.3570\times {10}^6$
50,000	$\mathbf{2.4632}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$\mathbf{2.6122}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$	87,019	100,718.432	$\mathbf{2.2755}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$
60,000	$2.5438\times {10}^6$	$2.6165\times {10}^5$	87,019	98,733.36	$2.3580\times {10}^6$
70,000	$2.5697\times {10}^6$	$2.5684\times {10}^5$	87,019	100,274.5	$2.3824\times {10}^6$
80,000	$2.5666\times {10}^6$	$2.5774\times {10}^5$	87,019	97,256.729	$2.3823\times {10}^6$

shows the best compromise solution obtained with different scales of EVs. At 50,000 EVs, the total cost and emission are taken to a minimum of $2.4632\times {10}^6 \$$ and $2.6122\times {10}^{5 }\mathrm{lb}$, which is a significant reduction compared with the other cases. In summary, the number of EVs involved in the system indeed affects the system performance. When the number of EVs is too small, it cannot bring much benefit to the system, and when the number of EVs is too large, it will be a burden on the system. Therefore, setting 50,000 electric vehicles is the best choice in our proposed ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model. Figure 7 shows the cost of the interaction between EVs and wind power with different numbers of EVs.

Different wind power:

Table 14. The extreme solutions obtained with different wind power.

${\mathit{P}}_{\mathit{r}\mathit{a}\mathit{t}\mathit{e}}\left(\mathit{M}\mathit{W}\right)$	Extreme Solutions
		${\mathit{F}}_{\mathit{C}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{M}} \left(\mathit{l}\mathit{b}\right)$
100	Best cost	$\mathbf{2.4802}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.9052\times {10}^5$
	Best emission	$2.5784\times {10}^6$	$\mathbf{2.6832}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
200	Best cost	$\mathbf{2.4294}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.8232\times {10}^5$
	Best emission	$2.5523\times {10}^6$	$\mathbf{2.5076}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
300	Best cost	$\mathbf{2.5516}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.6388\times {10}^5$
	Best emission	$2.6603\times {10}^6$	$\mathbf{2.3838}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
400	Best cost	$\mathbf{2.5999}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.5364\times {10}^5$
	Best emission	$2.7383\times {10}^6$	$\mathbf{2.2351}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
500	Best cost	$\mathbf{2.6630}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.4201\times {10}^5$
	Best emission	$2.7676\times {10}^6$	$\mathbf{2.1114}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
600	Best cost	$\mathbf{2.7260}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.3269\times {10}^5$
	Best emission	$2.8346\times {10}^6$	$\mathbf{1.9728}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
700	Best cost	$\mathbf{2.8011}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.1340\times {10}^5$
	Best emission	$2.9107\times {10}^6$	$\mathbf{1.8597}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$
800	Best cost	$\mathbf{2.8346}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$1.9728\times {10}^5$
	Best emission	$2.8346\times {10}^6$	$\mathbf{1.9728}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$

shows the extreme solutions obtained with different wind powers. The best cost $2.4294\times {10}^6 \$$ is obtained when the $P_{rate}$ is 200 MW. With the increase in wind power, the optimal emission is reduced. This indicates that as wind power increases, the power generated by conventional thermal units can be reduced, but the cost of wind power generation also increases, resulting in a consistent increase in the total cost.

Table 15. The best compromise solutions obtained with different wind powers.

${\mathit{P}}_{\mathit{r}\mathit{a}\mathit{t}\mathit{e}}$	Best Compromise Solutions
	${\mathit{F}}_{\mathit{C}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{M}} \left(\mathit{l}\mathit{b}\right)$	${\mathit{F}}_{\mathit{W}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{i}\mathit{n}\mathit{t}} \left(\mathit{\$}\right)$	${\mathit{F}}_{\mathit{P}} \left(\mathit{\$}\right)$
100	$2.5184\times {10}^6$	$2.7573\times {10}^5$	43,510	48,898.751	$2.4260\times {10}^6$
200	$\mathbf{2.4632}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$	$2.6122\times {10}^5$	87,019	100,718.432	$2.2755\times {10}^6$
300	$2.5870\times {10}^6$	$2.4761\times {10}^5$	130,530	158,878.096	$2.2976\times {10}^6$
400	$2.6429\times {10}^6$	$2.3333\times {10}^5$	174,040	222,744.63	$2.2461\times {10}^6$
500	$2.6950\times {10}^6$	$2.2264\times {10}^5$	217,550	296,158.08	$2.1813\times {10}^6$
600	$2.7581\times {10}^6$	$2.0960\times {10}^5$	261,060	378,812.1	$2.1182\times {10}^6$
700	$2.8414\times {10}^6$	$1.9513\times {10}^5$	304,570	456,864.1	$2.0800\times {10}^6$
800	$2.9259\times {10}^6$	$\mathbf{1.8129}\mathbf{\times }{\mathbf{10}}^{\mathbf{5}}$	348,080	547,279.6	$\mathbf{2.0575}\mathbf{\times }{\mathbf{10}}^{\mathbf{6}}$

shows the best compromise solutions obtained with different wind powers. The best cost is also reached when the P_rate is 200 MW, the same as in Table 13. The best emission and fuel costs are 1.8129$\times {10}^5\mathrm{lb}$ and 2.0575$\times {10}^6\$$, respectively, when the P_rate is 800 MW, while the cost of wind power generation reaches a maximum of 348,080. Therefore, when cost is the major consideration of the system, setting the wind power to 200 seems more suitable. Figure 8 shows the cost of the interaction between EVs and wind power. We can see that the interaction cost increases with the increase in wind power.

6. Conclusions

In this paper, a model based on the interaction between EVs and wind power ($\mathrm{IWEv}$) is proposed, and further, a multi-objective ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model is proposed based on the considerations of total cost and emission. Moreover, a novel multi-objective self-adaptive multiple-learning harmony-search algorithm is proposed to solve the ${\mathrm{DEED}}_{\mathrm{IWEv}}$ problem. In order to verify the effectiveness of the proposed algorithm and model, a 10-unit test system combining EVs and wind power is utilized. Results show that the proposed algorithm always shows a better performance compared with other advanced algorithms in terms of both total cost and emission. The proposed ${\mathrm{DEED}}_{\mathrm{IWEv}}$ model was validated by setting three different scenarios, and the results show that the proposed $\mathrm{IWEv}$ model performs better in terms of reducing cost and emission. In addition, the proposed model was tested under different confidence levels, numbers of EVs, and scales of wind power, and finally, the most suitable parameter configuration for the system is recommended. In our future work, other renewable energy sources will be considered for integration to the dispatching system.