Results 11 to 20 of about 21,266 (220)
Harnessing Time-Dependent Magnetic Texture Dynamics via Spin-Orbit Torque for Physics-Enhanced Neuromorphic Computing. [PDF]
Adv Sci (Weinh)A neuromorphic computing platform using spin‐orbit torque‐controlled magnetic textures is reported. The device implements bio‐inspired synaptic functions and achieves high performance in both pattern recognition (>93%) and combinatorial optimization (>95%), enabling unified processing of cognitive and optimization tasks.
Zhang Y +13 more
europepmc +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
A Hybrid Genetic Algorithm for the min-max Multiple Traveling Salesman Problem [PDF]
Computers & Operations Research, 2023 This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a TSP sequence as the representation of each individual, and a dynamic ...
Sasan Mahmoudinazlou, C. Kwon
semanticscholar +1 more source
H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem [PDF]
AAAI Conference on Artificial Intelligence, 2023 We propose an end-to-end learning framework based on hierarchical reinforcement learning, called H-TSP, for addressing the large-scale Traveling Salesman Problem (TSP).
Xuanhao Pan +6 more
semanticscholar +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
A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone [PDF]
Transportation Research Part C: Emerging Technologies, 2021 Reinforcement learning has recently shown promise in learning quality solutions in many combinatorial optimization problems. In particular, the attention-based encoder-decoder models show high effectiveness on various routing problems, including the ...
Aigerim Bogyrbayeva. Taehyun Yoon +4 more
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
H-TSP: Hierarchically Solving the Large-Scale Traveling Salesman Problem
Proceedings of the AAAI Conference on Artificial Intelligence, 2023 We propose an end-to-end learning framework based on hierarchical reinforcement learning, called H-TSP, for addressing the large-scale Traveling Salesman Problem (TSP). The proposed H-TSP constructs a solution of a TSP instance starting from the scratch relying on two components: the upper-level policy chooses a small subset of nodes (up to 200 in our ...
Pan, Xuanhao +6 more
openaire +2 more sources
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