TY - JOUR
T1 - A novel link-based Multi-objective Grey Wolf Optimizer for Appliances Energy Scheduling Problem
AU - Makhadmeh, Sharif Naser
AU - Abasi, Ammar Kamal
AU - Al-Betar, Mohammed Azmi
AU - Awadallah, Mohammed A.
AU - Doush, Iyad Abu
AU - Alyasseri, Zaid Abdi Alkareem
AU - Alomari, Osama Ahmad
N1 - Funding Information:
This work was supported by Ajman University [grant numbers 2021-IRG-ENIT-6]
Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2022/12
Y1 - 2022/12
N2 - In this paper, a modified version of the Multi-objective Grey Wolf Optimizer (MGWO), known as linked-based GWO (LMGWO), is proposed for the Appliances Energy Scheduling Problem (AESP). The proposed LMGWO is utilized by combining the MGWO searching mechanism with a novel strategy, called neighbourhood selection strategy, to improve local exploitation capabilities. AESP is a problem that can be tackled by searching for the best appliances schedule according to a set of constraints and a dynamic pricing scheme(s) utilized for optimizing energy consumed at a particular period. Three objectives are considered to handle AESP: improving user comfort while reducing electricity bills and maintaining power systems’ performance. Therefore, AESP is modelled as a multi-objective optimization problem to handle all objectives simultaneously. In the evaluation results, the LMGWO is tested using a new dataset containing 30 power consumption scenarios with up to 36 appliances. For comparative purposes, the same linked-based neighbourhood selection strategy is utilized with other three optimization algorithms, including particle swarm optimization, salp swarm optimization, and wind-driven algorithm. The performance of the modified versions is compared with each other and that of the original versions to show their improvements. Furthermore, the proposed LMGWO is compared with eight state-of-the-art methods using their recommended datasets to show the viability of the proposed LMGWO. Interestingly, the proposed LMGWO is able to outperform the compared methods in almost all produced results.
AB - In this paper, a modified version of the Multi-objective Grey Wolf Optimizer (MGWO), known as linked-based GWO (LMGWO), is proposed for the Appliances Energy Scheduling Problem (AESP). The proposed LMGWO is utilized by combining the MGWO searching mechanism with a novel strategy, called neighbourhood selection strategy, to improve local exploitation capabilities. AESP is a problem that can be tackled by searching for the best appliances schedule according to a set of constraints and a dynamic pricing scheme(s) utilized for optimizing energy consumed at a particular period. Three objectives are considered to handle AESP: improving user comfort while reducing electricity bills and maintaining power systems’ performance. Therefore, AESP is modelled as a multi-objective optimization problem to handle all objectives simultaneously. In the evaluation results, the LMGWO is tested using a new dataset containing 30 power consumption scenarios with up to 36 appliances. For comparative purposes, the same linked-based neighbourhood selection strategy is utilized with other three optimization algorithms, including particle swarm optimization, salp swarm optimization, and wind-driven algorithm. The performance of the modified versions is compared with each other and that of the original versions to show their improvements. Furthermore, the proposed LMGWO is compared with eight state-of-the-art methods using their recommended datasets to show the viability of the proposed LMGWO. Interestingly, the proposed LMGWO is able to outperform the compared methods in almost all produced results.
KW - Appliances Energy Scheduling Problem
KW - Linked Based Grey Wolf Optimizer
KW - Multi-objective Grey Wolf Optimizer
KW - Neighbourhood Selection Strategy
UR - http://www.scopus.com/inward/record.url?scp=85134686053&partnerID=8YFLogxK
U2 - 10.1007/s10586-022-03675-3
DO - 10.1007/s10586-022-03675-3
M3 - Article
SN - 1386-7857
VL - 25
SP - 4355
EP - 4382
JO - Cluster Computing
JF - Cluster Computing
IS - 6
ER -