Results 11 to 20 of about 15,296 (207)

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, Li Y, Lin H, Wang X, Liu L, Xing G, Wang D, Zhao Z, Guo Z, Yang J, Niu J, Sun Y, Wu T, Xing G.   +13 more
europepmc   +2 more sources

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

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, Jin, Yan, Ding, Yuandong, Feng, Mingxiao, Zhao, Li, Song, Lei, Bian, Jiang   +6 more
openaire   +2 more sources

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

The Traveling Salesman Problem Under Squared Euclidean Distances [PDF]

, 2010
Let $P$ be a set of points in $\mathbb{R}^d$, and let $\alpha \ge 1$ be a real number. We define the distance between two points $p,q\in P$ as $|pq|^{\alpha}$, where $|pq|$ denotes the standard Euclidean distance between $p$ and $q$.
de Berg, Mark, Sitters, René, van Nijnatten, Fred, Woeginger, Gerhard J., Wolff, Alexander   +4 more
core   +17 more sources

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, Nodari Vakhania, Frank Ángel Hernández-Mira, José Alberto Hernández-Aguilar   +3 more
doaj   +1 more source

Optimasi Rute Rencana Perjalanan Pesawat Menggunakan Algoritma Late Acceptance Hill Climbing (Studi Kasus : Travelling Salesman Challenge 2.0)

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

Parallel DNA Algorithms of Generalized Traveling Salesman Problem-Based Bioinspired Computing Model

International Journal of Computational Intelligence Systems, 2020
Generalized traveling salesman problem (GTSP) is a classical combinatorial optimization problem, in which the optimization goal is the minimum route combination. Since the GTSP is a more complex problem than the traveling salesman problem (TSP), the GTSP
Xiaomin Ren, Xiaoming Wang, Zhaocai Wang, Tunhua Wu   +3 more
doaj   +1 more source

TRAVELLING SALESMAN PROBLEM (TSP) OPTIMIZATION SEED DIS-TRIBUTION USING GENETIC ALGORITHM

JURTEKSI (Jurnal Teknologi dan Sistem Informasi), 2022
Abstract: Distribution is an important the business sector, the agricultural sector for distributing seeds to ensure the location of customers selling seeds. Problems that are often encountered seed distribution process are the efficiency of the time and distance distribution.
Vera Wati, Yuliana Yuliana, Paradise Paradise, Kusrini Kusrini   +3 more
openaire   +1 more source