z-logo
open-access-imgOpen Access
Travelling Salesman Problem Generalized Interval Arithmetic
Author(s) -
Priya Dharshini. A
Publication year - 2021
Publication title -
international journal for research in applied science and engineering technology
Language(s) - English
Resource type - Journals
ISSN - 2321-9653
DOI - 10.22214/ijraset.2021.39448
Subject(s) - travelling salesman problem , interval (graph theory) , range (aeronautics) , mathematics , extension (predicate logic) , lin–kernighan heuristic , mathematical optimization , bottleneck traveling salesman problem , computer science , combinatorics , engineering , programming language , aerospace engineering
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. Keywords: Fuzzy sets, Arithmetic operation on interval, least common method, travelling salesman problem.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here