To find the solution and predict model for logistics by Traveling Salesman problem using graceful labeling and nearest neighbor algorithm

Authors

  • Priyanka Bhalerao
  • Dr. Seema Bagora

Abstract

This research work deals with the travelling salesman problem using graceful labeling of k-ary trees. The aim of this research is to obtain the best possible route or the cheapest possible route to be taken during the distribution of product or work. This research presents an attempt to solve the problem of logistic companies having many regional offices and area office in different areas. We find solutions using TSP to obtain the information or data from regional offices and area offices with the best possible way of visiting all the offices and returning to the starting point that minimize the travel cost or travel distance. Here we use the nearest neighbor method of TSP to solve this problem.

Downloads

Published

2020-02-05

Issue

Section

Articles