1. Introduction
Cogeneration systems, which combine heat and power (CHP) systems, have previously been extensively applied in industry. They offer an economic strategy providing both heat and power, which can then be passed on to buyers. Cogeneration systems offer a significant advantage when it comes to consideration of environmental issues. They are used as a distributed energy source, which can simultaneously sell both thermal steam and electricity to other industries. They can also be constructed in urban areas and used as distributed energy resources in microgrids [
1,
2,
3]. In recent decades, consolidated cogeneration solutions have been used in industrial applications [
4], while cogeneration system applications continue to grow. However, more experience is required in order to achieve the most efficient and energy-saving operation of these systems. To improve the competiveness of cogeneration systems in a liberalized market, an efficient tool for achieving the optimal operation of these systems must be developed.
To date, several efficiency strategies have been developed to achieve this optimal operation [
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19]. Ref. [
5] presented a generalized network programming (GNP) to perform the economic dispatch of electricity and steam in a cogeneration plant. Ref. [
6] presented an dispatching scheme which economically transfers energy between facilities and utilities. An optimal operation of the cogeneration system is proposed, which will integrate energy into the electricity grid by using the decision-making technique [
7]. Ref. [
8] is used to assess the potential process of using micro-cogeneration systems based on Stirling engines. The results demonstrate that a numerical analysis of the Stirling engine can accurately indicate the operation of the actual machine. Ref. [
9] used a non-linear programming with Time-of-Use (TOU) rates considered during operation. Ref. [
10] presented the operation of steam turbines experiencing blades failures during peak load times of the summer months at a cogeneration plant. The author of [
11] applied some possible technologies to integrate pulp and paper production within the context of a high-efficiency cogeneration system. Grey wolf optimization [
12] and cuckoo search algorithms [
13] are proposed to simultaneously solve the economic logistics of using a combined heat and power system. Ref. [
14,
15] presented the suggested economical operation of a cogeneration system under control, with resultant multi-pollutants from a fossil-fuels-based thermal energy generation. The author of [
16] introduced an original framework based on identifying the characteristics of small-scale and large-scale uncertainties, whereby a comprehensive approach based on multiple time frames was formulated. Ref. [
17] developed a tool for long-term optimization of cogeneration systems based on mixed integer linear-programming and a Lagrangian relation. Ref. [
18] proposed an enhanced immune algorithm to solve the scheduling of cogeneration plants in a deregulated market. Ref. [
19] addressed an optimal strategy for the daily energy exchange of a 22-MW combined-cycle cogeneration plant in a liberty market.
One of the key issues of a cogeneration operation is heat and power modeling. In the papers described above, pure power dispatch was a major objective. Inevitably, though, more design objectives coupled with higher constraints will have to be incorporated. The energy trading dispatch of cogeneration systems is a complicated process, especially when the solution is being sought in a world of uncertainty. Conventional methods have thus become more difficult to solve. Recently, artificial intelligence (AI) has been applied in the economic dispatch of cogeneration systems [
20,
21,
22,
23]. The strategies proposed by AI algorithms must consider computer execution efficiency and a large computing space. Conventional algorithms may be faster, but are very often limited by the problem structure, and may diverge, or lead to a local minimum. This paper therefore proposes an Enhanced Ant Colony Optimization (EACO) to solve the energy trading dispatch of cogeneration systems.
Ant Colony Optimization (ACO) applies the activity characteristics of biotic populations to search optimization problems [
24,
25]. When ants are foraging, they not only refer to their own information but also learn from the most efficient ants in order to correct their route. They learn and exchange their information to search for the shortest route between their colony and food sources, and pass this information on until the whole ant colony reaches optimal status. The advantages of the ACO algorithm are that individual solutions within a range of possible solutions can converge to discover the optimal solution through a small number of evolution iterations. ACO has previously been applied to the economic dispatch of power systems [
26,
27,
28,
29,
30]; however, while ACO is good at global searches, the populations produced are still a dilemma. In this paper, an EACO algorithm is proposed to improve this search ability. In the EACO, the crossover and mutation mechanisms [
31] are used to generate offspring equipped to escape the local optimum. This paper proposes the use of EACO to solve the energy trading dispatch of the cogeneration systems by considering the TOU rate [
32]. The different carbon prices of CO
2 emissions are also simulated and analyzed in the energy trading dispatch of these cogeneration systems. It can show the performance of the energy trading dispatch of the cogeneration systems to obtain the maximal profit.
3. Solution Algorithm
This study proposes an EACO, which combines the ACO and Genetic Algorithm (GA), in order to achieve the optimal energy trading dispatch of a cogeneration system. Crossover and mutation mechanisms are integrated into the ACO procedure, and serve to generate offspring in order to escape from the local optimum. The EACO procedure applied in the energy trading dispatch of a cogeneration system is described as follows.
(1) Input Data
Input data includes high/medium steam demand, internal load, plant type, plant capacity, and number of plants.
(2) Set EACO Parameters
EACO parameters include the population of ants (k), the number of generations (G), initial pheromone (), the relative influence of the pheromone trail (), the relative influence of the heuristic information (), and the pheromone evaporation rate ().
(3) Initialized Individuals
is an individual,
i = 1, 2, …,
k.
k, which is the number of ants, is set to 30 in our study.
s is the number of parameters. All individuals are set between the minimal and maximal limits with a uniform distribution as shown in Equation (19). The fitness score of each
is obtained by calculating the objective function (
) by considering Equations (10)~(18). The fitness values were arranged in descending order from the maximum (
) to the minimum (
).
Rand: The uniform random number in (0,1).
(4) The State Transition Rule
The state-based ants are generated according to the level of pheromone and constrained conditions. The transition probability for the
from one state
s to the next
j is at the
interval, as given in Equation (20):
where
and
are the inverse of the edge distance at the
generation, which are defined as Equations (21) and (22):
is the objective function as given in Equation (3). and are the score of the and individuals at the interval, and is the optimal fitness score at the interval. is the number of feasible individuals at the interval.
and are the pheromone intensity on edge (s, j) and edge (s, l) at the generation. Ant k positioned on state s chooses to move to the next state by taking account of and ηt,sl. When the value of τt,sl increases, this indicates there has been a lot of traffic on this path and it is therefore more desirable in order to reach the optimal solution. When the value of increases, it indicates that the current state should have a higher probability. Each stage contains several states, while the order of states selected at each stage can be combined as an achievable path deemed to be a feasible solution to the problem.
(5) Ant Reproduction
New ants are generated by the scheme of crossover and mutation. Crossover is a structured recombination operation that exchanges two individual ants. Mutation is the occasional random alteration of an individual. The crossover and mutation scheme is described as follows:
- (i)
Randomly select two parents, and generate offspring by assigning a Control Variable ()
- (a)
If : Mutation is used;
- (b)
If : Crossover is used.
Rand: the uniform random in [0, 1]; : the control variable between 0.1 to 0.9. The initial value set to 0.5; g: the current iteration number.
- (ii)
If
comes from crossover used, the control variable
will be decreased as shown in Equation (23):
where
is the regulated parameter. When
RP is added in the crossover process, the higher probability for crossover operation will produce the next offspring.
- (iii)
If
comes from mutation, the control parameter
will be increased as shown in Equation (24):
Similarly, when RP is added in the mutation process, the higher probability for mutation operation will produce the next offspring.
- (iv)
If
, the control variable needs to hold back. If
, we have:
otherwise,
The crossover operator proceeds to exchange two individual ants by random.
and
, which are the
and
individual ants at the
interval, are exchanged by the crossover operator. The mutation operation is carried out to produce another individual ant. Each individual ant is mutated and created to a new individual ant by using (27).
represents a Gaussian random variable with mean 0 and variable
.
can be calculated by:
, which is a mutation factor at the j-th generation, is set within [0, 1].
(6) Update the Pheromone
While building a solution to the problem, the pheromone of a visited route can be dynamically adjusted by Equation (29). This process is called the “local pheromone-updating rule”:
ρ is the constant of pheromone intensity (0 ≤
ρ ≤ 1) and
is the deviation of pheromone intensity on edge (
s, j) at the
t − th interval, as shown in Equation (30):
Q is the release rate of pheromone (0 ≤
Q ≤ 1) and
is the path error (
s, j) for the
k − th ant.
(7) Stopping Rule
If a pre-specified stopping condition is satisfied, the run must be stopped and the results outputted; otherwise, return to step 4. In this study, the stopping rule is set at 300 generations.