Results 81 to 90 of about 72,966 (206)
On One Implementation of a Natural Approach to Solving the Traveling Salesman Problem
Кібернетика та комп'ютерні технологіїIntroduction. The relevance of the traveling salesman problem is associated with the need to develop computational schemes for use in situations that require the analysis of information of a sufficiently large volume.
Dmitri Terzi
doaj +1 more source
Traveling Salesman Problem with Transportation [PDF]
Computer Science Journal of Moldova, 2006 Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined – a synthesis of classical TSP and classical Transportation Problem.
Valeriu Ungureanu
doaj
Didactic Visualization of Routing Problems
Education Sciences, 2020 The Traveling Salesman and Vehicle Routing Problems are integral parts of bachelor and master programs related to Operations Research/Management Science. This is due to their relevance in both practical applications and research.
Margaretha Gansterer, Veronika Klug
doaj +1 more source
An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems [PDF]
The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance on standard test instances, as ...
Ghosh, Diptesh, Sharma, Megha
core
Production routing decisions in a two‐echelon supply chain with multiple delivery modes
International Transactions in Operational Research, Volume 33, Issue 5, Page 3385-3421, September 2026.Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel +2 more
wiley +1 more source
Revista Produção Online, 2013 The Clustered Traveling Salesman Problem (CTSP) is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and objective is to find a minimum cost Hamiltonian cycle such that the ...
Mário Mestria
doaj +1 more source
Advanced Physics Research, Volume 5, Issue 5, May 2026.This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim +3 more
wiley +1 more source
Multi-UAV Formation Path Planning Based on Compensation Look-Ahead Algorithm
DronesThis study primarily studies the shortest-path planning problem for unmanned aerial vehicle (UAV) formations under uncertain target sequences. In order to enhance the efficiency of collaborative search in drone clusters, a compensation look-ahead ...
Tianye Sun +3 more
doaj +1 more source
Systems Engineering, Volume 29, Issue 3, Page 387-405, May 2026.ABSTRACT Structural Complexity is perceived as driving cost in system development, yet managing it effectively requires empirical understanding. This study investigates human decision‐making using a toy transportation‐style network design task, focusing on how Structural Complexity, Effort, and Performance interact. Seventy‐four participants (primarily
Alfonso Lanza +3 more
wiley +1 more source
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
, 2006 In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead,
Manthey, Bodo, Ram, L. Shankar
core +4 more sources