Results 1 to 10 of about 1,153 (136)
Efficient bit labeling in factorization machines with annealing for traveling salesman problem [PDF]
Scientific ReportsTo efficiently determine an optimum parameter combination in a large-scale problem, it is essential to convert the parameters into available variables in actual machines. Specifically, quadratic unconstrained binary optimization problems are solved using
Shota Koshikawa +2 more
doaj +2 more sources
A three-phase algorithm for the pollution traveling Salesman problem [PDF]
HeliyonThis paper studies a variant of the Pollution Traveling Salesman Problem (PTSP) focused on fuel consumption and pollution emissions (PTSPC). The PTSPC generalizes the well-known Traveling Salesman Problem (TSP), classified as NP-Hard.
Karen García-Vasquez +2 more
doaj +2 more sources
Solving the clustered traveling salesman problem via traveling salesman problem methods [PDF]
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.
Yongliang Lu, Jin-Kao Hao, Qinghua Wu
doaj +2 more sources
Review of Multiple Traveling Salesman Model and Its Application [PDF]
Jisuanji kexue yu tansuo, 2022 As a generalization of the classical traveling salesman problem (TSP), the multiple traveling salesman problem (MTSP) is one of the well-known combinatorial optimization problems.
ZHANG Shuohang, GUO Gaizhi
doaj +1 more source
Intuitionistic fuzzy rule-base model for the time dependent traveling salesman problem [PDF]
Interdisciplinary Description of Complex Systems, 2020 The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem. There are many different extensions and modifications of the original problem, such as The Time Dependent Traveling Salesman Problem (TDTSP), this specific extension
Ruba S. Almahasneh, László T. Kóczy
doaj +1 more source
Applying Metaheuristic for Time-Dependent Traveling Salesman Problem in Postdisaster
International Journal of Computational Intelligence Systems, 2021 The Time-Dependent Traveling Salesman Problem (TDTSP) is a generalization of the Traveling Salesman Problem (TSP) and Traveling Repairman Problem (TRP). In the TSP and TRP, the travel time to travel is assumed to be constant.
Ha-Bang Ban
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
A Multi-Phase Method for Euclidean Traveling Salesman Problems
Axioms, 2022 The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once.
Víctor Hugo Pacheco-Valencia +3 more
doaj +1 more source
Jurnal Teknologi Informasi dan Ilmu Komputer, 2023 Permasalahan Traveling Salesman Problem (TSP) merupakan permasalahan klasik yang popular diteliti dalam bidang optimasi kombinatorika. Permasalahan ini bertujuan menentukan rute perjalanan terpendek untuk mengunjungi setiap lokasi tepat satu kali dan ...
Ahmad Muklason, I Gusti Agung Premananda
doaj +3 more sources
GENETIC ALGORITHM FOR OPTIMIZING DISTRIBUTION WITH ROUTE RESTRICTION CONSTRAINT DUE TO TRAFFIC JAMS [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 The Travelling Salesman Problem (TSP) is a classical problem in combinatorial optimization that consists of finding the shortest tour through all cities such that the salesman visits each city only one time and returns to the starting city.
N. Mouttaki, J. Benhra, G. Rguiga
doaj +1 more source