it is well known that computing minimum cost in network transmission is an important task in many network and transportation related analyses. Improving an algorithm that finds optimal path on which data can be sent is so necessary because of not only the reducing of network traffic but also increasing performance over a network. In a recent study, several algorithms have been introduced as important algorithm for this problem. These algorithms are: 1- the graph growth algorithm implemented with two queues, 2- the Dijkstra algorithm implemented with approximate buckets, 3- genetic algorithm by defining chromosomes as solutions, 4- PSO and anneal simulation. In this research new method based on the eurygaster life is used to find minimum cost of network transmissions. This paper will be appropriate for researchers and practitioners in transportation, GIS, operations research and management sciences.
