Two multi-start heuristics for the k-traveling salesman problem

Venkatesh Pandiri () and Alok Singh ()
Additional contact information
Venkatesh Pandiri: University of Hyderabad
Alok Singh: University of Hyderabad

OPSEARCH, 2020, vol. 57, issue 4, No 6, 1164-1204

Abstract: Abstract This paper is concerned with the k-traveling salesman problem (k-TSP), which is a variation of widely studied traveling salesman problem (TSP). Given a set of n cities including a home city and a fixed value k such that $$1

Keywords: k-traveling salesman problem; Traveling salesman problem; General variable neighborhood search; Hyper-heuristic; Heuristic (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s12597-020-00463-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:57:y:2020:i:4:d:10.1007_s12597-020-00463-8

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-020-00463-8

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().