Discrete Mayfly Algorithm for spherical asymmetric traveling salesman problem

The Asymmetric Traveling Salesman Problem (ATSP), as a branch of the traveling salesman problem, aims to find a group of circuits when a salesman travels all cities at the minimum cost and returns to the starting city under the condition of different round-trip costs between the two cities. Mayfly A...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Expert systems with applications Ročník 221; s. 119765
Hlavní autoři: Zhang, Tian, Zhou, Yongquan, Zhou, Guo, Deng, Wu, Luo, Qifang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.07.2023
Témata:
3-opt operator
Inver-over operator
Mayfly algorithm
Metaheuristic
Spherical ATSP
3-opt operator
Mayfly algorithm
Inver-over operator
Metaheuristic
Spherical ATSP
ISSN:0957-4174, 1873-6793
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Asymmetric Traveling Salesman Problem (ATSP), as a branch of the traveling salesman problem, aims to find a group of circuits when a salesman travels all cities at the minimum cost and returns to the starting city under the condition of different round-trip costs between the two cities. Mayfly Algorithm (MA) is a swarm-based metaheuristic algorithm, which has been applied to many fields successfully. In this paper, we arrange all cities on the sphere. A Discrete Mayfly Algorithm (DMA) for solving spherical asymmetric traveling salesman problem is proposed. The algorithm applies inver-over operator, crossover operator and 3-opt operator to simplify the parameters of the algorithm, enrich the diversity of the population and enhance the local search ability. By experimenting, analyzing and comparing the effects of DMA and other metaheuristic algorithms in twelve scales, this study proves that the proposed algorithm is superior to others for the spherical ATSP, especially in high-dimensional cases.
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2023.119765