Bacterial memetic algorithms are widely used on discrete combinatorial problems, which are essential in the field of logistics and forwarding, such as the well known Traveling Salesman Problem. The original Bacterial Evolutionary Algorithm proposed by Nawa and Furuhashi [5] has a predefined set of operators such as bacterial mutation and gene transfer also known as infection. The traditional bacterial infection operator is proven to be far from optimal. The authors suggest an alternative gene transfer operator that is applied on the metric Traveling Salesman Problem [9]. This alternative infection algorithm has superior rate of convergence while reducing the risk of getting stuck in a local optima.