SEARCHING OF OPTIMAL VERTICES IN A HAPHAZARD ROUTES

Authors

  • N. Khan
  • F. H. Khan
  • S. Inayat Ullah

Keywords:

salesman problem, Optimal salesman problem

Abstract

In this paper we are going to develop a new and efficient algorithm for finding a shortest cyclic tour of the network with the repetition of each vertex at least once. Problem under consideration is a traveling salesman problem, for repeating vertex. Penalizing the distance and choosing the shortest tour has been achieved from the weighted matrix of the graph

Downloads

Published

2008-12-15

How to Cite

N. Khan, F. H. Khan, & S. Inayat Ullah. (2008). SEARCHING OF OPTIMAL VERTICES IN A HAPHAZARD ROUTES. Sindh University Research Journal - SURJ (Science Series), 40(2). Retrieved from https://sujo.usindh.edu.pk/index.php/SURJ/article/view/6474

Issue

Vol. 40 No. 2 (2008): Sindh University Research Journal (Science Series) SURJ

Section

Articles