Results 11 to 20 of about 108,421 (273)
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
Solving the clustered traveling salesman problem via traveling salesman problem methods
PeerJ Computer Science, 2022 The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications. In this work, we explore a transformation approach that solves the CTSP by converting it to the well-studied TSP. For this purpose, we first investigate a technique to convert a CTSP instance to a
Lu, Yongliang, Hao, Jin-Kao, Wu, Qinghua
openaire +3 more sources
Generalization of machine learning for problem reduction: a case study on travelling salesman problems [PDF]
OR spectrum, 2020 Combinatorial optimization plays an important role in real-world problem solving. In the big data era, the dimensionality of a combinatorial optimization problem is usually very large, which poses a significant challenge to existing solution methods.
Yuan Sun +3 more
semanticscholar +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
International Journal of Engineering, 2021 The Travelling Salesman Problem (TSP) is one of the fundamental operational research problems where the objective is to generate the cheapest route for a salesman starting from a given city, visiting all the other cities only once and finally returning ...
Souhail Dhouib
semanticscholar +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
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
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