loading page

Solve traveling salesman problem using EMF-CE algorithm
  • Meng Luo ,
  • Shiliang Gu
Meng Luo
Yangzhou University, Yangzhou University

Corresponding Author:[email protected]

Author Profile
Shiliang Gu
Author Profile

Abstract

In this paper, a novel search algorithm that based on the Contraction-Expansion algorithm and integrated three operators Exchange, Move, and Flip (EMF-CE) is proposed for the traveling salesman problem (TSP). EMF-CE uses a negative exponent function to generate critical value as the feedback regulation of algorithm implementation. Also, combined Exchange Step, Move step with Flip step and constitute of more than twenty combinatorial optimizations of program elements. It has been shown that the integration of local search operators can significantly improve the performance of EMF-CE for TSPs. We test small and medium scale (51-1000 cities) TSPs were taken from the TSPLIB online library. The experimental results show the efficiency of the proposed EMF-CE for addressing TSPs compared to other state-of-the-art algorithms.