Export 9 results:
Sort by: Author [ Title  (Asc)] Type Year
A B C D E F G H I J K L M [N] O P Q R S T U V W X Y Z   [Show ALL]
Nomer, H. A. A., K. A. Alnowibet, A. Elsayed, and A. W. Mohamed, "Neural Knapsack: A Neural Network Based Solver for the Knapsack Problem", IEEE Access, vol. 8, pp. 224200 - 224210, 2020. Abstract
Xiong, G., L. Li, A. W. Mohamed, X. Yuan, and J. Zhang, A new method for parameter extraction of solar photovoltaic models using gaining–sharing knowledge based algorithm, , vol. 7, pp. 3286 - 3301, 2021. AbstractWebsite

For the solar photovoltaic (PV) system to operate efficiently, it is necessary to effectively establish an equivalent model of PV cell and extract the relevant unknown model parameters accurately. This paper introduces a new metaheuristic algorithm, i.e., gaining-sharing knowledge based algorithm (GSK) to solve the solar PV model parameter extraction problem. This algorithm simulates the process of knowledge acquisition and sharing in the human life cycle and is with strong competitiveness in solving optimization problems. It includes two significant phases. The first phase is the beginner–intermediate or junior acquisition and sharing stage, and the second phase is the intermediate–expert or senior acquisition and sharing stage. In order to verify the effectiveness of GSK, it is applied to five PV models including the single diode model, double diode model, and three PV modules. The influence of population size on the algorithm performance is empirically investigated. Besides, it is further compared with some other excellent metaheuristic algorithms including basic algorithms and advanced algorithms. Among the five PV models, the root mean square error values between the measured data and the calculated data of GSK are 9.8602E−04 ± 2.18E−17, 9.8280E−04 ± 8.72E−07, 2.4251E−03 ± 1.04E−09, 1.7298E−03 ± 6.25E−18, and 1.6601E−02 ± 1.44E−16, respectively. The results show that GSK has overall better robustness, convergence, and accuracy.

, "A Nonlinear Goal Programming Model for University Admission Capacity Planning with Modified Differential Evolution Algorithm", Mathematical Problems in Engineering, vol. 2015: Hindawi Publishing Corporation, pp. 13, 2015. Abstract
El-Quliti, S. A., A. H. M. Ragab, R. Abdelaal, A. W. Mohamed, A. S. Mashat, A. Y. Noaman, and A. H. Altalhi, "A Nonlinear Goal Programming Model for University Admission Capacity Planning with Modified Differential Evolution Algorithm", Mathematical Problems in Engineering, vol. 2015: Hindawi Publishing Corporation, pp. 892937, 2015. AbstractWebsite

This paper proposes a nonlinear Goal Programming Model (GPM) for solving the problem of admission capacity planning in academic universities. Many factors of university admission capacity planning have been taken into consideration among which are number of admitted students in the past years, total population in the country, number of graduates from secondary schools, desired ratios of specific specialties, faculty-to-students ratio, and the past number of graduates. The proposed model is general and has been tested at King Abdulaziz University (KAU) in the Kingdom of Saudi Arabia, where the work aims to achieve the key objectives of a five-year development plan in addition to a 25-year future plan (AAFAQ) for universities education in the Kingdom. Based on the results of this test, the proposed GPM with a modified differential evolution algorithm has approved an ability to solve general admission capacity planning problem in terms of high quality, rapid convergence speed, efficiency, and robustness.

Agrawal, P., T. Ganesh, and A. W. Mohamed, A novel binary gaining–sharing knowledge-based optimization algorithm for feature selection, , vol. 33, issue 11, pp. 5989 - 6008, 2021. AbstractWebsite

To obtain the optimal set of features in feature selection problems is the most challenging and prominent problem in machine learning. Very few human-related metaheuristic algorithms were developed and solved this type of problem. It motivated us to check the performance of recently developed gaining–sharing knowledge-based optimization algorithm (GSK), which is based on the concept of gaining and sharing knowledge of humans throughout their lifespan. It depends on two stages: beginners–intermediate gaining and sharing stage and intermediate–experts gaining and sharing stage. In this study, two approaches are proposed to solve feature selection problems: FS-BGSK: a novel binary version of GSK algorithm that relies on these two stages with knowledge factor 1 and FS-pBGSK: a population reduction technique that is employed on BGSK algorithm to enhance the exploration and exploitation quality of FS-BGSK. The proposed approaches are checked on twenty two feature selection benchmark datasets from UCI repository that contains small, medium and large dimensions datasets. The obtained results are compared with seven state-of-the-art metaheuristic algorithms; binary differential evolution, binary particle swarm optimization algorithm, binary bat algorithm, binary grey wolf optimizer, binary ant lion optimizer, binary dragonfly algorithm and binary salp swarm algorithm. It concludes that FS-pBGSK and FS-BGSK outperform other algorithms in terms of accuracy, convergence and robustness in most of the datasets.

Mohamed, A. W., A novel differential evolution algorithm for solving constrained engineering optimization problems, , vol. 29, issue 3, pp. 659 - 692, 2018. AbstractWebsite

This paper introduces a novel differential evolution (DE) algorithm for solving constrained engineering optimization problems called (NDE). The key idea of the proposed NDE is the use of new triangular mutation rule. It is based on the convex combination vector of the triplet defined by the three randomly chosen vectors and the difference vectors between the best, better and the worst individuals among the three randomly selected vectors. The main purpose of the new approach to triangular mutation operator is the search for better balance between the global exploration ability and the local exploitation tendency as well as enhancing the convergence rate of the algorithm through the optimization process. In order to evaluate and analyze the performance of NDE, numerical experiments on three sets of test problems with different features, including a comparison with thirty state-of-the-art evolutionary algorithms, are executed where 24 well-known benchmark test functions presented in CEC’2006, five widely used constrained engineering design problems and five constrained mechanical design problems from the literature are utilized. The results show that the proposed algorithm is competitive with, and in some cases superior to, the compared ones in terms of the quality, efficiency and robustness of the obtained final solutions.

Mohamed, A. W., "A Novel Discrete Binary Differential Evolution Algorithm", Aloy Journal of Soft Computing and Applications, vol. 2, no. 1: Aloy Publisher, 2014. Abstract
Mohamed, A. W., A. A. Hadi, and K. M. Jambi, Novel mutation strategy for enhancing SHADE and LSHADE algorithms for global numerical optimization, , vol. 50, pp. 100455, 2019. AbstractWebsite

Proposing new mutation strategies to improve the optimization performance of differential evolution (DE) is an important research study. Therefore, the main contribution of this paper goes in three directions: The first direction is introducing a less greedy mutation strategy with enhanced exploration capability, named DE/current-to-ord_best/1 (ord stands for ordered) or ord_best for short. In the second direction, we introduce a more greedy mutation strategy with enhanced exploitation capability, named DE/current-to-ord_pbest/1 (ord_pbest for short). Both of the proposed mutation strategies are based on ordering three selected vectors from the current generation to perturb the target vector, where the directed differences are used to mimic the gradient decent behavior to direct the search toward better solutions. In ord_best, the three vectors are selected randomly to enhance the exploration capability of the algorithm. On the other hand, ord_pbest is designed to enhance the exploitation capability where two vectors are selected randomly and the third is selected from the global p best vectors. Based on the proposed mutation strategies, ord_best and ord_pbest, two DE variants are introduced as EDE and EBDE, respectively. The third direction of our work is a hybridization framework. The proposed mutations can be combined with DE family algorithms to enhance their search capabilities on difficult and complicated optimization problems. Thus, the proposed mutations are incorporated into SHADE and LSHADE to enhance their performance. Finally, in order to verify and analyze the performance of the proposed mutation strategies, numerical experiments were conducted using CEC2013 and CEC2017 benchmarks. The performance was also evaluated using CEC2010 designed for Large-Scale Global Optimization. Experimental results indicate that in terms of robustness, stability, and quality of the solution obtained, both mutation strategies are highly competitive, especially as the dimension increases.