Scholarlink

This paper introduces the specified number of nodes travelling salesman problem (SNN-TSP), a variant of the travelling salesman problem. In the SNN-TSP number of nodes to be visited \({\text{P}}\) are specified. The problem is to determine a minimum cost tour that visits specified number of nodes exactly once. This paper provides an integer programming model for the problem. TSP based algorithm is modified to solve the optimally for all values of \({\text{P}}\) . Numerical illustrations have been used to prove that modified TSP bases algorithm can solve SNN-TSP optimally.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Specified Number of Nodes Travelling Salesman Problem

  • 章节

  • 发表日期：

    2025年

查看全文
  • Trust Tawanda,
  • Santosh Kumar,
  • Elias Munapo,
  • Philimon Nyamugure

摘要

This paper introduces the specified number of nodes travelling salesman problem (SNN-TSP), a variant of the travelling salesman problem. In the SNN-TSP number of nodes to be visited \({\text{P}}\) are specified. The problem is to determine a minimum cost tour that visits specified number of nodes exactly once. This paper provides an integer programming model for the problem. TSP based algorithm is modified to solve the optimally for all values of \({\text{P}}\) . Numerical illustrations have been used to prove that modified TSP bases algorithm can solve SNN-TSP optimally.