Solving Energy Routing Problem in Energy Internet Using a Discrete Artificial Bee Colony Algorithm

Due to the large-scale and unequal distribution of energy resources, it has become common for numerous power system elements such as producers, consumers, microgrids, and so on to be interconnected in a network structure via energy routers (ER), referred to as the Energy Internet (EI). In EI, the trading mechanism is called a peer to peer energy trading (P2PET). It allows prosumers to trade their excess energy for additional income. This new trading scheme progressively transformed the energy supply mode from single-source to multisource and multipath. As a result, the concept of energy routing is becoming particularly crucial in the realisation of P2PET system. The minimum loss path (MLP) with power system constraints is the fundamental objective in the design of P2PET. In this work, we present a Discrete-Artificial Bee Colony algorithm (D-ABC). It is an optimization approach, which is an effective variant of ABC algorithm to solve the MLP problem with capacity constraints in EI. In addition, for the congestion management, two different schemes are applied and compared. Some numerical simulations with varied MLP scenarios are used to compare the the proposed algorithm's effectiveness to existing algorithms in the literature.