Discrete sparrow search algorithm for symmetric traveling salesman problem

The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. This paper proposes a swarm intelligence approach using a discrete sparrow search algorithm (DSSA) with a global perturbation strategy to solve the problem. Firstly, the initial solutio...

Full description

Saved in:
Bibliographic Details
Published in:Applied soft computing Vol. 118; p. 108469
Main Authors: Zhang, Zhen, Han, Yang
Format: Journal Article
Language:English
Published: Elsevier B.V 01.03.2022
Subjects:
ISSN:1568-4946, 1872-9681
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first