The computer systems have evolved from a monolithic computer device to a much more complex client- server environment in previous years. One of those newly developed technology is the mobile agent. Because of its innovative capabilities and attractive application, mobile agents have long captured the attention of researchers and industry. Mobile agents are computer program that can automatically migrate from host to host, transfer their internal state, enable them to perform task more conveniently, more robustly and more efficiently than traditional client- server application in network and distributed environments. In this work, best path in minimal time is found by migrating the mobile agent from the source node to the destination node using mathematical process and optimization technique. Genetic Algorithm is used to overcome the problem of selecting the best path rather than shortest path that is used in previous work. Shortest path is not mean optimal path in all time. This work focuses on how to minimize the number of nodes that are used to transfer data from source to destination using combining the sequential nodes from time point view using Node Compression Algorithm (NCA). When comparing adaptive algorithms with each other, time is considered as essential measures for selecting best path(minimum time). Using time measurement after 10 optimization iterations as minimum and holding to the result. The proposed approach shows that using hybrid approaches GA and NCA reduce the time of selecting the best path using GA from 336.448 ms to 286.29 ms for 10th iteration and reduce the time in other iterations as well. This results show the importance of using optimization techniques in cloud computing to help of overcome the distributed nature and minimize the time of transferring data within minimum time complexity. Keywords: Mobile Agent, Genetic algorithm, Push-All-Data Strategy, Design Pattern (Master-Slave), Node Compression Algorithm.