Hybrid Honey Bees Mating Optimization Algorithm for Identifying the Near-Optimal Solution in Web Service Composition

This paper addresses the problem of optimality in semantic Web service composition by proposing a hybrid nature-inspired method for selecting the optimal or near-optimal solution in semantic Web Service Composition. The method hybridizes the Honey-Bees Mating Optimization algorithm with components inspired from genetic algorithms, reinforcement learning, and tabu search. To prove the necessity of hybridization, we have analyzed comparatively the experimental results provided by our hybrid selection algorithm versus the ones obtained with the classical Honey Bees Mating Optimization algorithm and with the genetic-inspired algorithm of Canfora et al

A Deep Q-Learning based Smart Scheduling of EVs for Demand Response in Smart Grids

Economic and policy factors are driving the continuous increase in the adoption and usage of electrical vehicles (EVs). However, despite being a cleaner alternative to combustion engine vehicles, EVs have negative impacts on the lifespan of microgrid equipment and energy balance due to increased power demand and the timing of their usage. In our view grid management should leverage on EVs scheduling flexibility to support local network balancing through active participation in demand response programs. In this paper, we propose a model-free solution, leveraging Deep Q-Learning to schedule the charging and discharging activities of EVs within a microgrid to align with a target energy profile provided by the distribution system operator. We adapted the Bellman Equation to assess the value of a state based on specific rewards for EV scheduling actions and used a neural network to estimate Q-values for available actions and the epsilon-greedy algorithm to balance exploitation and exploration to meet the target energy profile. The results are promising showing that the proposed solution can effectively schedule the EVs charging and discharging actions to align with the target profile with a Person coefficient of 0.99, handling effective EVs scheduling situations that involve dynamicity given by the e-mobility features, relying only on data with no knowledge of EVs and microgrid dynamics.Comment: Submitted to journa

Exploring the Selection of the Optimal Web Service Composition through Ant Colony Optimization

This paper presents an ant-inspired method for selecting the optimal or a near optimal solution in semantic Web service composition. The proposed method adapts and enhances the Ant Colony Optimization meta-heuristic and considers as selection criteria the QoS attributes of the services involved in the composition as well as the semantic similarity between them. To improve the performance of the proposed selection method a 1-OPT heuristic is defined which expands the search space in a controlled way so as to avoid the stagnation on local optimal solutions. The ant-inspired selection method has been evaluated on a set of scenarios having different complexities and comparatively analyzed with a cuckoo-inspired and a bee-inspired selection method

Deep Learning, Mining, and Collaborative Clustering to Identify Flexible Daily Activities Patterns

The monitoring of the daily life activities routine is beneficial, especially in old age. It can provide relevant information on the person’s health state and wellbeing and can help identify deviations that signal care deterioration or incidents that require intervention. Existing approaches consider the daily routine as a rather strict sequence of activities which is not usually the case. In this paper, we propose a solution to identify flexible daily routines of older adults considering variations related to the order of activities and activities timespan. It combines the Gap-BIDE algorithm with a collaborative clustering technique. The Gap-BIDE algorithm is used to identify the most common patterns of behavior considering the elements of variations in activities sequence and the period of the day (i.e., night, morning, afternoon, and evening) for increased pattern mining flexibility. K-means and Hierarchical Clustering Agglomerative algorithms are collaboratively used to address the time-related elements of variability in daily routine like activities timespan vectors. A prototype was developed to monitor and detect the daily living activities based on smartwatch data using a deep learning architecture and the InceptionTime model, for which the highest accuracy was obtained. The results obtained are showing that the proposed solution can successfully identify the routines considering the aspects of flexibility such as activity sequences, optional and compulsory activities, timespan, and start and end time. The best results were obtained for the collaborative clustering solution that considers flexibility aspects in routine identification, providing coverage of monitored data of 89.63%

Social Factors in P2P Energy Trading Using Hedonic Games

Within energy communities, the prosumers can engage in peer-to-peer trading, fostering local collaborations and increasing awareness about energy usage and flexible consumption. However, even under these favorable technological and organizational mechanisms, prosumer engagement levels remain low, requiring trading mechanisms that are aligned with their social values and expectations. In this paper, we introduce an innovative hedonic game coordination and cooperation model for peer-to-peer (P2P) energy trading among prosumers which considers the social relationships within an energy community to create energy coalitions and facilitate energy transactions among them. A heuristic is defined to optimize the prosumers’ coalitions, considering their social and price preferences while balancing the energy demand and supply within the community. The proposed hedonic game model was integrated into a state-of-the-art blockchain-based P2P energy flexibility market and evaluated its performance within an energy community of prosumers. The evaluation results demonstrate the effectiveness of considering social factors when creating coalitions, resulting in a 5% increase in the total amount of energy transacted in a market session compared to other game theory-based solutions and a degree of satisfaction varying between 91-96%. The results underscore the importance of the social dimensions of P2P energy trading, the positive social dynamics within the energy community leading to an even greater increase in energy transacted around 30%, potentially generating daily savings between ${\$}$ 34 and ${\$}$ 47 and additional carbon savings of approximately 15.4 kgCO2eq

Deep Q-Learning-Based Smart Scheduling of EVs for Demand Response in Smart Grids

Economic and policy factors are driving the continuous increase in the adoption and usage of electrical vehicles (EVs). However, despite being a cleaner alternative to combustion engine vehicles, EVs have negative impacts on the lifespan of microgrid equipment and energy balance due to increased power demands and the timing of their usage. In our view, grid management should leverage on EV scheduling flexibility to support local network balancing through active participation in demand response programs. In this paper, we propose a model-free solution, leveraging deep Q-learning to schedule the charging and discharging activities of EVs within a microgrid to align with a target energy profile provided by the distribution system operator. We adapted the Bellman equation to assess the value of a state based on specific rewards for EV scheduling actions and used a neural network to estimate Q-values for available actions and the epsilon-greedy algorithm to balance exploitation and exploration to meet the target energy profile. The results are promising, showing the effectiveness of the proposed solution in scheduling the charging and discharging actions for a fleet of 30 EVs to align with the target energy profile in demand response programs, achieving a Pearson coefficient of 0.99. This solution also demonstrates a high degree of adaptability in effectively managing scheduling situations for EVs that involve dynamicity, influenced by various state-of-charge distributions and e-mobility features. Adaptability is achieved solely through learning from data without requiring prior knowledge, configurations, or fine-tuning

Identification of Daily Living Recurrent Behavioral Patterns Using Genetic Algorithms for Elderly Care

A person’s routine is a sequence of activities of daily living patterns recurrently performed. Sticking daily routines is a great tool to support the care of persons with dementia, and older adults in general, who are living in their homes, and also being useful for caregivers. As state-of-the-art tools based on self-reporting are subjective and rely on a person’s memory, new tools are needed for objectively detecting such routines from the monitored data coming from wearables or smart home sensors. In this paper, we propose a solution for detecting the daily routines of a person by extracting the sequences of recurrent activities and their duration from the monitored data. A genetic algorithm is defined to extract activity patterns featuring small differences that relate to the day-to-day contextual variations that occur in a person’s daily routine. The quality of the solutions is evaluated with a probabilistic-based fitness function, while a tournament-based strategy is employed for the dynamic selection of mutation and crossover operators applied for generating the offspring. The time variability of activities of daily living is addressed using the dispersion of the values of duration of that activity around the average value. The results are showing an accuracy above 80% in detecting the routines, while the optimal values of population size and the number of generations for fitness function evolution and convergence are determined using multiple linear regression analysis

Identification of Daily Living Recurrent Behavioral Patterns Using Genetic Algorithms for Elderly Care

A person’s routine is a sequence of activities of daily living patterns recurrently performed. Sticking daily routines is a great tool to support the care of persons with dementia, and older adults in general, who are living in their homes, and also being useful for caregivers. As state-of-the-art tools based on self-reporting are subjective and rely on a person’s memory, new tools are needed for objectively detecting such routines from the monitored data coming from wearables or smart home sensors. In this paper, we propose a solution for detecting the daily routines of a person by extracting the sequences of recurrent activities and their duration from the monitored data. A genetic algorithm is defined to extract activity patterns featuring small differences that relate to the day-to-day contextual variations that occur in a person’s daily routine. The quality of the solutions is evaluated with a probabilistic-based fitness function, while a tournament-based strategy is employed for the dynamic selection of mutation and crossover operators applied for generating the offspring. The time variability of activities of daily living is addressed using the dispersion of the values of duration of that activity around the average value. The results are showing an accuracy above 80% in detecting the routines, while the optimal values of population size and the number of generations for fitness function evolution and convergence are determined using multiple linear regression analysis