mohammed Azmi
Al-Balqa Applied University, Computer Science, Faculty Member
Research Interests:
Research Interests:
Harmony search (HS) algorithm is relatively a recent metaheuristic optimization method inspired by natural phenomenon of musical improvisation process. despite its success, the main drawback of harmony search are contained in its tendency... more
Harmony search (HS) algorithm is relatively a recent metaheuristic optimization
method inspired by natural phenomenon of musical improvisation process.
despite its success, the main drawback of harmony search are contained in its tendency
to converge prematurely due to its greedy selection method. This probably
leads the harmony search algorithm to get stuck in local optima and unsought solutions
owing to the limited exploration of the search space. The great deluge algorithm
is a local search-based approach that has an efficient capability of increasing
diversity and avoiding the local optima. This capability comes from its flexible
method of accepting the new constructed solution. The aim of this research is to
propose and evaluate a new variant of HS. To do so, the acceptance method of the
great deluge algorithm is incorporated in the harmony search to enhance its convergence
properties by maintaining a higher rate of diversification at the initial stage of
the search process. The proposed method is called Harmony Search Great Deluge
(HS-GD) algorithm. The performance of HS-GD and the classical harmony search
algorithm was evaluated using a set of ten benchmark global optimization functions.
In addition, five benchmark functions of the former set were employed to compare
the results of the proposed method with three previous harmony search variations
including the classical harmony search. The results show that HS-GD often outperforms
the other comparative approaches.
method inspired by natural phenomenon of musical improvisation process.
despite its success, the main drawback of harmony search are contained in its tendency
to converge prematurely due to its greedy selection method. This probably
leads the harmony search algorithm to get stuck in local optima and unsought solutions
owing to the limited exploration of the search space. The great deluge algorithm
is a local search-based approach that has an efficient capability of increasing
diversity and avoiding the local optima. This capability comes from its flexible
method of accepting the new constructed solution. The aim of this research is to
propose and evaluate a new variant of HS. To do so, the acceptance method of the
great deluge algorithm is incorporated in the harmony search to enhance its convergence
properties by maintaining a higher rate of diversification at the initial stage of
the search process. The proposed method is called Harmony Search Great Deluge
(HS-GD) algorithm. The performance of HS-GD and the classical harmony search
algorithm was evaluated using a set of ten benchmark global optimization functions.
In addition, five benchmark functions of the former set were employed to compare
the results of the proposed method with three previous harmony search variations
including the classical harmony search. The results show that HS-GD often outperforms
the other comparative approaches.
Research Interests:
... The UCTP of MN was discussed by Rossi-Doria et al.[17] as the problem of assigning given events to suitable rooms and timeslots according to hard and soft constraints. This problem includes three hard constraints and three soft... more
... The UCTP of MN was discussed by Rossi-Doria et al.[17] as the problem of assigning given events to suitable rooms and timeslots according to hard and soft constraints. This problem includes three hard constraints and three soft constraints as follows: H1. ...
Research Interests:
ABSTRACT Genetic algorithm (GA) is a heuristic search technique that draws inspiration from principles and mechanisms of natural selection. Conventionally, parents selection takes place at every generation and offspring are reproduced... more
ABSTRACT Genetic algorithm (GA) is a heuristic search technique that draws inspiration from principles and mechanisms of natural selection. Conventionally, parents selection takes place at every generation and offspring are reproduced through genetic operators like crossover and mutation. The process reiterates until some termination conditions are met. Until recently, little attention has been paid on the enduring relationship between parent solutions. In this paper, we take on and further extend the idea of monogamous genetic algorithm to solving real-coded numerical optimization problems. In this GA model, each monogamous pair of parents yields two offspring, and only the best two offspring survive into the next generation. Occasional infidelity generates variety and promotes diversity in the population. Simulation results over the IEEE-CEC’13 (IEEE Congress on Evolutionary Computation 2013) contest for real parameter single objective optimization with 28 benchmark functions demonstrate the effectiveness of the proposed approach.
Research Interests:
ABSTRACT Genetic algorithm (GA) is a heuristic search technique that draws inspiration from principles and mechanisms of natural selection. Conventionally, parents selection takes place at every generation and offspring are reproduced... more
ABSTRACT Genetic algorithm (GA) is a heuristic search technique that draws inspiration from principles and mechanisms of natural selection. Conventionally, parents selection takes place at every generation and offspring are reproduced through genetic operators like crossover and mutation. The process reiterates until some termination conditions are met. Until recently, little attention has been paid on the enduring relationship between parent solutions. In this paper, we take on and further extend the idea of monogamous genetic algorithm to solving real-coded numerical optimization problems. In this GA model, each monogamous pair of parents yields two offspring, and only the best two offspring survive into the next generation. Occasional infidelity generates variety and promotes diversity in the population. Simulation results over the IEEE-CEC’13 (IEEE Congress on Evolutionary Computation 2013) contest for real parameter single objective optimization with 28 benchmark functions demonstrate the effectiveness of the proposed approach.
Research Interests:
... The UCTP of MN was discussed by Rossi-Doria et al.[17] as the problem of assigning given events to suitable rooms and timeslots according to hard and soft constraints. This problem includes three hard constraints and three soft... more
... The UCTP of MN was discussed by Rossi-Doria et al.[17] as the problem of assigning given events to suitable rooms and timeslots according to hard and soft constraints. This problem includes three hard constraints and three soft constraints as follows: H1. ...
Research Interests:
... Mohammed Azmi Al-Betar, Ahamad Tajudin Khader, and Farhad Nadi School of Computer Sciences, Universiti Sains Malaysia, 11800 USM Penang, Malaysia mohbetar@cs.usm.my, tajudin@cs.usm.my, fn.com07@student.usm.my ...
Research Interests:
... Mohammed Azmi Al-Betar, Ahamad Tajudin Khader, and Farhad Nadi School of Computer Sciences, Universiti Sains Malaysia, 11800 USM Penang, Malaysia mohbetar@cs.usm.my, tajudin@cs.usm.my, fn.com07@student.usm.my ...
Research Interests:
... Mohammed Azmi Al-Betar, Ahamad Tajudin Khader, and Farhad Nadi School of Computer Sciences, Universiti Sains Malaysia, 11800 USM Penang, Malaysia mohbetar@cs.usm.my, tajudin@cs.usm.my, fn.com07@student.usm.my ...
Research Interests:
... 4. CONCLUSIONS A new methodology is proposed that utilize harmony search for adaptive parameter controlling in GA. The proposed method di-rects the search based on a predefined strategy referred to as de-sired state. ... IEEE, 2007.... more
... 4. CONCLUSIONS A new methodology is proposed that utilize harmony search for adaptive parameter controlling in GA. The proposed method di-rects the search based on a predefined strategy referred to as de-sired state. ... IEEE, 2007. [2] A. Eiben, M. Schut, and A. de Wilde. ...
Research Interests:
... 4. CONCLUSIONS A new methodology is proposed that utilize harmony search for adaptive parameter controlling in GA. The proposed method di-rects the search based on a predefined strategy referred to as de-sired state. ... IEEE, 2007.... more
... 4. CONCLUSIONS A new methodology is proposed that utilize harmony search for adaptive parameter controlling in GA. The proposed method di-rects the search based on a predefined strategy referred to as de-sired state. ... IEEE, 2007. [2] A. Eiben, M. Schut, and A. de Wilde. ...
Research Interests:
... 4. CONCLUSIONS A new methodology is proposed that utilize harmony search for adaptive parameter controlling in GA. The proposed method di-rects the search based on a predefined strategy referred to as de-sired state. ... IEEE, 2007.... more
... 4. CONCLUSIONS A new methodology is proposed that utilize harmony search for adaptive parameter controlling in GA. The proposed method di-rects the search based on a predefined strategy referred to as de-sired state. ... IEEE, 2007. [2] A. Eiben, M. Schut, and A. de Wilde. ...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests: Applied Mathematics, Algorithms, Artificial Intelligence, Biomedical Engineering, Fuzzy Logic, and 13 moreGenetic Algorithms, Genetic Algorithm, Software, Humans, Computer Systems, Female, adaptive neuro fuzzy inference system (ANFIS), Cell nucleus, Reproducibility of Results, Cytoplasm, Microstrip Line, Region of Interest, and Automatic data processing
Research Interests: Applied Mathematics, Algorithms, Artificial Intelligence, Biomedical Engineering, Fuzzy Logic, and 13 moreGenetic Algorithms, Genetic Algorithm, Software, Humans, Computer Systems, Female, adaptive neuro fuzzy inference system (ANFIS), Cell nucleus, Reproducibility of Results, Cytoplasm, Microstrip Line, Region of Interest, and Automatic data processing
Research Interests: Applied Mathematics, Algorithms, Artificial Intelligence, Biomedical Engineering, Fuzzy Logic, and 13 moreGenetic Algorithms, Genetic Algorithm, Software, Humans, Computer Systems, Female, adaptive neuro fuzzy inference system (ANFIS), Cell nucleus, Reproducibility of Results, Cytoplasm, Microstrip Line, Region of Interest, and Automatic data processing
... Mohammed A. Awadallah1, Ahamad Tajudin Khader1, Mohammed Azmi Al-Betar1,2, Asaju La'aro Bolaji1 1 School of Computer Sciences, Universiti Sains Malaysia (USM), 11800, Pulau Pinang, Malaysia. ... If the new... more
... Mohammed A. Awadallah1, Ahamad Tajudin Khader1, Mohammed Azmi Al-Betar1,2, Asaju La'aro Bolaji1 1 School of Computer Sciences, Universiti Sains Malaysia (USM), 11800, Pulau Pinang, Malaysia. ... If the new har-mony vector, x = (x1,x2, ··· ,xN ), is better than the worst ...
Research Interests:
... Mohammed A. Awadallah1, Ahamad Tajudin Khader1, Mohammed Azmi Al-Betar1,2, Asaju La'aro Bolaji1 1 School of Computer Sciences, Universiti Sains Malaysia (USM), 11800, Pulau Pinang, Malaysia. ... If the new... more
... Mohammed A. Awadallah1, Ahamad Tajudin Khader1, Mohammed Azmi Al-Betar1,2, Asaju La'aro Bolaji1 1 School of Computer Sciences, Universiti Sains Malaysia (USM), 11800, Pulau Pinang, Malaysia. ... If the new har-mony vector, x = (x1,x2, ··· ,xN ), is better than the worst ...
Research Interests:
... Mohammed A. Awadallah1, Ahamad Tajudin Khader1, Mohammed Azmi Al-Betar1,2, Asaju La'aro Bolaji1 1 School of Computer Sciences, Universiti Sains Malaysia (USM), 11800, Pulau Pinang, Malaysia. ... If the new... more
... Mohammed A. Awadallah1, Ahamad Tajudin Khader1, Mohammed Azmi Al-Betar1,2, Asaju La'aro Bolaji1 1 School of Computer Sciences, Universiti Sains Malaysia (USM), 11800, Pulau Pinang, Malaysia. ... If the new har-mony vector, x = (x1,x2, ··· ,xN ), is better than the worst ...
Research Interests:
Abstract Accessibility of e-government services is a key issue for people with disabilities. E-government services can significantly save lot of their effort and provide them with lot of easy to reach services. Yet, accessibility of... more
Abstract Accessibility of e-government services is a key issue for people with disabilities. E-government services can significantly save lot of their effort and provide them with lot of easy to reach services. Yet, accessibility of e-government websites is still under-explored topic ...
Research Interests:
Abstract Accessibility of e-government services is a key issue for people with disabilities. E-government services can significantly save lot of their effort and provide them with lot of easy to reach services. Yet, accessibility of... more
Abstract Accessibility of e-government services is a key issue for people with disabilities. E-government services can significantly save lot of their effort and provide them with lot of easy to reach services. Yet, accessibility of e-government websites is still under-explored topic ...
Research Interests:
Abstract Accessibility of e-government services is a key issue for people with disabilities. E-government services can significantly save lot of their effort and provide them with lot of easy to reach services. Yet, accessibility of... more
Abstract Accessibility of e-government services is a key issue for people with disabilities. E-government services can significantly save lot of their effort and provide them with lot of easy to reach services. Yet, accessibility of e-government websites is still under-explored topic ...