Ibrahim El-henawy

Work place: Department of Computer Science, faculty of Computers and Informatics, Zagazig University, El-ZeraSquare, Zagazig, Sharqiyah, Egypt, Postal code: 44519

E-mail: ielhenawy@zu.edu.eg


Research Interests: Computer Networks, Image Processing, Mathematics of Computing


Ibrahim El-henawy received the M.S. and Ph.D. degrees in computer science from State University of New York, USA in 1980 and 1983, respectively. Currently, he is a professor in computer science and mathematics department, Zagazig University. Ibrahim is a member of IEEE and AAEE (Australasian Association for Engineering Education), He is also a reviewer in different international journals and conferences. He has published more than 200 refereed articles in National and international journals, edited books, and conference proceedings. His current research interests are mathematics, operations research, statistics, networks, optimization, Intelligent Computing, Computer Theory, digital image processing, and security

Author Articles
An Improved Chaotic Bat Algorithm for Solving Integer Programming Problems

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

DOI: https://doi.org/10.5815/ijmecs.2014.08.03, Pub. Date: 8 Aug. 2014

Bat Algorithm is a recently-developed method in the field of computational intelligence. In this paper is presented an improved version of a Bat Meta-heuristic Algorithm, (IBACH), for solving integer programming problems. The proposed algorithm uses chaotic behaviour to generate a candidate solution in behaviors similar to acoustic monophony. Numerical results show that the IBACH is able to obtain the optimal results in comparison to traditional methods (branch and bound), particle swarm optimization algorithm (PSO), standard Bat algorithm and other harmony search algorithms. However, the benefits of this proposed algorithm is in its ability to obtain the optimal solution within less computation, which save time in comparison with the branch and bound algorithm (exact solution method).

[...] Read more.
A Novel Hybrid Flower Pollination Algorithm with Chaotic Harmony Search for Solving Sudoku Puzzles

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

DOI: https://doi.org/10.5815/ijmecs.2014.03.05, Pub. Date: 8 Mar. 2014

Flower Pollination algorithm (FPA) is a new nature-inspired algorithm, based on the characteristics of flowering plants.In this paper, a new hybrid optimization method called improved Flower Pollination Algorithm with Chaotic Harmony Search (FPCHS) is proposed. The method combines the standard Flower Pollination algorithm (FPA) with the chaotic Harmony Search (HS) algorithm to improve the searching accuracy. The FPCHS algorithm is used to solve Sudoku puzzles. Numerical results show that the FPCHS is accurate and efficient in comparison with standard Harmony Search, (HS) algorithm.

[...] Read more.
Other Articles