https://github.com/czheluo/emf-ce

Solve traveling salesman problem using EMF-CE algorithm
https://github.com/czheluo/emf-ce

Last synced: 2 months ago
JSON representation

Solve traveling salesman problem using EMF-CE algorithm

• Host: GitHub
• URL: https://github.com/czheluo/emf-ce
• Owner: czheluo
• Created: 2020-10-24T15:42:16.000Z (over 4 years ago)
• Default Branch: main
• Last Pushed: 2021-04-04T10:58:07.000Z (about 4 years ago)
• Last Synced: 2025-01-19T17:34:29.478Z (4 months ago)
• Language: MATLAB
• Size: 3.16 MB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# EMF-CE

> here, a novel search algorithm that based on 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 optimization 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 in comparison with other state-of-the-art algorithms.

### demo

```matlab

# only run once

$ EMFCE('../pr124.tsp','diary.txt',59030)

# run 10 times

$EMFCE('../pr124.tsp','diary.txt',59030,10)

```

### Figs

- KROA100.tsp

![KROA100.tsp](Fig/KROA100.bmp)

- XQF131.tsp

![XQF131](Fig/XQF131.bmp)

- d198.tsp

![d198](Fig/d198.bmp)

- pa561.tsp

![KROA100.tsp](Fig/pa561.jpg)

### citation

> Luo, Meng; Gu, Shiliang (2020): Solve traveling salesman problem using EMF-CE algorithm. TechRxiv. Preprint. https://doi.org/10.36227/techrxiv.13139042.v2