Enhanced discrete bacterial memetic evolutionary algorithm - An efficacious metaheuristic for the traveling salesman optimization

摘要

In this paper we present a novel universal metaheuristic, Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA), which is based on the combination of the Bacterial Evolutionary Algorithm and local search techniques, used for solving NP-hard optimization problems. The algorithm was tested on a series of symmetric Traveling Salesman Problems (TSP) and Traveling Salesman Problem with time windows (TSPTW) benchmarks.