Dr. Ghaitht Mohammad Hasan Jarada
My Social Links

Dr. Ghaitht Mohammad Hasan Jarada

Lecturer
Universiti Kebangsaan Malaysia, Malaysia


Highest Degree
Ph.D. in Optimization from Universiti Kebangsaan Malaysia, Malaysia

Share this Profile

Biography

Dr. Ghaitht Mohammad Hasan Jarada is currently working as Lecturer at Jerash University, Jerash, Jordan. He has completed his Ph.D. in Optimization from Universiti Kebangsaan Malaysia, Selangor, Malaysia. He also appointed as Lecturer at University College of Irbid, Al-Balqa University, Irbid, Jordan, and University College of TwinTech, Bandar Baru Bangi, Selangor, Malaysia. He has published 4 research articles in journals as well as 6 papers in conferences. He also attended many workshops and short courses.

Area of Interest:

Computer Sciences
100%
Artificial Intelligence
62%
Soft Computing
90%
Knowledge Representation
75%
Network Security
55%

Research Publications in Numbers

Books
0
Chapters
0
Articles
0
Abstracts
0

Selected Publications

  1. Jaradat, G.M., 2016. Hybrid elitist-ant system for a symmetric traveling salesman problem: Case of Jordan. Neural Comput. Applic. 10.1007/s00521-016-2469-3.
    CrossRef  |  
  2. Jaradat, G., M. Ayob and I. Almarashdeh, 2016. The effect of elite pool in hybrid population-based meta-heuristics for solving combinatorial optimization problems. Applied Soft Comput., 44: 45-56.
    CrossRef  |  Direct Link  |  
  3. Jaradat, G., M. Ayob and Z. Ahmad, 2014. On the performance of scatter search for post-enrolment course timetabling problems. Int. J. Combinatorial Optim., 27: 417-439.
    CrossRef  |  Direct Link  |  
  4. Jaradat, G.M., M. Ayob and Z. Ahmad, 2013. Scatter search metaheuristic for post-enrolment course timetabling problems: A review. Int. J. Adv. Comput. Technol., 5: 118-125.
    CrossRef  |  Direct Link  |  
  5. Jaradat, G.M. and M. Ayob, 2013. Effect of elite pool and Euclidean distance in big bang-big crunch metaheuristic for post-enrolment course timetabling problems. Int. J. Soft Comput., 8: 96-107.
    CrossRef  |  Direct Link  |  
  6. Jaradat, G.M. and M. Ayob, 2011. Scatter search for solving the course timetabling problem. Proceedings of the 3rd Conference on Data Mining and Optimization, June, 28-29, 2011, Malaysia, pp: 213-218.
    CrossRef  |  
  7. Jaradat, G.M. and M. Ayob, 2011. A comparison between hybrid population-based approaches for solving post-enrolment course timetabling problems. Int. J. Comput. Sci. Network Secur., 11: 116-123.
    Direct Link  |  
  8. Ayob, M., G.M. Jaradat, A.R. Hamdan, H.M. Sarim and M.Z.A. Nazri, 2011. Solving the viva presentations timetabling problem: A case study at FTSM-UKM. Proceedings of the 3rd International Conference on Electrical Engineering and Informatics, July 17-19, 2011, Bandung, Indonesia, pp: 1-4.
    CrossRef  |  
  9. Jaradat, G.M. and M. Ayob, 2010. Big bang-big crunch optimization algorithm to solve the course timetabling problem. Proceedings of the 10th IEEE International Conference on Intelligent Systems Design and Applications, November 29-December 1, 2010, Cairo, Egypt, pp: 1448-1452.
    CrossRef  |  
  10. Jaradat, G.M. and M. Ayob, 2010. An elitist-ant system for solving the post-enrolment course timetabling problem. Proceeding of the Database Theory and Application, Bio-Science and Bio-Technology, December 13-15, 2010, Jeju Island, Korea, pp: 167-176.
    CrossRef  |  
  11. Ayob, M. and G.M. Jaradat, 2009. Hybrid ant colony systems for course timetabling problems. Proceedings of the 2nd IEEE Conference on Data Mining and Optimization, October 27-28, 2009, Kajand, Malaysia, pp: 120-126.
    CrossRef  |  Direct Link  |  
  12. Yasin, A., G.M. Jaradat and R. Daud, 2007. Secondary school examination timetabling using genetic algorithm. Proceedings of the Malaysia-Japan International Symposium on Advanced Technology, November 12-15, 2007, Kuala Lumpur, Malaysia -.