A Novel Discrete Binary Gaining-Sharing Knowledge-Based Optimization Algorithm for the Travelling Counselling Problem for Utilization of Solar Energy

作     者：Hassan, Said Ali Agrawal, Prachi Ganesh, Talari Mohamed, Ali Wagdy 

作者机构：Cairo Univ Fac Comp & Artificial Intelligence Dept Operat Res & Decis Support Giza Egypt Natl Inst Technol Dept Math & Sci Comp Hamirpur Himachal Prades India Cairo Univ Giza Egypt 

出 版 物：《INTERNATIONAL JOURNAL OF SWARM INTELLIGENCE RESEARCH》 (国际群智能研究杂志)

年 卷 期：2022年第13卷第1期

页      面：1-24页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Evolutionary Computation Gaining Sharing Knowledge-Based Optimization Algorithm Nonlinear Binary Constrained Optimization Travelling Counselling Problem (TCP) Utilization of Solar Power Stations 

摘      要：This article proposes a novel binary version of recently developed gaining-sharing knowledge-based optimization algorithm (GSK) to solve binary optimization problems. GSK algorithm is based on the concept of how humans acquire and share knowledge during their life span. A discrete binary version of GSK named novel binary gaining sharing knowledge-based optimization algorithm (DBGSK) depends on mainly two binary stages: binary junior gaining sharing stage and binary senior gaining sharing stage with knowledge factor 1. These two stages enable DBGSK for exploring and exploitation of the search space efficiently and effectively to solve problems in binary space. An improved scheduling of the technical counselling process for utilization of the electricity from solar energy power stations is introduced. The scheduling aims at achieving the best utilization of the available day time for the counselling group, and a new application problem is presented, which is called a travelling counselling problem (TCP). A nonlinear binary model is introduced with a real application.