• Home
  • Submit Paper
  • Check Paper Status
  • Download Certificate/Paper
  • FAQs
  • Feedback
  • Contact Us
Email: ijraset@gmail.com
IJRASET Logo
Journal Statistics & Approval Details
Recent Published Paper
Our Author's Feedback
 •  ISRA Impact Factor 7.894       •  SJIF Impact Factor: 7.538       •  Hard Copy of Certificates to All Authors       •  DOI by Crossref for all Published Papers       •  Soft Copy of Certificates- Within 04 Hours       •  Authors helpline No: +91-8813907089(Whatsapp)       •  No Publication Fee for Paper Submission       •  Hard Copy of Certificates to all Authors       •  UGC Approved Journal: IJRASET- Click here to Check     
  • About Us
    • About Us
    • Aim & Scope
  • Editorial Board
  • Impact Factor
  • Call For Papers
    • Submit Paper Online
    • Current Issue
    • Special Issue
  • For Authors
    • Instructions for Authors
    • Submit Paper
    • Download Certificates
    • Check Paper Status
    • Paper Format
    • Copyright Form
    • Membership
    • Peer Review
  • Past Issue
    • Monthly Issue
    • Special Issue
  • Pay Fee
    • Indian Authors
    • International Authors
  • Topics
ISSN: 2321-9653
Estd : 2013
IJRASET - Logo
  • Home
  • About Us
    • About Us
    • Aim & Scope
  • Editorial Board
  • Impact Factor
  • Call For Papers
    • Submit Paper Online
    • Current Issue
    • Special Issue
  • For Authors
    • Instructions for Authors
    • Submit Paper
    • Download Certificates
    • Check Paper Status
    • Paper Format
    • Copyright Form
    • Membership
    • Peer Review
  • Past Issue
    • Monthly Issue
    • Special Issue
  • Pay Fee
    • Indian Authors
    • International Authors
  • Topics

Ijraset Journal For Research in Applied Science and Engineering Technology

  • Home / Ijraset
  • On This Page
  • Abstract
  • Introduction
  • Conclusion
  • References
  • Copyright

Travelling Salesman Problem Generalized Interval Arithmetic

Authors: Priya Dharshini. A, Devi Abirami. P

DOI Link: https://doi.org/10.22214/ijraset.2021.39448

Certificate: View Certificate

Abstract

The travelling salesman problem is one of the famous combinatorial optimization problem and has been intensively studied in the last decades. We present a new extension of the basics problem, where travel times are specified as a range of possible values.

Introduction

I. INTRODUCTION

Given the cost of travel between each pair of a finite number of cities, the travelling salesman problem (TSP) is to find the cheapest  tour passing through all  of the cities and returning to the point of departure. Here we investigate a more realistic problem ,namely interval –valued fuzzy travelling salesman problem & restriction in assignment problem using new arithmetic operations and proposed a new method which was verified by means of numerical examples.

II. FUZZY SETS

Fuzzy sets is fully defined by its membership functions. Member function is a function in [0,1] that represents the degree of belonging.

Example: Words like young ,tall, good, or high are fuzzy.

III. ARITHMETIC OPERATION ON INTERVAL

Arithmetic operation is a branch of mathematics ,that involves the study of numbers, operation of numbers that are useful in all the other branches of mathematics.

It basically comprises operations such as ADDITION, SUBTRACTION, MULTIPLICATION and DIVISION.

  ADDITION :A (+) B

IV. LEAST COMMON METHOD

The least common multiple of two numbers is the “smallest non zero common number ”Which is a multiple of both the numbers. The different methods to find least common multiple of 2 or more numbers are :

Using Prime fraction and using repeated Function

Example LCM of 4 and 6 is 12.                                    

V. TRAVELLING SALES MAN PROBLEM

A Territory with several terms linked with reads. The job is to visit each town exactly once so that the total distance travelled is minimum.

  • Can be solved by listing all possible hamiltion circuit and then selecting the one with minimum cost
  • For completing Graph with n vertices Hamilton circuit 

Travelling Salesman problem can be solved in two different ways. They are

  • Nearest Neighbor Algorithm
  • The Closet Insection Algorithm

A. Nearest Neighbor Algorithm

Start from any random point

B. Closed Insection Algorithm

Start with a cycle and keeps adding more and more vertices to the cycle until all the vertices are added.

Conclusion

In this paper, a new approach to solve the travelling salesman problem, It depands very much on the way the problem is encoded and which crossover and mutation methods are used . Better quality of solution and cost as well as solution times.

References

[1] Amitkumar and Anil gupta2012 assignment and travelling salesman problem with coefficient as LR fuzzy parameter ,international journal of applied science and engineering ,10(3) pp 155-170. [2] Chaudhuri A and de K 2011 fuzzy multi objective linear programming for travelling salesman problem , Afr.J.math.compsci , Res., 4(2)pp64-70. [3] H.W .Kuhn, the Hungarian method for the assignment problem ,Navel Research logistics Quarterly,2(1995),83-97. [4] M.S.Hung , W.O.Rom, solving the assignment problem by relaxation, oper.Res.,28(1980),969-982. [5] Zadeh .L.A. fuzzy sets ,information &control ,8,338-353(1965).

Copyright

Copyright © 2022 Priya Dharshini. A, Devi Abirami. P. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Download Paper

Authors : Priya Dharshini.A

Paper Id : IJRASET39448

Publish Date : 2021-12-15

ISSN : 2321-9653

Publisher Name : IJRASET

DOI Link : Click Here

About Us

International Journal for Research in Applied Science and Engineering Technology (IJRASET) is an international peer reviewed, online journal published for the enhancement of research in various disciplines of Applied Science & Engineering Technologies.

Quick links
  • Privacy Policy
  • Refund & Cancellation Policy
  • Shipping Policy
  • Terms & Conditions
Quick links
  • Home
  • About us
  • Editorial Board
  • Impact Factor
  • Submit Paper
  • Current Issue
  • Special Issue
  • Pay Fee
  • Topics
Journals for publication of research paper | Research paper publishers | Paper publication sites | Best journal to publish research paper | Research paper publication sites | Journals for paper publication | Best international journal for paper publication | Best journals to publish papers in India | Journal paper publishing sites | International journal to publish research paper | Online paper publishing journal

© 2022, International Journal for Research in Applied Science and Engineering Technology All rights reserved. | Designed by EVG Software Solutions