Publications

Export 5 results:
Sort by: [ Author  (Asc)] Title 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]
H
Hadi, A. A., A. W. Mohamed, and K. M. Jambi, LSHADE-SPA memetic framework for solving large-scale optimization problems, , vol. 5, issue 1, pp. 25 - 40, 2019. AbstractWebsite

During the last decade, large-scale global optimization has been one of the active research fields. Optimization algorithms are affected by the curse of dimensionality associated with this kind of complex problems. To solve this problem, a new memetic framework for solving large-scale global optimization problems is proposed in this paper. In the proposed framework, success history-based differential evolution with linear population size reduction and semi-parameter adaptation (LSHADE-SPA) is used for global exploration, while a modified version of multiple trajectory search is used for local exploitation. The framework introduced in this paper is further enhanced by the concept of divide and conquer, where the dimensions are randomly divided into groups, and each group is solved separately. The proposed framework is evaluated using IEEE CEC2010 and the IEEE CEC2013 benchmarks designed for large-scale global optimization. The comparison results between our framework and other state-of-the-art algorithms indicate that our proposed framework is competitive in solving large-scale global optimization problems.

Hadi, A. A., A. W. Mohamed, and K. M. Jambi, "Single-Objective Real-Parameter Optimization: Enhanced LSHADE-SPACMA Algorithm", Heuristics for Optimization and Learning, Cham, Springer International Publishing, pp. 103 - 121, 2021. Abstract

Hadi, Anas A.Mohamed, Ali W.Jambi, Kamal M.Real parameter optimization is one of the active research fields during the last decade. The performance of LSHADE-SPACMALSHADE was competitive in IEEE CEC’2017 competition on Single Objective Bound Constrained Real-Parameter Single Objective Optimization. Besides, it was ranked fourth among twelve papers were presented on and compared to this new benchmark problems. In this work, an improved version named ELSHADE-SPACMASPACMA is introduced. In LSHADE-SPACMA, p value that controls the greediness of the mutation strategy is constant. While in ELSHADE-SPACMAESHADE, p value is dynamic. Larger value of p will enhance the exploration, while smaller values will enhance the exploitation. We further enhanced the performance of ELSHADE-SPACMA by integrating another directed mutation strategy within the hybridization framework. The proposed algorithm has been evaluated using IEEE CEC’2017 benchmark. According to the comparison results, the proposed ELSHADE-SPACMA algorithm is better than LSHADE and LSHADE-SPACMA. Besides, The comparison results between ELSHADE-SPACMA and the best three algorithms from the IEEE CEC’2017 Competition indicate that ELSHADE-SPACMA algorithm shows overall better performance and it is highly competitive algorithm for solving global optimization problems.

Hassan, S. A., P. Agrawal, T. Ganesh, and A. W. Mohamed, "A Travelling Disinfection-Man Problem (TDP) for COVID-19: A Nonlinear Binary Constrained Gaining-Sharing Knowledge-Based Optimization Algorithm", Intelligent Data Analysis for COVID-19 Pandemic, Singapore, Springer Singapore, pp. 291 - 318, 2021. Abstract

An improved scheduling the disinfection process of the new coronavirus (COVID-19) is introduced. The scheduling aims at achieving the best utilization of the available day time, which is calculated as the total disinfection time minus the total loss travelling time. In this regard, a new application problem is presented, which is called a travelling disinfection-man problem (TDP). The new problem (TDP) in network optimization resemble somehow the famous travelling salesman problems (TSP) but with basic distinct variations where a disinfection group is likely to select a route to reach a subset of predetermined places to be disinfected with the most utilization of the available day working hours. A nonlinear binary model is introduced with a detailed real application case study involving the improving the scheduling of coronavirus disinfection process for five contaminated faculties in Ain Shams University in Cairo, and the case study is solved using a novel discrete binary gaining-sharing knowledge-based optimization algorithm (DBGSK).

Hassan, S. A., P. Agrawal, T. Ganesh, and A. W. Mohamed, "Scheduling shuttle ambulance vehicles for COVID-19 quarantine cases, a multi-objective multiple 0–1 knapsack model with a novel Discrete Binary Gaining-Sharing knowledge-based optimization algorithm", Data Science for COVID-19, pp. 675 - 698, 2021. AbstractWebsite

The purpose of this paper is to present a proposal for scheduling shuttle ambulance vehicles assigned to COVID-19 patients using one of the discrete optimization techniques, namely, the multi-objective multiple 0–1 knapsack problem. The scheduling aims at achieving the best utilization of the predetermined planning time slot; the best utilization is evaluated by maximizing the number of evacuated people who might be infected with the virus to the isolation hospital and maximizing the effectiveness of prioritizing the patients relative to their health status. The complete mathematical model for the problem is formulated including the representation of the decision variables, the problem constraints, and the multi-objective functions. The proposed multi-objective multiple knapsack model is applied to an illustrated case study in Cairo, Egypt, the case study aims at improving the scheduling of ambulance vehicles in the back and forth shuttle movements between patient’ locations and the isolation hospital. The case study is solved using a novel Discrete Binary Gaining-Sharing knowledge-based optimization algorithm (DBGSK). The detail procedure of the novel DBGSK is presented along with the complete steps for solving the case study.

Hassan, S. A., P. Agrawal, T. Ganesh, and A. W. Mohamed, "Optimum Distribution of Protective Materials for COVID−19 with a Discrete Binary Gaining-Sharing Knowledge-Based Optimization Algorithm", Computational Intelligence Techniques for Combating COVID-19, Cham, Springer International Publishing, pp. 135 - 157, 2021. Abstract

Many application problems are formulated as nonlinear binary programming models which are hard to be solved using exact algorithms especially in large dimensions. One of these practical applications is to optimally distribute protective materials for the newly emerged COVID-19. It is defined for a decision-maker who wants to choose a subset of candidate hospitals comprising the maximization of the distributed quantities of protective materials to a set of chosen hospitals within a specific time shift. A nonlinear binary mathematical programming model for the problem is introduced with a real application case study; the case study is solved using a novel discrete binary gaining-sharing knowledge-based optimization algorithm (DBGSK). The solution algorithm proposes a novel binary adaptation of a 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 through their life span. Discrete binary version of GSK named novel binary gaining-sharing knowledge-based optimization algorithm (DBGSK) depends mainly on 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.