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

Podrobná bibliografia

Vydané v:	Expert systems with applications Ročník 221; s. 119765
Hlavní autori:	Zhang, Tian, Zhou, Yongquan, Zhou, Guo, Deng, Wu, Luo, Qifang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.07.2023
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!