Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems

• Published in: IEEE transactions on cybernetics Vol. 47; no. 7; pp. 1743 - 1756
• Main Authors: Mavrovouniotis, Michalis, Muller, Felipe M., Shengxiang Yang
• Format: Journal Article
• Language: English
• Published: United States IEEE 01.07.2017; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Ant colony optimization; Ant colony optimization (ACO); Benchmark testing; dynamic traveling salesman problem (DTSP); Generators; Heuristic algorithms; Inserts; local search; memetic algorithm; Memetics; Performance enhancement; Searching; State of the art; Travel time; Traveling salesman problem; Traveling salesman problems; Urban areas

For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms have proved to be powerful methods to tackle such problems due to their adaptation capabilities. It has been shown that...