Results 31 to 40 of about 59,482 (207)
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 +4 more
core +5 more sources
Approximating ATSP by Relaxing Connectivity
, 2015 The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs. Our arguments
Svensson, Ola
core +1 more source
Quantum heuristic algorithm for traveling salesman problem
, 2012 We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to unity and they
A. M. Childs +31 more
core +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
A Memetic Algorithm for the Generalized Traveling Salesman Problem [PDF]
, 2009 The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from ...
Gutin, Gregory, Karapetyan, Daniel
core +4 more sources
Advanced Physics Research, EarlyView.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
A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
International Journal of Computational Intelligence Systems, 2018 Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc.
Kin-Ming Lo +5 more
doaj +1 more source
Traveling Salesman Problem [PDF]
, 2015 Práce se zaměřuje na úpravu známých postupů ACO a GA s ohledem na zvyšování efektivity nalézaných řešení. Jsou zde prezentovány dva nové přístupy pro řešení TSP. Pomocí jednoho z nich lze také vytvořit počáteční populaci pro GA. Je uveden konkrétní návrh
Šůstek, Martin
core
Business Strategy and the Environment, EarlyView.ABSTRACT This study demonstrates how a profitable, lean, and environmentally responsible e‐waste reverse logistics system can be designed using integrated Operations Research (OR) techniques. Addressing the growing urgency of responsible consumption (UN SDG 12) and the projected rise of the e‐waste sector to USD 137.60 billion by 2029, the research ...
Sheeba Pathak, Hajar Fatorachian
wiley +1 more source
On the Solution of the Traveling Salesman Problem by a Modification of the Hungarian Method
Кібернетика та комп'ютерні технологіїIntroduction. The traveling salesman problem is becoming an important object of research in various fields of science, economics and technology. Construction of efficient algorithms with an optimality criterion for the obtained solution is a relevant ...
Dmitri Terzi
doaj +1 more source