Results 11 to 20 of about 30,647 (208)
An effective method for solving multiple travelling salesman problem based on NSGA-II
Systems Science & Control Engineering, 2019 In this paper, an effective multi-objective evolutionary algorithm is proposed to solve the multiple travelling salesman problem. In order to obtain minimum total visited distance and minimum range between all salesmen, some novel representation ...
Yang Shuai, Shao Yunfeng, Zhang Kai
doaj +2 more sources
Novel Heuristic for New Pentagonal Neutrosophic Travelling Salesman Problem [PDF]
Neutrosophic Sets and Systems, 2022 This paper presents a new variant of Travelling Salesman Problem (TSP) and its first resolution. In literature there is not any research work that has presented the TSP under pentagonal fuzzy neutrosophic environment yet.
Souhail Dhouib
doaj +1 more source
Traveling salesman path problems [PDF]
Mathematical Programming, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lam, F., Newman, A.
openaire +3 more sources
Optimization of Single-valued Triangular Neutrosophic Fuzzy Travelling Salesman Problem [PDF]
Neutrosophic Sets and Systems, 2023 The travelling salesman problem(TSP) is a classic optimization puzzle, widely studied and celebrated for its significance in operations research, mathematics and computer science.
Subadhra Srinivas, K. Prabakaran
doaj +1 more source
An ant colony genetic fusion routing algorithm based on soft define network
IET Networks, EarlyView., 2022 Abstract Aiming at the problem that there are many paths in data forwarding in soft define network (SDN) network, and the optimal path is difficult to find, combined with the advantages of ant colony algorithm and Genetic algorithm (GA), a routing control strategy based on the ant colony genetic fusion algorithm is proposed.
Kaixin Zhao, Yong Wei, Yang Zhang
wiley +1 more source
IET Networks, EarlyView., 2022 Abstract Everything can be connected in the Internet of Things (IoTs) technology that enables efficient communication between connected objects. IoTs industry‐based meta‐heuristic and mining algorithms, which are considered an important field of Artificial Intelligence will be used to construct a healthcare application in this study for lowering costs,
Muhaned Al‐Hashimi +4 more
wiley +1 more source
A Labelling Method for the Travelling Salesman Problem
Applied Sciences, 2023 The travelling salesman problem (TSP) is a problem whereby a finite number of nodes are supposed to be visited exactly once, one after the other, in such a way that the total weight of connecting arcs used to visit these nodes is minimized.
Trust Tawanda +3 more
doaj +1 more source
Application and assessment of divide-and-conquer-based heuristic algorithms for some integer optimization problems [PDF]
Yugoslav Journal of Operations Research, 2023 In this paper three heuristic algorithms using the Divide-and-Conquer paradigm are developed and assessed for three integer optimizations problems: Multidimensional Knapsack Problem (d-KP), Bin Packing Problem (BPP) and Travelling Salesman Problem (TSP).
Morales Fernando A.
doaj +1 more source
An open close multiple travelling salesman problem with single depot [PDF]
Decision Science Letters, 2019 This paper introduces a novel practical variant, namely an open close multiple travelling salesmen problem with single depot (OCMTSP) that concerns the generalization of classical travelling salesman problem (TSP).
Jayanth Kumar Thenepalle +1 more
doaj +1 more source
Colored Traveling Salesman Problem
IEEE Transactions on Cybernetics, 2015 The multiple traveling salesman problem (MTSP) is an important combinatorial optimization problem. It has been widely and successfully applied to the practical cases in which multiple traveling individuals (salesmen) share the common workspace (city set).
Jun, Li +4 more
openaire +2 more sources