Chen, E., J. Chen, A. W. Mohamed, B. Wang, Z. Wang, and Y. Chen,
"Swarm Intelligence Application to UAV Aided IoT Data Acquisition Deployment Optimization",
IEEE Access, vol. 8, pp. 175660 - 175668, 2020.
Abstractn/a
Chen, E., J. Chen, A. W. Mohamed, B. Wang, Z. Wang, and Y. Chen,
"Swarm intelligence application to UAV aided IoT data acquisition deployment optimization",
IEEE Access, vol. 8: IEEE, pp. 175660-175668, 2020.
Abstractn/a
Hassan, S. A., Y. M. Ayman, K. Alnowibet, P. Agrawal, and A. W. Mohamed,
"Stochastic Travelling Advisor Problem Simulation with a Case Study: A Novel Binary Gaining-Sharing Knowledge-Based Optimization Algorithm",
Complexity, vol. 2020: Hindawi, pp. 6692978, 2020.
AbstractThis article proposes a new problem which is called the Stochastic Travelling Advisor Problem (STAP) in network optimization, and it is defined for an advisory group who wants to choose a subset of candidate workplaces comprising the most profitable route within the time limit of day working hours. A nonlinear binary mathematical model is formulated and a real application case study in the occupational health and safety field is presented. The problem has a stochastic nature in travelling and advising times since the deterministic models are not appropriate for such real-life problems. The STAP is handled by proposing suitable probability distributions for the time parameters and simulating the problem under such conditions. Many application problems like this one are formulated as nonlinear binary programming models which are hard to be solved using exact algorithms especially in large dimensions. A novel binary version of the recently developed gaining-sharing knowledge-based optimization algorithm (GSK) to solve binary optimization problems is given. GSK algorithm is based on the concept of how humans acquire and share knowledge during their life span. The binary version of GSK (BGSK) depends mainly on two stages that enable BGSK for exploring and exploitation of the search space efficiently and effectively to solve problems in binary space. The generated simulation runs of the example are solved using the BGSK, and the output histograms and the best-fitted distributions for the total profit and for the route length are obtained.
Hassan, S. A., K. Alnowibet, M. H. Khodeir, P. Agrawal, A. F. Alrasheedi, and A. W. Mohamed,
"A Stochastic Flight Problem Simulation to Minimize Cost of Refuelling",
Computers, Materials & Continua, vol. 69, issue 1: Tech Science Press, pp. 849-871, 2021.
Abstractn/a
Mohamed, A. W.,
Solving stochastic programming problems using new approach to Differential Evolution algorithm,
, vol. 18, issue 2, pp. 75 - 86, 2017.
AbstractThis paper presents a new approach to Differential Evolution algorithm for solving stochastic programming problems, named DESP. The proposed algorithm introduces a new triangular mutation rule based on the convex combination vector of the triangle and the difference vector between the best and the worst individuals among the three randomly selected vectors. The proposed novel approach to mutation operator is shown to enhance the global and local search capabilities and to increase the convergence speed of the new algorithm compared with conventional DE. DESP uses Deb’s constraint handling technique based on feasibility and the sum of constraint violations without any additional parameters. Besides, a new dynamic tolerance technique to handle equality constraints is also adopted. Two models of stochastic programming (SP) problems are considered: Linear Stochastic Fractional Programming Problems and Multi-objective Stochastic Linear Programming Problems. The comparison results between the DESP and basic DE, basic particle swarm optimization (PSO), Genetic Algorithm (GA) and the available results from where it is indicated that the proposed DESP algorithm is competitive with, and in some cases superior to, other algorithms in terms of final solution quality, efficiency and robustness of the considered problems in comparison with the quoted results in the literature.
Mohamed, A. W.,
Solving large-scale global optimization problems using enhanced adaptive differential evolution algorithm,
, vol. 3, issue 4, pp. 205 - 231, 2017.
AbstractThis paper presents enhanced adaptive differential evolution (EADE) algorithm for solving high-dimensional optimization problems over continuous space. To utilize the information of good and bad vectors in the DE population, the proposed algorithm introduces a new mutation rule. It uses two random chosen vectors of the top and bottom 100p% individuals in the current population of size NP, while the third vector is selected randomly from the middle [NP-2(100p%)] individuals. The mutation rule is combined with the basic mutation strategy DE/rand/1/bin, where the only one of the two mutation rules is applied with the probability of 0.5. This new mutation scheme helps to maintain effectively the balance between the global exploration and local exploitation abilities for searching process of the DE. Furthermore, we propose a novel self-adaptive scheme for gradual change of the values of the crossover rate that can excellently benefit from the past experience of the individuals in the search space during evolution process which, in turn, can considerably balance the common trade-off between the population diversity and convergence speed. The proposed algorithm has been evaluated on the 7 and 20 standard high-dimensional benchmark numerical optimization problems for both the IEEE CEC-2008 and the IEEE CEC-2010 Special Session and Competition on Large-Scale Global Optimization. The comparison results between EADE and its version and the other state-of-art algorithms that were all tested on these test suites indicate that the proposed algorithm and its version are highly competitive algorithms for solving large-scale global optimization problems.