Skip to content
naulon
Not checkedNot checked for notices yet.

Time-Constrained Nature-Inspired Optimization Algorithms for an Efficient Energy Management System in Smart Homes and Buildings

Ibrar Ullah, Sajjad Hussain

Applied Sciences · 2019

doi:10.3390/app9040792 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

This paper proposes two bio-inspired heuristic algorithms, the Moth-Flame Optimization (MFO) algorithm and Genetic Algorithm (GA), for an Energy Management System (EMS) in smart homes and buildings. Their performance in terms of energy cost reduction, minimization of the Peak to Average power Ratio (PAR) and end-user discomfort minimization are analysed and discussed. Then, a hybrid version of GA and MFO, named TG-MFO (Time-constrained Genetic-Moth Flame Optimization), is proposed for achieving the aforementioned objectives. TG-MFO not only hybridizes GA and MFO, but also incorporates time constraints for each appliance to achieve maximum end-user comfort. Different algorithms have been proposed in the literature for energy optimization. However, they have increased end-user frustration in terms of increased waiting time for home appliances to be switched ON. The proposed TG-MFO algorithm is specially designed for nearly-zero end-user discomfort due to scheduling of appliances, keeping in view the timespan of individual appliances. Renewable energy sources and battery storage units are also integrated for achieving maximum end-user benefits. For comparison, five bio-inspired heuristic algorithms, i.e., Genetic Algorithm (GA), Ant Colony Optimization (ACO), Cuckoo Search Algorithm (CSA), Firefly Algorithm (FA) and Moth-Flame Optimization (MFO), are used to achieve the aforementioned objectives in the residential sector in comparison with TG-MFO. The simulations through MATLAB show that our proposed algorithm has reduced the energy cost up to 32.25% for a single user and 49.96% for thirty users in a residential sector compared to unscheduled load.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.