Figures
Abstract
The Electric Vehicle (EV) landscape has witnessed unprecedented growth in recent years. The integration of EVs into the grid has increased the demand for power while maintaining the grid’s balance and efficiency. Demand Side Management (DSM) plays a pivotal role in this system, ensuring that the grid can accommodate the additional load demand without compromising stability or necessitating costly infrastructure upgrades. In this work, a DSM algorithm has been developed with appropriate objective functions and necessary constraints, including the EV load, distributed generation from Solar Photo Voltaic (PV), and Battery Energy Storage Systems. The objective functions are constructed using various optimization strategies, such as the Bat Optimization Algorithm (BOA), African Vulture Optimization (AVOA), Cuckoo Search Algorithm, Chaotic Harris Hawk Optimization (CHHO), Chaotic-based Interactive Autodidact School (CIAS) algorithm, and Slime Mould Algorithm (SMA). This algorithm-based DSM method is simulated using MATLAB/Simulink in different cases and loads, such as residential and Information Technology (IT) sector loads. The results show that the peak load has been reduced from 4.5 MW to 2.6 MW, and the minimum load has been raised from 0.5 MW to 1.2 MW, successfully reducing the gap between peak and low points. Additionally, the performance of each algorithm was compared in terms of the difference between peak and valley points, computation time, and convergence rate to achieve the best fitness value.
Citation: V. MK, Chokkalingam B, S. D (2024) Demand side management using optimization strategies for efficient electric vehicle load management in modern power grids. PLoS ONE 19(3): e0300803. https://doi.org/10.1371/journal.pone.0300803
Editor: Agbotiname Lucky Imoize, University of Lagos Faculty of Engineering, NIGERIA
Received: November 16, 2023; Accepted: March 5, 2024; Published: March 21, 2024
Copyright: © 2024 V. et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Data Availability: All relevant data are within the manuscript.
Funding: The author(s) received no specific funding for this work.
Competing interests: The authors have declared that no competing interests exist.
1. Introduction
The Electric Vehicle (EV) landscape has witnessed unprecedented growth over recent years. Propelled by technological advancements, environmental concerns, and supportive policies, EVs are swiftly becoming a mainstay on roads globally. This transition represents not just a shift in consumer preference but also heralds a significant transformation in energy consumption patterns and the demands placed on the electrical grid [1]. The average EV requires a significant amount of energy to charge. A typical EV might need approximately 30 kWh of electricity for every 100 miles of range. To put this into perspective, the average American household consumes about 877 kWh per month. If even a fraction of Existing Internal Combustion based car owner’s switches to EVs, the additional load could be substantial. For instance, if 10% of the driving population adopted electric vehicles and each of those EVs consumed an additional 300 kWh per month for charging, this could translate to millions of extra kilowatt-hours needed monthly [2]. This demand places an additional burden on our power grids, which must be prepared to supply this energy reliably and sustainably [3]. The impact of EVs on daily load demand is both profound and multifaceted. The most noticeable effect is on peak demand times, typically early evening when people return home and plug in their vehicles for charging. Without intervention, this could exacerbate the evening peak load, potentially requiring utilities to activate additional, often less efficient, power plants to meet the demand. thus, raising concerns about grid stability, electricity prices, and environmental impacts [4]. The load profile of a grid–that is, the typical pattern of electricity usage over time is being reshaped by EVs. Traditionally, residential load profiles showed peaks in the morning and evening, corresponding to when people were most likely to be at home and using electricity. However, as EVs become more common, these profiles become steeper with sharper peaks, unless smart charging strategies or demand response programs are implemented. The ’load curve’ which graphically represents the variation of electrical load throughout the day, thus takes on a new shape in the age of EVs. It becomes not just a tool for observing current energy use but a map for predicting and managing the future, especially as the proportion of EVs continues to rise [5]. In some cases, the EV supports the grid during the peak load operating conditions by using vehicle to grid (V2G) technology. This setup can be constructed using distributed Flexible AC Transmission System(FACTS)based switched filter compensator (SFC) and a dynamic multi-level error-driven control strategy for efficient utilization of vehicle-to-grid battery chargers [6].
Demand Side Management (DSM) plays a pivotal role in this system by managing the demand for power in a way that maintains the grid’s balance and efficiency [7]. The integration of EVs increases the load demand, especially during peak hours, which can lead to overloads and even blackouts. It’s vital to understand how this affects the grid’s load profile and to find ways to mitigate any negative impacts. Along with these inclusion of the renewable energy sources, particularly solar PV systems are reducing the stress of grid caused by the EVs [8, 9]. As shown in the Fig 1, Implementing DSM strategies helps in smoothing the load curve, ensuring that the grid can accommodate the additional demand from EVs without compromising on stability or necessitating costly infrastructure upgrades. Strategies like time-of-use tariffs and smart charging are key to managing the load. Time-of-use tariffs encourage charging during off-peak hours, while smart charging systems can automatically adjust charging times based on grid demand. Case studies from around the world demonstrate the efficacy of DSM in integrating EVs into the grid. They provide real-world evidence of how such strategies can be successfully implemented. The role of consumers is critical in DSM. Incentives and educational programs are essential to encourage smart energy usage that aligns with DSM objectives. DSM implementation is not without its challenges. Technical, logistical, and consumer comfort considerations must be addressed to create a successful strategy. Many of the tools were already available such as extra-tree, bagging k-nearest neighbors (KNN), voting regressor, random forest, and boosting algorithms for monitoring the faults and improving the performance of the systems [10–12]. Along with that, the DSM must access the available charge scheduling algorithms employed for the charge allocation system of EVs. These algorithms will be helpful for DSM to schedule the EVs effectively [3, 13].
Innovative algorithms have been the cornerstone of effective DSM strategies, allowing to optimize energy usage without compromising the comfort of the end-users [14–16]. The Bender algorithm has been at the forefront of these strategies, enabling sophisticated planning and efficient resource allocation within the energy sector. Its design caters to the dynamic nature of energy demands, ensuring that energy distribution is both practical and cost-effective [17]. Genetic Algorithms (GA) have been employed to schedule household appliances in a way that minimizes energy costs [18]. These algorithms mimic the process of natural selection to find the most efficient schedule for appliance usage. However, the complexity of these GAs often leads to high computational loads, which can be a hurdle, especially when user convenience is a secondary consideration. The challenge lies in creating a system that not only cuts down on energy costs but also prioritizes user comfort. Achieving this balance is the holy grail of energy management [19]. A novel approach is the grey wolf accretive satisfaction algorithm, a strategy that puts user comfort at its core while striving for the lowest possible energy expenditure. This algorithm takes inspiration from the hunting behavior of grey wolves, aiming to provide a smart and adaptive energy management solution that aligns with the user’s lifestyle and preferences [20, 21].
Alongside, the Candidate Solution Updating Algorithm (CSUA) has been introduced. Its goal is crystal clear: minimize the time users spend waiting on appliances without diminishing their level of comfort. CSUA is a testament to the user-centric design in DSM, ensuring that energy savings and user convenience go hand-in-hand [22]. The collaboration between modified differential evolution and grey wolf optimization leads to a sophisticated model of energy management, aiming to slash peak energy usage and overall electricity costs [23]. This fusion is a powerhouse, driving forward the efficiency of energy systems and setting new benchmarks for what is possible in DSM. Advanced strategies such as load clipping and shifting have been developed, with simulations carried out in MATLAB/Simulink and further optimized using an Artificial Neural Network (ANN) algorithm [24]. The ANN algorithm refines these strategies, ensuring that they are not only effective but also adaptable to a myriad of energy scenarios and user behaviors.
The inclusion of the EV loads into the grid, makes an impact on the load curve. This affects the performance of the normal and optimization-based DSMsystems. This additional load reduces the accuracy and effectiveness of the objective functions and the constraints. In this work, the proper objective functions with necessary constraints with the inclusion of the EV load has been defined. Along with this, the objective function has been constructed with different optimization algorithms such as Bat Optimization Algorithm (BOA), African Vulture Optimization Algorithm (AVOA), Adaptive Neuro-Fuzzy Inference System (ANFIS), Cuckoo Search (CS) Algorithm, Chaotic Harris Hawk Optimization (CHHO), Chaotic-based Interactive Autodidact School (CIAS) algorithm and, Slime Mould Algorithm (SMA). The constraints and the execution of all these algorithms for the defined demographic area has been executed in all possible considerations.
The contribution of the proposed work are as follows,
- The research focuses on DSM as a key solution for managing the extra load on electrical grids due to EV charging, especially during peak hours.
- This work introduces various optimization algorithms for efficient energy usage optimization in DSM, considering the additional load from EVs.
- It examines how EV charging affects the grid’s load curve and adapts DSM strategies to maintain grid efficiency and stability.
- The inclusion of solar power generation supports the energy demand on peak hours and reduces the stress on the grid.
- It highlights the potential of DSM strategies in grid management with EV integration and suggests incorporating renewable energy sources.
The organization of the works is as follows: Section 2 discusses about the defined demographic area and the corresponding load profiles, Section 3 discusses about the objective function, constrains and the development of six different optimization methods, Section 4 discusses about the evaluation of the proposed DSM methods in all possible load variations and its effectiveness on this circumstance with necessary results, Section 5 presents the discussion over the performance of each methods and section 6 concludes the manuscript.
2. Problem statement
The shift to EVs poses challenges for optimizing grid consumption and integrating renewable energy. EV adoption increases residential energy loads and peak demands, requiring grid expansion. The challenge is adapting the grid for EVs, ensuring a smooth transition and handling increased demands. DSM plays a pivotal role, offering effective solutions to balance and optimize energy usage for a sustainable future. It promotes decentralized and efficient operation of appliances and EV charging. It addresses grid issues, plays a crucial role in EV integration, and ensures grid stability without costly infrastructure upgrades. DSM stabilizes the grid during variable EV demands by optimizing charging timing, reducing peak hour burdens. It also brings complexity due to the high variability of EV charging loads, the spatial and temporal variations in energy demand, and the challenges of integrating intermittent renewable energy sources whereas, traditional optimization methods often fall short in managing these complexities, which include peak load management, unpredictable user behavior, network constraints, and the need for advanced communication and control technologies. To realize this optimal DSM, a range of innovative heuristic algorithms are explored for global optimization challenges inherent in DSM. These include the BOA, known for its efficiency and simplicity, AVOA is noted for its robustness, CS algorithm is recognized for fast convergence, CHHO is appreciated for its adaptive search capability, CIAS algorithm is valued for its interactive learning approach and SMA is distinguished for its ability to avoid local optima. These heuristic algorithms are specifically chosen for their unique strengths to effectively manage the integration of EVs and other dynamic loads into the grid, ensuring a sustainable and efficient energy system. Ultimately, this work aims to harness the full capabilities of DSM, employing these advanced algorithms to effectively manage the integration of EVs and other dynamic loads into the grid. The simulation is designed to ensure fairness among all users, taking into account both the overall cost reduction and individual cost reduction. The goal is to pave the way for a more sustainable, reliable, and efficient energy system, bridging the gap between increasing energy demands and the imperative for environmental stewardship.
3. Structure of the proposed system
The architectural framework of GreenTech Nexus (GN), an integrated model of mixed-use area for sustainable living and business-oriented technological advancement, the graphical representation of the proposed model is showcased in Fig 2. GN connects with an aggregator to transmit power demands to the grid, including energy consumption by residential and IT sectors for the next day. The detailed description about the proposed system is briefed below.
3.1 Defined input and output model
The input model of the GN system is ingeniously designed to efficiently handle energy demands, particularly in the residential and IT sectors. At its core, the system is geared towards shifting energy consumption to off-peak hours. GN is outfitted [4] with an array of components including smart meters for real-time energy tracking, user interfaces for interactive management, scheduler modules for energy allocation, Home Energy Management (HEM) systems for optimizing efficiency, smart appliances that adapt to varying energy supplies, photovoltaic (PV) panels for sustainable energy generation, Battery Energy Storage Systems (BESS) for storing electricity, and EVs as both a load and a potential energy reservoir. This is facilitated by the integration of smart meters and a comprehensive communication network, which plays a pivotal role in aggregating and transmitting power demands from local areas to the grid. The inclusion of the aggregator further enhances this process, enabling the GN system to predict and manage the consecutive day’s energy consumption in a more efficient manner.
The output model of the GN system is characterized by its ability to maintain a consistent and efficient power supply. This is achieved through the main power contactor, which acts as an automatic switch essential for the smooth transmission of electricity across the network. The system’s efficient distribution of power, guided by the GreenHarmonizer Hub (GH), ensures that energy is utilized in the most effective manner, leading to a sustainable and balanced energy ecosystem. This integration of advanced scheduling and management capabilities makes the GN system an adept at catering the dynamic needs of both living and business environments.
GH is the central to the input and output model of GN system’s energy management. This innovative component acts as a scheduler, taking charge of decision-making and scheduling the energy usage in both smart homes and IT facilities. The GN infrastructure also includes a distribution board, crucial for dividing the power supply into various circuits and effectively distributes flexi (shiftable) energy loads from the constant (non-shiftable) one. The GH emits energy price alerts and identifies major energy-consuming appliances, optimizing energy usage by orchestrating the timings of household appliances. It receives real-time pricing indicators from the central grid via a smart meter, enabling fine-tuning of energy consumption each hour. The Smart Scheduler adjusts peak electricity consumption, shifting it to lower-cost periods, reducing expenditures, and balances the demand on the power grid. The GH maximizes energy efficiency by aligning consumption with optimal times, intelligently distributing energy, and optimizing overall network usage.
3.2 Cloud-aggregated energy optimization
The GreenTech Nexus (GN) system, with its cloud-enabled algorithm within the GreenHarmonizer Hub, plays a crucial role in optimizing energy usage across both smart homes and IT sectors. Its integration of cloud technology and advanced algorithms for optimization demonstrates its capacity to handle complex and dynamic energy management tasks. The core function of the GreenHarmonizer Hub is to process data on energy consumption and price fluctuations in real-time. This data is then processed to modify the energy consumption strategy. By shifting energy consumption from high-cost peak hours to more economical off-peak periods, the system not only reduces energy cost but also contributes to balanced energy distribution in the grid. The adaptability of the GreenHarmonizer Hub to varying energy needs and market conditions highlights its efficiency and makes it a crucial component in energy management systems.
The GN system’s integration with a cloud-based DSM system involves using smart meters and sensors for data collection. This data is crucial for understanding and optimizing energy use. The optimization engine, powered by meta heuristic optimization algorithms, works in the cloud to tailor energy consumption strategies. This engine takes into account specific objectives and constraints, ensuring optimal energy management. This feature enhances user engagement and control. by providing interactive dashboards that allow users in both residential and IT sectors to actively manage their energy consumption. The GN system’s ability to integrate with existing home automation systems and IT infrastructures makes it versatile and user-friendly. Upholding rigorous security standards and compliance measures ensures data integrity and adherence to regulatory requirements. This aspect is critical in maintaining user trust and system reliability. Regular monitoring and maintenance of the GN system ensures that it operates at optimal efficiency, adapting to changing conditions and requirements.
3.3 Proposed methodology for analyzing energy consumption in DSM framework
The proposed methodology for understanding the energy consumption patterns in the GN system simulation involves a comprehensive analysis of both the residential and commercial sectors, specifically focusing on a residential community of 6,000 houses and an IT sector company with 3,000 employees. This approach takes into account the unique consumption characteristics of these two sectors and explores the implications of integrating coordinated EVs charging with operational performance of grid [7] into their respective ecosystems. The complexity of their electricity usage patterns forms a multi-dimensional puzzle, one that energy analysts and policymakers strive to solve. This discourse presents a detailed analysis of the load profiles of a residential community, delving into the residential landscape, different consideration of a variety of living spaces: 1 Bedroom-Hall-Kitchen (BHK), 2 BHK, and 3 BHK houses, each with distinct occupancy rates. The demographic diversity confirms in the electric load patterns, showing a representation of electricity use that’s as varied as the lives of the inhabitants. Within these dwellings, a spectrum of appliances from essential to additional buzz with activity. As in the Fig 3, probability of each appliance’s presence is not uniform; some homes brim with gadgets, while others subscribe to minimalism, affecting the overall load profile. The possibility the residential loads considered in this works are, lights (15W Per Person (PP) always present), fan (70W PP, always present), refrigerator 150W (always present), Air Conditioner (AC) (1.5kW per room, 70% probability), Television (TV) (120W per room, 90% probability), Microwave (1kW, 30% probability), mixer (500W, 80% probability), Geyser (2kW, 60% probability), Room Heater: 1kW (only in winter), 40% probability, Washing Machine (500W, 70% probability).
Appliance utilization doesn’t adhere to a fixed schedule. Usage times are randomized, with a touch of logic applied to certain devices like washing machines, their cycles intertwined with occupancy levels, contributing to a dynamic load profile that’s as unpredictable as it is real. Amidst the energy consumption, solar panels emerge as beacons of sustainability on 20% of the rooftops, offsetting grid electricity demand during the sunlit hours, casting a green glow on the load profile. The daily exodus of working occupants leaves a distinct imprint on the load profile, with adjusted electricity usage reflecting their absence during office hours, a silent indication to the fade and flow of working life. Transitioning to the commercial sector, the IT sector’s energy blueprint is drawn with precise lines: a computer for each of the 3,000 employees, servers humming at the heart of operations, and an array of other appliances contributing to the load.
Every piece of equipment draws power: computers (150W each), servers (an average of 500W), lighting (20W per employee), and air conditioning calibrated to space size (1kW per 100 sq.m.), with a symphony of additional appliances adding their chords to the energy melody. The load profile fluctuates with the day’s rhythm a crescendo during working hours as computers, lights, and ACs perform in unison, and a decrescendo into the night with reduced lighting and AC use, though servers maintain their vigil. The output is an estimation of total load, a pulse that quickens and slows with the operational heartbeat of an IT company, providing a granular view of commercial electricity use. Merging the residential and IT sector load profiles unveils a comprehensive panorama of electricity demands, highlighting the contrasting usage patterns in the dwellings of daily life and the hubs of technological innovation. The total load profile of the given demographic area has been simulated as shown in Fig 4.
The chances of EV presence vary with house size, from the modest 1 BHK to the more spacious 3 BHK, each with their probabilities of housing zero, one, or even two EVs, adding another layer of complexity to the electricity consumption tapestry. This EV load creates an impact on the normal load profile. There are two several concerns need to be addressed such as the load demand of the area and the dependency of grid will be increased, also uneven charge scheduling of the EV causes increases the peak demand of the system. The load distribution on the load curve with the inclusion of EV load has been plotted as shown in Fig 5.
4. Problem formulation
The developed equations for the GN system simulation deliver an in-depth and quantifiable method for analyzing the intricate energy usage dynamics present in both residential and commercial settings, notably in a typical residential neighborhood and an IT company. These formulations are intricately designed to encapsulate distinct patterns of energy consumption arising from several key factors such as the utilization of various appliances, the frequency of their use, occupancy rates, the number of operational hours, as well as the integration aspects of EVs and solar energy systems.
4.1 Mathematical model for energy consumption
The comprehensive mathematical model manages energy consumption by distinguishing between flexible and non-flexible appliances, enabling dynamic energy management. It calculates each appliance’s energy consumption based on power rating, operational duration, and likelihood of usage, determining the total energy consumption of the household. By categorizing appliances into flexible and non-flexible, the model offers a nuanced understanding of household energy dynamics, allowing for the optimization of energy usage to align with cost-saving opportunities and demand-response initiatives.
For flexible appliances, the model incorporates a layer of flexibility, accounting for the likelihood that an appliance may be used during off-peak hours when energy rates are lower. This is represented mathematically by the inclusion of a binary decision variable in the Eq 1 for flexible appliances , hinges on a set of parameters, the power rating Pr, which quantifies the energy an appliance uses when active; the operational hours Ht,r, reflecting the duration of use within the chosen time slot t and a binary decision variable bt.r, indicative of whether the appliance is turned on or off. This decision variable is particularly important as it allows for the scheduling flexibility of these appliances, enabling them to be turned on during off-peak energy hours for cost-saving purposes or when renewable energy availability is high. The usage probability variable, Ut,r further refines this by accounting for user behavior such as the tendency to run dishwashers overnight or automated scheduling systems that optimize for energy savings.
Conversely in Eq 2, non-flexible appliances are those with fixed usage patterns, such as refrigerators and security systems, which are essential for the household’s functionality and typically operate continuously. These appliances are captured in the model without the need for a binary decision variable, as their operation is constant. Instead, their energy consumption is a straightforward product of their power rating and operational hours, , reflecting their steady and predictable demand on the energy system.
The model’s separation of appliances into these two categories allows for a targeted approach to managing energy consumption [15]. For instance, during peak demand hours, energy usage can be shifted away from flexible appliances, reducing strain on the grid and household energy costs. Meanwhile, the consistent load of non-flexible appliances provides a baseline for energy needs, ensuring that essential services remain uninterrupted.
The residential base load Rbase(t), is calculated by summing the energy usage of flexible and non-flexible appliances. The Eq 3 represents the total energy requirement for the household at any given time, considering both flexible and steady appliance demands.
The energy model for an IT sector company takes into account the constant demand from critical infrastructure, such as servers and networking equipment, which are non-flexible due to their 24/7 operational requirements. These elements are essential for the uninterrupted functioning of the company and typically do not have the flexibility to be turned off or operated at reduced capacity. The power consumption for these non-flexible components can be denoted by Pc , and is multiplied by their operational hours Ht.c , which, for non-flexible loads, are consistent across all time slots. On the other hand, flexible loads in an IT company might include workstations, certain office equipment, and possibly discretionary use of climate control systems, which can be adjusted based on occupancy and need. These flexible loads allow for energy management strategies, such as scheduling intensive computational tasks during off-peak hours or adjusting air conditioning when areas of the office are unoccupied. The equation for the base load of IT sector company’s Ibase(t) would be represented as follows in Eq 5.
To formulate the problem realistically, the Eq 6 represents Ssolar(t) evaluates the impact of renewable energy and solar implementation, considering technology and the environment. It incorporates the installed capacity of solar panels (Csolar) and their efficiency rate (ηsolar) to account for real-world factors affecting energy output. Additionally, the equation includes the variable St, representing sunlight availability influenced by time, weather, and seasons, and Δt, representing the duration for solar energy conversion.
The Eq 7 represents for EV charging load plays a pivotal role in understanding the growing influence of EVs on energy consumption patterns in both residential and commercial sectors. EEV(t) equation plays a crucial role in quantifying the total EV charging load at a specific time t, and it is an integral component in understanding the evolving landscape of energy consumption in both residential and commercial sectors.
This Eq 7, expressed is designed to calculate the combined power demand of EVs that are actively charging at a given moment. In this formulation, REV(t) stands for the total EV charging load at time t. The equation takes into account each EV within the scope of the analysis, ranging from the first EV to the NEV th EV, where NEV represents the total number of EVs that could potentially be charging at that time. This count is vital as it reflects the scale of EV charging infrastructure and usage within the area under consideration, whether it’s a residential neighborhood or a commercial parking facility.
The power rating of each EV charger (PEV) is a crucial factor in the equation, varying based on vehicle and charger type. A binary variable ct,EV indicates the charging status of each EV at time t, allowing for dynamic representation of charging activities. The variable ct,EV is set to 1 if an EV is being charged during the time slot, and 0 if it is not, representing the dynamic nature of EV charging activities over time.
4.2 Residential and IT sector load
The total loads for residential and IT sectors is expressed in Eqs 8 and 9 which includes the base loads R(t) and I(t) with EV load REV(t) and IEV(t), and the solar panel generation Ssolar(t) and ev intrusion EEV(t) can be expressed as,
(8)
(9)
The inclusion of EV load in the daily load profile of the grid operation increases the complexity. The DSM is one of the solutions to reduce the problems that arise due to the EV loads. The existing DSM methods constructed with the objective functions and constraints without the EV loads, where the inclusion of create an impact on the objective function as well as on the designed constraints. The revised objective function F can be expressed as in Eq 10,
(10)
where Dpeak is the peak demand during the time period T, and R(t) and I(t) represent the total residential and IT sector loads at time (t), respectively.
4.3 Constraints
Constraints in demand side energy management and grid optimization by setting defined rules and conditions for the system operation. These constraints help to balance different requirements, optimize the use of renewable energy sources, meet the operational needs of EVs, ensure efficient electricity usage, maintain grid stability, and prevent overloading. By adhering to these constraints, energy system efficiency and sustainability can be improved, allowing for the maximization of available resources while meeting consumer needs and maintaining grid integrity.
EV charging schedule constraints.
EVs are not to be charged during peak demand hours, which need to be defined as Eq 11,
(11)
Minimum state of charge for EVs.
EVs must still meet a minimum state of charge by a certain time is defined as Eq 12,
(12)
Non-peak charging windows.
EVs should be charged during non-peak hours and Emergency Hours which explicitly defined in the Eqs 13 and 14,
(13)
(14)
Solar generation constraints.
The contribution of solar generation to the load must be accounted for fitness function is defined in the Eq 15.
Load shifting.
Loads other than EV charging can be shifted if necessary by following below Eq 16.
Maximum and minimum load levels.
Eq 17 is defined to the Loads, which must stay within certain levels to ensure functionality and comfort of the grid operation.
4.4 Mathematical expression for the EV charging rescheduling
Let’s define P as the set of peak hours during the day to the defined Eq 20 for EV charging rescheduling, E is the emergency where vehicle needs to be charged and NP as the set of non-peak hours. The constraint for EV charging rescheduling can be expressed as:
(20)
Where and
are the scheduled EV charging rates during non-peak hours, which are determined by the available charging time, the energy requirement of the EVs, and the EV charging infrastructure’s capacity. By the execution of this objective function and the constraint the peak demand has been compensated by valley filling. The load curve obtained after the implementation of the DSM algorithm is shown in Fig 6.
There are different optimization methods that have been used for developing the DSM with the modified constraints. The detailed different optimization algorithms implementation for DSM model is shown in the flowchart Fig 7, along with the steps involved in the execution and the corresponding pseudocode were discussed detailed as follows:
A. Bat optimization algorithm.
The BOA was developed by Xin-She Yang in 2010 [25]. It simulates the foraging behavior of bats, which use echolocation to detect prey, avoid obstacles, and locate their roosting crevices in the dark. Bats emit a sound wave and listen to the echo that bounces back from surrounding objects. The BA uses the concept of frequency, velocity, and loudness to simulate bats’ search for optimal solutions in a problem space.
The behaviors of algorithms are:
- Frequency (fi) Bats use varying frequencies to search and home in on prey. In BA, this corresponds to the rate of change in solutions.
- Velocity (vi): Bats fly with varying speeds to cover different ranges. This correlates with the speed of convergence in the search space.
- Loudness (Ai): This aspect is utilized to adjust the exploration and exploitation balance during the search.
- Pulse Emission Rate (ri): Determines the rate of pulse emission for echolocation, analogous to the rate of local search around the current best solution.
The various steps involved in the establishment of the algorithm are:
- Step 1: Initialization: Generate the initial population of bats, each with a random position (Xi) and velocity (vi) within the defined constraints.
- Step 2: Fitness Evaluation: Calculate the fitness of each bat, which is the peak demand Dpeak for its corresponding DSM schedule.
- Step 3: Loop Until Convergence: For each iteration, update the bats’ positions and velocities based on the following rules:
- Frequency Update:
Where β is a random vector drawn from a uniform distribution.
- Velocity Update:
Where X* is the current global best location which has the lowest peak demand found so far.
- Position Update:
- Local Search: If a random number is greater than ri select a solution among the best solutions and perform a random walk.
- Loudness and Pulse Emission Rate Update: Decrease Ai and increase ri as the iterations proceed.
- Selection: If the new solutions have better fitness and a random number is less than the loudness, accept the new solutions and update X* if applicable.
- Step 4: Loop until a predetermined condition is met with min Dpeak.
Pseudocode:
Algorithm: Bat Algorithm for Demand Side Management
Input: Population size N, Frequency bounds fmin, fmax, Loudness A0, Pulse rate r0, Max iterations Itermax
Output: Best Performing Bat position to optimal scheduling of appliances
1: Initialize the bat population Xi and velocities vi for i = 1 to N
2: Define Pulse frequency fi at xi
3: Initialize pulse rates ri and the loudness Ai
4: While (t < Itermax) or (convergence criteria is not met) do
5: for each bat i = 1 to N do
6: Generate new solutions by adjusting frequency, and updating velocities and positions
7: if (rand > ri) then
8: Select a solution among the best solutions
9: Generate a local solution around the selected best solution
10: end if
11: Generate a new solution by flying randomly
12: if (rand < Ai && f(Xi) < f(X*)) then
13: Accept the new solution
14: Increase ri and reduce Ai
15: end if
16: Rank the bats and find the current best X*
17: end for
18: t = t + 1
19: end while
The execution of the BOA analyses each data of the appliances, loads and its state of operations, flexible loads, non-flexible loads and so on. The DSM has been achieved by the above steps and the results has plotted. The efficiency of the DSM using BO algorithm has been visualized from the Fig 8, where the load distribution is smooth as compared to the DSM.
B. Chaotic Harris Hawk Optimization (CHHO).
CHHO enhances the standard HHO by integrating chaotic maps, which are deterministic, yet unpredictable systems that help in diversifying the search pattern [26]. This aids in preventing premature convergence and ensuring the global optimum is reached. The metaphor of the Harris’ hawk’s cooperative hunting behavior is translated into mathematical models that mimic chasing, encircling, and attacking the prey, analogous to searching for the optimal solution in the problem space.
The algorithms behaviors are:
- Exploration Phase: Hawks randomly search for prey based on several chaotic exploration strategies, improving the diversity of the solutions.
- Exploitation Phase: Hawks perform several attacking strategies, including surprise pounce (hard besiege), rapid dives (soft besiege), and team chasing based on the prey’s escape patterns.
- Chaos Theory: Introduction of chaotic variables helps in maintaining the diversity of the population and avoiding local optima.
The various steps involved in the establishment of the algorithm are:
- Step 1: Initialization: Initialize the population and the corresponding fitness of each hawk based on the DSM problem’s constraints.
- Step 2: Loop Until Convergence: For each iteration, perform the following steps:
- Chaos Update: Integrate a chaotic sequence into the search process to enhance exploration and exploitation.
- Exploration and Exploitation: Hawks switch between exploration and exploitation phases, where the behavior is modeled by mathematical equations incorporating the chaotic variables.
- Update Hawks’ Positions: Depending on the phase, update the hawks’ positions either randomly (exploration) or based on the best solution found so far (exploitation).
- Local and Global Searches: Perform local and global searches based on the position of the prey, which represents the current best DSM strategy.
- Fitness Evaluation: Evaluate the fitness of each hawk’s position and update the best solution if a better one is found.
- Step 3: Is Last iteration, if yes then print the best solution, else then return to step 2.
Pseudocode:
Algorithm: Chaotic Harris Hawk Optimization for Demand Side Management
Input: Population size N, Max iterations Iter_max, Chaotic map settings
Output: Predominant Harris Hawk Position for reduced peak load values
1: Initialize the hawk population X_i and their fitness for i = 1 to N
2: Initialize chaotic variables and select a chaotic map
3: While (t < Iter_max) or (convergence criteria is not met) do
4: if (Exploration phase) then
5: Update the positions of hawks using chaotic variables
6: else if (Exploitation phase) then
7: Update positions based on the best solution and chaotic variables
8: end if
9: Evaluate the fitness of each hawk
10: Update the best solution if a better solution is found
11: Apply chaos to the system to ensure diversity
12: t = t + 1
13: end while
The load profile curve achieved from the DSM using CHHO algorithm is shown in Fig 9. This algorithm operates the DSM with the peak load of 3.4MW at residential and 3.1MW at the IT sector Loads respectively, whereas the normal DSM with the defined EV constraints operated with 4.3MW at residential side and 3.5MW at the IT sector side.
C. African vulture optimization algorithm.
AVOA was inspired by the intelligent foraging strategy of African vultures, known for their efficient scavenging and exceptional flight dynamics [27]. These birds utilize various flight patterns to maximize the probability of finding food with minimum energy consumption. The AVOA translates these behaviors into optimization processes to efficiently search for global optima within a given search space.
The algorithms behaviors are:
- Search for Carcass: Mimicking vultures spotting a carcass from high altitudes.
- Explorative Flight: Representing the wide-ranging search for new feeding opportunities.
- Exploitative Flight: Symbolizing the intense local search when a food source is known.
- Energy Consumption: Analogue to the computational effort required for the optimization process.
- Flight Adjustments: The adaptation of search patterns based on success rates and environmental cues.
The various steps involved in the establishment of the algorithm are:
- Step 1: Initialization: Define initial positions for the vultures, representing possible DSM strategies within the constraints of the problem.
- Step 2: Fitness Evaluation: Evaluate each vulture’s position for fitness, which is the peak demand Dpeak for the DSM strategy it represents.
- Step 3: Optimization Loop: For each iteration, execute the following:
- Determine Search Phase: Depending on the success of the previous iterations, decide whether to perform explorative or exploitative flights.
- Update Positions: Adjust the vultures’ positions based on the chosen search phase, factoring in energy levels and the perceived distance to the carcass (optimal solution).
- Local Search (if necessary): Conduct a local search around the current best positions to refine solutions.
- Energy Consumption: Simulate the energy consumption of vultures, adapting their flight dynamics over time.
- Selection: Keep the best solutions and discard those with higher peak demands.
- Output the Optimal Strategy: If the maximum number of iterations is reached or if convergence is achieved, end the optimization process.
Pseudocode:
Algorithm: African Vulture Optimization Algorithm for DSM
Input: Population size N, Max iterations Iter_max
Output: Top-Scoring Vulture Position for optimal solution vector
1: Initialize the positions of the vultures
2: Evaluate the initial fitness of the vultures
3: While (not converged and iterations < Iter_max) do
4: for each vulture i do
5: Decide the search phase (explorative or exploitative)
6: Update the position of vulture i based on the search phase
7: Perform local search if required
8: Evaluate the new position’s fitness
9: if (new fitness better than current fitness) then
10: Update the position to the new position
11: end if
12: end for
13: Update the global best position if necessary
14: iterations++
15: end while
The load profile curve achieved from the DSM using AVOA algorithm is shown in Fig 10. This algorithm operates the DSM with the peak load of 3.5MW at residential and 3.2MW at the IT sector Loads respectively.
D. Chaotic interactive autodidact school algorithm.
The CIAS Algorithm is inspired by the self-learning and interactive teaching processes found in academic environments [28]. It emulates the way students (solutions) learn both autonomously and through interaction with their peers (other solutions). By incorporating chaotic maps, the algorithm gains an ability to avoid local minima and ensures global optimization through enhanced exploration.
The algorithms behaviors are:
- Knowledge Sharing: Analogous to global optimization, where information is shared among the population to reach the best solution.
- Self-Study: Represents local search or refinement of the current solution.
- Teacher-Student Interaction: Informs the balance between exploration (global search) and exploitation (local search).
- Chaotic Sequences: Introduce unpredictability, which enables the algorithm to escape local optima and improve the diversity of solutions.
The various steps involved in the establishment of the algorithm are:
- Step 1: Initialization: Generate the initial population and assign initial knowledge levels to each student (solution).
- Step 2: Fitness Evaluation: Calculate the fitness (electrical load profile) for each student’s DSM strategy.
- Step 3: Loop Until Convergence: Iteratively perform the following steps, utilizing chaotic sequences to guide the search:
- Knowledge Update: Update each student’s knowledge based on their own study and interactions with other students.
- Chaotic Local Search: Apply chaotic maps to perform a local search around the current solution to avoid premature convergence.
- Teacher-Student Interaction: Select the best solution (teacher) to guide the other students, ensuring knowledge diffusion.
- Self-Study Process: Students independently refine their solutions based on personal learning rates.
- Global Knowledge Sharing: Share the best solution’s information with the entire population, emulating a global update.
- Selection: Select the best students (solutions) based on the reduced peak demand and ensure diversity through chaotic behavior.
- Output the Best Solution: Continue the iteration process until the predefined condition involving the minimum of Dpeak is achieved.
Pseudocode:
Algorithm: Chaotic-based IAS Algorithm for DSM
Input: Population size N, Max iterations Itermax, Chaotic map parameters
Output: Foremost Learner Solution for DSM matrix
1: Initialize the student population and their knowledge levels
2: Define a chaotic map and initialize its parameters
3: While (t < Itermax) or (convergence criteria is not met) do
4: Evaluate the fitness of each student
5: for each student i = 1 to N do
6: Update student’s knowledge using chaotic local search
7: Perform teacher-student interaction to share best solution
8: Carry out self-study to refine student’s knowledge
9: Apply global knowledge sharing
10: if the student’s new strategy results in a lower peak demand, then
11: Update the student’s knowledge to this new strategy
12: end if
13: end for
14: t = t + 1
15: Update chaotic map parameters
16: end while
The load profile curve achieved from the DSM using IASA algorithm is shown in Fig 11. This algorithm operates the DSM with the peak load of 3.6MW at residential and 3MW at the IT sector Loads respectively.
E. Cuckoo search algorithm.
Developed by Xin-She Yang and Suash Deb in 2009, the CS algorithm is inspired by the obligate brood parasitism of some cuckoo species [29]. These cuckoos lay their eggs in the nests of other host birds. If the host bird detects the alien eggs, it will either throw them away or abandon its nest. The CS algorithm mimics this process using a balanced combination of local and global random walks, controlled by a switching parameter.
The algorithms behaviors are:
- Lévy Flights: This is a type of random walk, which the CS algorithm uses for global exploration, enabling efficient searching over a large space.
- Discovery Rate (Pa): The probability of a host bird discovering a cuckoo egg, analogous to the rate of local exploitation in the search space.
Fixed Egg Laying Radius: Represents the area or neighborhood around a solution where new solutions (eggs) are laid.
The various steps involved in the establishment of the algorithm are:
- Step 1: Initialization: Generate the initial nests, each representing a DSM schedule.
- Step 2: Fitness Evaluation: Calculate the fitness of each nest based on the peak load(D_{peak}) for its DSM schedule.
- Step 3: Loop Until Convergence: For each generation, perform the following steps:
- Get a Cuckoo Randomly: Generate a new solution (Xi) using Lévy flights for a randomly chosen cuckoo (nest).
- Choose a Nest Randomly: Choose a nest randomly and compare its fitness with (Xi).
- Apply Discovery Rate: With a probability (Pa), determine if the eggs are discovered. If discovered, the nest is abandoned, and a new one is built (replace the solution in the nest with (Xi) if (Xi) is better).
- Keep Best Nests: Retain the best nests and carry out local searches around them.
- Abandon Worse Nests: A fraction (Pa) of the worse nests are abandoned, and new ones are built at new locations via Lévy flights.
- Rank the Nests and Find the Best: Rank the solutions/nests and find the current best nest.
- Termination Check: If the maximum generations are reached or convergence criteria are met, terminate the algorithm.
- Output the Best Solution: Continue executing the previous step until the specified termination criteria are satisfied.
Pseudocode:
Algorithm: Cuckoo Search for Demand Side Management
Input: Number of nests N, Discovery rate Pa, Max generations Genmax
Output: Principal Cuckoo Nest Position for Peak Load Reduction
1: Initialize nests Xi randomly for i = 1 to N
2: Evaluate the fitness of each nest
3: while (gen < Genmax) do
4: Get a cuckoo (i.e., solution) randomly by Lévy flights
5: Choose a nest j randomly and evaluate its fitness
6: if (fitness (Xi) > fitness (Xj)) then
7: Replace j with the new solution Xi
8: end if
9: Abandon a fraction Pa of worse nests and build new ones
10: Keep the best solutions (nests) and perform local searches
11: Rank the nests and find the current best
12: gen = gen + 1
13: end while
14: Output the best nest which is the DSM schedule
The load profile curve achieved from the DSM using CS algorithm is shown in Fig 12. This algorithm operates the DSM with the peak load of 4.6MW at residential and 3MW at the IT sector Loads respectively.
F. Slime mould algorithm.
The SMA, inspired by the slime mould’s ability to find the shortest path to food sources, is an effective method for solving complex optimization problems [30]. The algorithm mimics the oscillation pattern of slime mould in nature, which dynamically adjusts its body to optimize nutrient intake while minimizing exposure to threats.
The algorithms behaviors are:
- Oscillation Pattern: Slime mould changes its shape rhythmically, which is modeled in SMA to search through the solution space.
- Positive Feedback: As in nature, when a particular path is beneficial, the mould strengthens that path, akin to intensifying the search in a promising region.
- Balanced Exploration and Exploitation: The algorithm maintains a balance between diversifying the search (exploration) and intensifying the search around the promising solutions (exploitation).
The various steps involved in the establishment of the algorithm are:
- Step 1: Initialization: Generate an initial population of slime moulds with random positions within the permissible DSM strategy space.
- Step 2: Fitness Evaluation: Evaluate the fitness of each slime mould based on the objective function (Dpeak).
- Step 3: Loop Until Convergence: For each iteration, perform the following steps:
- Update Positions: Each slime mould updates its position according to the fitness of its current position and the fitness of other moulds, moving towards better positions.
- Oscillation Phase: Simulate the rhythmic contraction and expansion of slime mould to explore the search space.
- Positive Feedback Mechanism: If certain DSM strategies yield lower peak loads, reinforce those strategies among the population.
- Adaptation: Adjust the search strategy based on the stochastic oscillation of the agents.
- Selection: Retain the best-found solutions and discard the less effective ones.
- Output the Best Solution: Check if it’s the final iteration. If it is, display the best-found solution; if not, proceed back to the third step.
Pseudocode:
Algorithm: Slime Mould Algorithm for Demand Side Management
Input: Population size N, Maximum iterations Tmax, Search Space Dimensions
Output: Slime Mould Pathway for load management pattern
1: Initialize the slime mould population Xi for i = 1 to N
2: Evaluate the fitness of each slime mould
3: Determine the best solution Xbest
4: While (t < Tmax) do
5: for each slime mould i do
6: Update the position of slime mould i towards the best solution
7: Oscillate to explore the search space
8: Evaluate the updated fitness
9: If the new position is better, update the individual and global best
10: end for
11: t = t + 1
12: end while
13: Return the optimized DSM schedule Xbest
The load profile curve achieved from the DSM using SMA algorithm is shown in Fig 13. This algorithm operates the DSM with the peak load of 3.4MW at residential and 3.1MW at the IT sector Loads respectively.
5. Comparative analysis
In residential and IT sectors, energy demand patterns can vary significantly. DSM introduces a framework for intelligently adjusting these patterns, ensuring that energy consumption aligns more closely with sustainable practices. DSM strategies and algorithms have achieved significant peak load reduction, leading to a more balanced energy consumption pattern. As shown in the Table 1, baseline energy demand without DSM gives a peak load of 4.67 MW and a low of 0.47 MW. In the residential sector, there is a significant 4.2 MW variance between peak and low demand. For the IT sector, using general DSM formulas, the peak demand is 4.23 MW and the low demand is 0.99 MW, resulting in a 3.24 MW difference. Generic DSM model reduce variation between residential and IT sectors. The peak load is reduced to 4.52 MW for residential and 3.61 MW for IT. This decreases the peak to low difference to 3.39 MW for residential and 2.44 MW for IT, improving alignment of energy consumption with availability. Various advanced algorithms were evaluated for their performance, with the BAT Algorithm reducing the peak-to-low difference to 2.44 MW in the residential sector and 1.64 MW in the IT sector. The AVOA and SMA algorithms also show improvements, with the SMA algorithm achieving a residential peak-to-low difference of 2.36 MW. However, the most effective algorithm remains the CHHO algorithm, with peak-to-low differences of 2.36 MW for residential and 1.62 MW for IT. The CS algorithm achieves a peak-to-low difference of 3.6 MW in the residential sector and 2.56 MW in the IT sector, which is not as effective as CHHO but significantly better than the baseline DSM.
The reduction in peak loads and the corresponding increase in low loads with DSM implementation hint at a significant improvement in both sectors’ energy consumption profiles. The comparative chart of the peak load, least load in residential and IT sector loads are shown in Fig 14. The efficiency of the algorithm can be evaluated by measuring the difference between the peak demand and least demand as shown in Fig 15.
The computation times of algorithms (BOA, AVOA, CS, CHHO, CIAS, and SMA) were measured and compared as shown in Fig 16. The algorithms were run on a high-performance Intel i7 13th gen 1335 processor with 16 GB ram computing setup under identical conditions to determine the best method in terms of result and speed.
Fig 17 shows the convergence curves of each algorithm have been plotted as fitness values vs iteration. Using this plot, it can be inferred that CHHO is the most efficient in terms of least convergence happened at 9th iteration and maintaining a low fitness value of 155, which might suggest finding the global minimum. AVOA also shows quick convergence, but it plateaus early, which may suggest a risk of not finding the global minimum if it isn’t reached early in the search. Unlike the other algorithms, the CS and BOA exhibit a gradual convergence. This characteristic proves beneficial when dealing with a rugged search space of GN and the potential for being trapped in local minima. On the other hand, the SMO consistently maintains a low value, indicating that it initially performs well but does not show significant improvement. This could be attributed to either finding a near-optimal solution early or being unable to escape a local minimum if the solution is not optimal.
6. Conclusion
The work has demonstrated that the integration of EVs into the power grid, while beneficial for reducing carbon emissions, poses substantial challenges for load management. The proposed optimization-based DSM algorithm effectively addresses these challenges, exhibiting significant improvements in managing the daily demand and load curve of the system. Comparative analysis with other algorithms has shown that this proposed approach not only reduces peak loads but also facilitates a more stable and balanced grid by effectively shifting EV charging loads. The implications of these findings are twofold: firstly, it highlights the potential of advanced DSM strategies to enhance grid management in the era of EV expansion; secondly, it provides a framework for utilities and energy managers to incorporate optimization-based DSM algorithms into their operational strategies, including EV charge scheduling. The CHHO Algorithm’s impressive performance in the IT realm, contrasted with the Slime Mould Algorithm’s remarkable efficiency in residential areas, underscores their respective proficiency. The distinct effectiveness of each algorithm across varied sectors underscores the imperative for customized solutions in orchestrating load management tactics. Delving into the dynamics of DSM algorithms unveils profound insights into their ability in forming energy consumption curves, with the CHHO performing better than other algorithms in residential loads whereas SMA performs better alongside CHHO in the IT sector load. However, CHHO shows a better convergence rate compared to SMA and other algorithms, performing well for objective functions and constraints when considering all loads in the GN system. The study suggests future investigations into the scalability of DSM approaches across diverse geographical and demographic contexts, potentially leading to widely applicable and reliable energy management solutions for various electric grid scenarios, including versatile EV charge scheduling methods.
References
- 1. Castillo V. Z., de Boer H.-S., Muñoz R. M., Gernaat D. E. H. J., Benders R., and van Vuuren D., “Future global electricity demand load curves,” Energy, vol. 258, p. 124741, Nov. 2022,
- 2. Ho J. C. and Huang Y.-H. S., “Evaluation of electric vehicle power technologies: Integration of technological performance and market preference,” Cleaner and Responsible Consumption, vol. 5, p. 100063, Jun. 2022,
- 3. Savari G. F. et al., “Assessment of charging technologies, infrastructure and charging station recommendation schemes of electric vehicles: A review,” Ain Shams Engineering Journal, vol. 14, no. 4, p. 101938, Apr. 2023,
- 4. Rodrigues F., Cardeira C., Calado J. M. F., and Melicio R., “Short-Term Load Forecasting of Electricity Demand for the Residential Sector Based on Modelling Techniques: A Systematic Review,” Energies (Basel), vol. 16, no. 10, p. 4098, May 2023,
- 5. Bibak B. and Tekiner-Mogulkoc H., “The parametric analysis of the electric vehicles and vehicle to grid system’s role in flattening the power demand,” Sustainable Energy, Grids and Networks, vol. 30, p. 100605, Jun. 2022,
- 6.
Omar A. I., Sharaf A. M., Shady H A. Abdel E, Mohamed A. A, and Essam E. A. E.-Z, “Optimal Switched Compensator for Vehicle-to-Grid Battery Chargers Using Salp Optimization,” in 2019 21st International Middle East Power Systems Conference (MEPCON), IEEE, Dec. 2019, pp. 139–144. https://doi.org/10.1109/MEPCON47431.2019.9008229
- 7. Wen L., Zhou K., Feng W., and Yang S., “Demand Side Management in Smart Grid: A Dynamic-Price-Based Demand Response Model,” IEEE Trans Eng Manag, pp. 1–30, 2022,
- 8. Awad M., Ibrahim A. M., Alaas Z. M., El-Shahat A., and Omar A. I., “Design and analysis of an efficient photovoltaic energy-powered electric vehicle charging station using perturb and observe MPPT algorithm,” Front Energy Res, vol. 10, Aug. 2022,
- 9. Aljafari B., Balachandran P. K., Samithas D., and Thanikanti S. B., “Solar photovoltaic converter controller using opposition-based reinforcement learning with butterfly optimization algorithm under partial shading conditions,” Environmental Science and Pollution Research, vol. 30, no. 28, pp. 72617–72640, May 2023, pmid:37173605
- 10. Alwar S., Samithas D., Boominathan M. S., Balachandran P. K., and Mihet-Popa L., “Performance Analysis of Thermal Image Processing-Based Photovoltaic Fault Detection and PV Array Reconfiguration—A Detailed Experimentation,” Energies (Basel), vol. 15, no. 22, p. 8450, Nov. 2022,
- 11. Al-Gabalawy M., Elmetwaly A. H., Younis R. A., and Omar A. I., “Temperature prediction for electric vehicles of permanent magnet synchronous motor using robust machine learning tools,” J Ambient Intell Humaniz Comput, May 2022,
- 12. Kumar R. R., Bharatiraja C., Udhayakumar K., Devakirubakaran S., Sekar K. S., and Mihet-Popa L., “Advances in Batteries, Battery Modeling, Battery Management System, Battery Thermal Management, SOC, SOH, and Charge/Discharge Characteristics in EV Applications,” IEEE Access, vol. 11, pp. 105761–105809, 2023,
- 13. Mohammed S. S., Ahamed T. P. I., Aleem S. H. E. A., and Omar A. I., “Interruptible charge scheduling of plug-in electric vehicle to minimize charging cost using heuristic algorithm,” Electrical Engineering, vol. 104, no. 3, pp. 1425–1440, Jun. 2022,
- 14. Yaagoubi N. and Mouftah H. T., “User-Aware Game Theoretic Approach for Demand Management,” IEEE Trans Smart Grid, vol. 6, no. 2, pp. 716–725, Mar. 2015,
- 15. Jasim A. M., Jasim B. H., Neagu B.-C., and Alhasnawi B. N., “Efficient Optimization Algorithm-Based Demand-Side Management Program for Smart Grid Residential Load,” Axioms, vol. 12, no. 1, p. 33, Dec. 2022,
- 16. Zaini F. A., Sulaima M. F., Razak I. A. W. A., Zulkafli N. I., and Mokhlis H., “A Review on the Applications of PSO-Based Algorithm in Demand Side Management: Challenges and Opportunities,” IEEE Access, vol. 11, pp. 53373–53400, 2023,
- 17. Gao H. and Li Z., “A Benders Decomposition Based Algorithm for Steady-State Dispatch Problem in an Integrated Electricity-Gas System,” IEEE Transactions on Power Systems, vol. 36, no. 4, pp. 3817–3820, Jul. 2021,
- 18. Yao L., Chang W.-C., and Yen R.-L., “An Iterative Deepening Genetic Algorithm for Scheduling of Direct Load Control,” IEEE Transactions on Power Systems, vol. 20, no. 3, pp. 1414–1421, Aug. 2005,
- 19. Mellouk L., Boulmalf M., Aaroud A., Zine-Dine K., and Benhaddou D., “Genetic Algorithm to Solve Demand Side Management and Economic Dispatch Problem,” Procedia Comput Sci, vol. 130, pp. 611–618, 2018,
- 20.
Ayub S., Bin Md S. Ayob T. Chee Wei, and Aziz L, “Grey Wolf Accretive Satisfaction Algorithm for Optimization of Residence Energy Management with Time and Device-based Preferences,” in 2020 IEEE International Conference on Power and Energy (PECon), IEEE, Dec. 2020, pp. 309–314. https://doi.org/10.1109/PECon48942.2020.9314420
- 21. Ayub S., Ayob S. Md, Tan C. W, Ayub L, and Bukar A. L, “Optimal residence energy management with time and device-based preferences using an enhanced binary grey wolf optimization algorithm,” Sustainable Energy Technologies and Assessments, vol. 41, p. 100798, Oct. 2020,
- 22. Shami T. M., Grace D., Burr A., and Mitchell P. D., “Single candidate optimizer: a novel optimization algorithm,” Evol Intell, Aug. 2022,
- 23. Sharma R. and Gopal M., “Synergizing reinforcement learning and game theory—A new direction for control,” Appl Soft Comput, vol. 10, no. 3, pp. 675–688, Jun. 2010,
- 24. Macedo M. N. Q., Galo J. J. M., de Almeida L. A. L., and Lima A. C. de C, “Demand side management using artificial neural networks in a smart grid environment,” Renewable and Sustainable Energy Reviews, vol. 41, pp. 128–133, Jan. 2015,
- 25. Shehab M. et al., “A Comprehensive Review of Bat Inspired Algorithm: Variants, Applications, and Hybridization,” Archives of Computational Methods in Engineering, vol. 30, no. 2, pp. 765–797, Mar. 2023, pmid:36157973
- 26. Dehkordi A. A., Sadiq A. S., Mirjalili S., and Ghafoor K. Z., “Nonlinear-based Chaotic Harris Hawks Optimizer: Algorithm and Internet of Vehicles application,” Appl Soft Comput, vol. 109, p. 107574, Sep. 2021,
- 27. Abdollahzadeh B., Gharehchopogh F. S., and Mirjalili S., “African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems,” Comput Ind Eng, vol. 158, p. 107408, Aug. 2021,
- 28. Jahangiri M., Hadianfard M. A., Najafgholipour M. A., Jahangiri M., and Gerami M. R., “Interactive autodidactic school: A new metaheuristic optimization algorithm for solving mathematical and structural design optimization problems,” Comput Struct, vol. 235, p. 106268, Jul. 2020,
- 29.
Yang X.-S., “Cuckoo Search,” in Nature-Inspired Optimization Algorithms, Elsevier, 2014, pp. 129–139. https://doi.org/10.1016/B978-0-12-416743-8.00009–9
- 30. Li S., Chen H., Wang M., Heidari A. A., and Mirjalili S., “Slime mould algorithm: A new method for stochastic optimization,” Future Generation Computer Systems, vol. 111, pp. 300–323, Oct. 2020,