The Time Dependent Traveling Salesman Problem (TDTSP) that is addressed in this paper is a variant of the well-known Traveling Salesman Problem. In this problem the distances between nodes vary in time (are longer in rush hours in the city centre), Our Discrete Bacterial Evolutionary Algorithm (DBMEA) was tested on benchmark problems (on bier127 and on a self-generated problem with 250 nodes) with various jam factors. The results demonstrate the effectiveness of the algorithm.