A Modification of Shortest Path Algorithm According to Adjustable Weights Based on Dijkstra Algorithm
A Modification of Shortest Path Algorithm According to Adjustable Weights Based on Dijkstra Algorithm

Luay S. Jabbar; Eyad I. Abass; Sundus D. Hasan

Volume 41, Issue 2 , February 2023, , Page 359-374

https://doi.org/10.30684/etj.2022.136107.1296

Abstract
  It is possible to represent the road map on the paper and study it using Dijkstra`s algorithm to find the shortest path on the real earth. Dijkstra`s Algorithms are used for calculating ...  Read More ...
Hybrid Metaheuristic Technique Based Tabu Search and Simulated Annealing
Hybrid Metaheuristic Technique Based Tabu Search and Simulated Annealing

I. A. AbdulJabbar; S. M. Abdullah

Volume 35, 2B , February 2017, , Page 154-160

https://doi.org/10.30684/etj.2017.138652

Abstract
  This paper presents hybrid technique using two metahueristic methods; which are simulated annealing (SA) and tabu search (TS). The aim is to exhibit the facility of adaptive memory ...  Read More ...
Developing Backtracking Algorithm to Find the Optimal Solution Path
Developing Backtracking Algorithm to Find the Optimal Solution Path

Suhad M. Kadhum; Israa A. Abdul-Jabbar

Volume 28, Issue 24 , December 2010, , Page 6995-7003

https://doi.org/10.30684/etj.28.24.13

Abstract
  There are numerous search methods in A.I used to find the solution path to a subjected problem, but many of them return one solution path with no consider it is the optimal or not. ...  Read More ...