A Mobile Agent (MA) is a bunch of program and information that can independently move starting with one Personal Computer (PC) then onto the next and start its execution on the new PC. In fact, the mobile agent is a portable code/object that movements through an organization of associated nodes on its own timetable. In this thesis, the most ideal way in irrelevant time is found by migrating the Mobile Agent from the source node to the objective node using the mathematical methodology and streamlining procedure. This work centers on how to locate the best way using the Hybrid design pattern and the Dijkstra Optimization Algorithm (DOA) with the Java Agent Development Framework (JADE). After figuring out the best path, the path will be compared with those of similar works that different in design patterns and algorithms. When comparing the algorithms with each other, time is considered an essential measure for selecting the best path when using the proposed approach the time of selecting the best path is 233.634 sec, After figuring out the best path, the path will be compared with those of similar works that used the master-slave design pattern with the Genetic Algorithm (GA) and also that used the Node Compression Algorithm (NCA) and also that used the Ant Colony Optimization (ACO) algorithm. Keywords: Mobile Agent, Dijkstra Optimization Algorithm, Hybrid Design Pattern.