ویراساینس.
سند علمی

Fuzzy Random Traveling Salesman Problem

Yiwen Lu, Yaodong Ni

چکیده

The travelling salesman problem is to find a shortest path from the travelling salesman’s hometown, make the round of all the towns in the set, and finally go back home. This paper investigates the travelling salesman problem with fuzzy random travelling time. Three concepts are proposed: expected shortest path, (α, β)-path and chance shortest path according to different optimal desire. Correspondingly, by using the concepts as decision criteria, three fuzzy random programming models for TSP are presented. Finally, a hybrid intelligent algorithm is designed to solve these models, and some numerical examples are provided to illustrate its effectiveness.

اسناد مشابه

  • Assignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters

    سند علمی۲۰۱۲Amit Kumar, Anila Gupta

    Abstract: Mukherjee and Basu (Application of fuzzy ranking method for solving assignment problems with fuzzy costs, International Journal of Computational and Applied Mathematics, 5, 2010, 359-368) proposed a new method for solving fuzzy assignment problems. In this paper, some f

  • Eugenic Bacterial Memetic Algorithm for Fuzzy Road Transport Traveling Salesman Problem

    سند علمی۲۰۱۱Péter Földesi, János Botzheim, László T. Kóczy

    The aim of the Traveling Salesman Problem (TSP) is to find the cheapest way of visiting all elements in a given set of cities (nodes) exactly once and returning to the starting point. In solutions presented in the literature costs of travel between nodes are based on Euclidean di

  • Solving traveling salesman problem by using a fuzzy multi-objective linear programming

    سند علمی۲۰۱۱Sepideh Fereidouni

    The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. Information about real life systems is often available in the form of vague descriptions. Hence, fuzzy methods are designed to handle vague terms, and are most suite

  • A Fuzzy Hopfield-Tank Traveling Salesman Problem Model

    سند علمی۱۹۹۹INFORMS Journal on ComputingWilliam J. Wolfe

    This article describes a Hopfield-Tank model of the Euclidean traveling salesman problem (using Aiyer’s subspace approach) that incorporates a “fuzzy” interpretation of the rows of the activation array. This fuzzy approach is used to explain the network’s behavior. The fuzzy inte

  • Greedy Randomized Adaptive Search Procedure for Traveling Salesman Problem

    سند علمی۲۰۰۵SEUNG HO LEE, Sergiy Butenko, Illya V. Hicks, Mahmoud M. El-Halwagi

    Greedy Randomized Adaptive Search Procedure for Traveling Salesman Problem. (May 2005) Seung Ho Lee, B.E., Korea University Chair of Advisory Committee: Dr. Sergiy Butenko In this thesis we use greedy randomize adaptive search procedure (GRASP) to solve the traveling salesman pro

  • Provably good solutions for the traveling salesman problem

    سند علمی۱۹۹۴Math. Meth. of ORMichael Jünger, Stefan Thienel, Gerhard Reinelt

    The determination of true optimum solutions of combinatorial optimization problems is seldomly required in practical applications. The majority of users of optimization software would be satis ed with solutions of guaranteed quality in the sense that it can be proven that the giv