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...

Full description

Bibliographic Details

Published in:	Expert systems with applications Vol. 221; p. 119765
Main Authors:	Zhang, Tian, Zhou, Yongquan, Zhou, Guo, Deng, Wu, Luo, Qifang
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.07.2023
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!