Hybrid pointer networks for traveling salesman problems optimization. [PDF]
PLoS One, 2021 Stohy A +7 more
europepmc +1 more source
Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problem. [PDF]
PLoS One, 2023 Zhang J, Liu Q, Han X.
europepmc +1 more source
Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm. [PDF]
PeerJ Comput Sci, 2023 Ban HB, Pham DH.
europepmc +1 more source
Multiple probabilistic traveling salesman problem in the coordination of drug transportation-In the context of sustainability goals and Industry 4.0. [PDF]
PLoS One, 2021 Twaróg S +4 more
europepmc +1 more source
Tongxin xuebao, 2017 Comparing to the traditional data collecting method with data route,the technology of wireless mobile nodes has gradually became a new technique in the wireless sensor network.As the solution to the visiting order of the static nodes was an intrinsic NP ...
Hao FENG, Lei LUO, Yong WANG, Miao YE
doaj +2 more sources
Simultaneous Pickup and Delivery Traveling Salesman Problem considering the Express Lockers Using Attention Route Planning Network. [PDF]
Comput Intell Neurosci, 2021 Du Y, Fu S, Lu C, Zhou Q, Li C.
europepmc +1 more source
The Symmetric Traveling Salesman Problem
, 2005 Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as a product of 2-cycles. Applying the modified Floyd-Warshall algorithm to (sigma_T)^-1M^-, we construct acceptable and 2-circuit cycles some sets of which may yield circuits ...
openaire +3 more sources
A general ant colony model to solve combinatorial optimization problems
Revista Colombiana de Computación, 2001 An Ants System is an artificial system based on the behavior of real ant colonies, which is used to solve combinatorial problems. Keywords: Combinatorial Optimization Problem,AntSystem, the Graph Partitioning and The Traveling Salesman Problems.
José Aguilar
doaj
Iterative Patching and the Asymmetric Traveling Salesman Problem [PDF]
Although Branch and Bound (BnB) methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter.
Ghosh, Diptesh +3 more
core +1 more source
Edge assembly combined with arc-based crossover for undirected traveling salesman with profits
Journal of King Saud University: Computer and Information SciencesIn the traveling salesman problem with profit, the orienteering problem (OP) and prize-collecting traveling salesman problem (PCTSP) are two typical TSPs with profits.
Jie Wang, Xueshi Dong
doaj +1 more source