Mohamed Abdel-Baset

Work place: Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, El-ZeraSquare, Zagazig, Sharqiyah, Egypt



Research Interests: Computer systems and computational processes, Decision Support System, Combinatorial Optimization, Models of Computation


Mohamed Abd El-Baset received the B.Sc. degree in information system and technology from Zagazig University in 2006, and he obtained his M.S. degree in operations research and decision support systems from Zagazig University, in 2011. Currently, he is a teaching assistant in operations research department, Zagazig University. His current research interests are characterization of probability distribution, optimization, Intelligent Computing, Evolutionary Computation and decision support systems.

Author Articles
Chaotic Firefly Algorithm for Solving Definite Integral

By Osama Abdel-Raouf Mohamed Abdel-Baset Ibrahim El-henawy

DOI:, Pub. Date: 8 May 2014

In this paper, an Improved Firefly Algorithm with Chaos (IFCH) is presented for solving definite integral. The IFCH satisfies the question of parallel calculating numerical integration in engineering and those segmentation points are adaptive. Several numerical simulation results show that the algorithm offers an efficient way to calculate the numerical value of definite integrals, and has a high convergence rate, high accuracy and robustness.

[...] Read more.
Improved Harmony Search with Chaos for Solving Linear Assignment Problems

By Osama Abdel-Raouf Mohamed Abdel-Baset Ibrahim El-henawy

DOI:, Pub. Date: 8 Apr. 2014

This paper presents an improved version of a harmony meta-heuristic algorithm, (IHSCH), for solving the linear assignment problem. The proposed algorithm uses chaotic behavior to generation a candidate solution in a behavior similar to acoustic monophony. Numerical results show that the IHSCH is able to obtain the optimal results in comparison with traditional methods (the Hungarian method). However, the benefit of the proposed algorithm is its ability to obtain the optimal solution within less computation in comparison with the Hungarian method.

[...] Read more.
Other Articles