A Survey of Two Optimization Methods to Solve a Modified Minimal Spanning Tree Problem in Undirected Tree Graph

Alkallak, Isra Natheer; Sha’ban, Ruqaya

doi:10.33899/csmj.2011.163613

Cited by 2 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The simulated annealing is a global heuristic technique, that aims to avoid falling into local optimal by accepting unwanted results when specific function conditions are satisfied. Alkallak & Sha'ban succeeded in producing several possible solutions through the Spanning tree problem algorithm with simulated annealing in an undirected tree graph [17]. However, the Cuckoo search algorithm is inspired by meta-heuristic to solve other problems of combinatorial optimization as the N-Queens problem via Alkallak's proposed hybridization algorithm [18,19].…”

Section: Artificial Intelligence With Meta-heuristicmentioning

confidence: 99%

See 1 more Smart Citation

Organizing sports matches with a hybrid monkey search algorithm

Sha’ban

Alkallak

2021

IJEECS

View full text Add to dashboard Cite

This academic piece of the paper illustrates an approach of organizing sports matches to be as a tool of sports schedule maker via a proposed hybrid Monkey search algorithm by doubles elimination tournament. Input are a set of teams represented by monkeys. It states that the natural behavior of monkeys and its climbing to obtain (solution) through uphill (climbing), watch-jumping, and somersault process. The parameters in the climb were represented by whether or not sports team won. The distribution of the teams, whether in the upper or the lower half, represented in the watch-jumping by mathematical equations, in addition to representing the variables in somersault process. The consequences behind the suggested algorithm used have tackled steps to reach an optimal schedule for a variety of teams for the same championship. The team cannot play more than two consecutive matches with the condition of starting with a random population of feasible solutions. The performance of the presented algorithm was very well through providing a flexible and easy organization of sports matches without using classic or manual routine. Furthermore, the search space reduced so that can give a guarantee to achieve a globally optimum solution. The software platform was MATLAB m-files.

show abstract

Section: Artificial Intelligence With Meta-heuristicmentioning

confidence: 99%

“…Step length or parameter = 6. For Monkey1 (team1) the positions may be one of these positions ( 11,12,13,14,15,16,17). each monkey (team) had 7 positions.…”

Section: Part I Initializationmentioning

confidence: 99%

Organizing sports matches with a hybrid monkey search algorithm

Sha’ban

Alkallak

2021

IJEECS

View full text Add to dashboard Cite

show abstract

“…There are several methods to estimate the desirability depending on the problem. In 2011, Alkallak and Sha'ban [2] do not include the heuristic information because the ants movement in some deterministic way and they visit all edges in the search space depending on the constraints of the problem. Also, in this paper, the proposed algorithm is used without heuristic information.…”

Section: -1 Pheromone Updatementioning

confidence: 99%

Applying the Intelligence of Ant and Tabu Search to Solve The 8-puzzle Problem

Sha’ban¹

2013

AL-Rafidain Journal of Computer Sciences and Mathematics

Self Cite

View full text Add to dashboard Cite

The research tackled artificial intelligent methods to solve one of the optimization problems by using artificial ant by applying ant colony optimization algorithm and also tabu search algorithm to find the solution of sliding tile 8-puzzel problem. In ant colony algorithm generated many possible solutions depending on finding the difference tiles in initial state from the goal and moving accordingly in the current state of the problem. In Tabu search, many possible solutions have been generated according to the replacement relation between different tiles in initial state to find the optimal solution from many solutions. In this research, the experimental show is very speed to obtain the goal. The source code is written in MATLAB language to simulate these two algorithms.

show abstract

A Survey of Two Optimization Methods to Solve a Modified Minimal Spanning Tree Problem in Undirected Tree Graph

Cited by 2 publications

References 11 publications

Organizing sports matches with a hybrid monkey search algorithm

Organizing sports matches with a hybrid monkey search algorithm

Applying the Intelligence of Ant and Tabu Search to Solve The 8-puzzle Problem

Contact Info

Product

Resources

About