Results 51 to 60 of about 59,482 (207)
Ordered Median Traveling Salesman Problem
Networks, EarlyView.ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić +3 more
wiley +1 more source
Constant-Factor Approximation for TSP with Disks [PDF]
, 2016 We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of $n$ disks in the plane, a TSP tour whose length is at most $O(1)$ times the optimal can be ...
Dumitrescu, Adrian, Tóth, Csaba D.
core
Redefining Optimal Coverage Path Planning for FLS‐Equipped AUVs With Deep Reinforcement Learning
Journal of Field Robotics, EarlyView.ABSTRACT Autonomous Underwater Vehicles (AUVs) have emerged as indispensable tools for a variety of subsea tasks, from habitat monitoring and seabed mapping to infrastructure inspection and mine countermeasures. A fundamental challenge in this field is Coverage Path Planning (CPP), the problem of ensuring complete and efficient area coverage.
Lorenzo Cecchi +3 more
wiley +1 more source
Convergent Duality for the Traveling Salesman Problem [PDF]
, 1989 A constructive method is presented for optimizing exactly the Traveling Salesman Problem as a sequence of shortest route problems. The method combines group theoretic and Lagrangean relaxation constructions.
Shapiro, Jeremy F., 1939-
core
The Traveling Salesman Problem in the Natural Environment [PDF]
, 2010 Is it possible for humans to navigate in the natural environment wherein the path taken between various destinations is 'optimal' in some way? In the domain of optimization this challenge is traditionally framed as the "Traveling Salesman ...
Flip Phillips +2 more
core +2 more sources
On random symmetric travelling salesman problems [PDF]
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003 Let the edges of the complete graph Kn be assigned independent uniform [0, 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor, respectively. We show that whp |ZTSP − Z2FAC| = o(1).
openaire +1 more source
Genetiniai algoritmai komivojažieriaus uždaviniui: negatyvieji ir pozityvieji aspektai*
Informacijos Mokslai, 2009 Šiame straipsnyje nagrinėjami klausimai, susiję su genetinių algoritmų taikymu, sprendžiant gerai žinomą kombinatorinio optimizavimo uždavinį – komivojažieriaus uždavinį (KU) (angl. traveling salesman problem).
Alfonsas Misevičius +3 more
doaj +1 more source
Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic
Mathematics, 2023 This study investigates the flying sidekick traveling salesman problem (FSTSP), in which a truck and an unmanned aerial vehicle work together to make deliveries.
Vincent F. Yu +3 more
doaj +1 more source
Penyelesaian Traveling Salesman Problem pada Perusahaan Distribusi Produk dengan Algoritma Farthest Insertion [PDF]
, 2016 A Company is an organization that has a complexity of problems in managing the relationship between retailers and distributors to keep the process running smoothly distributing products.
Lisnawanty, L. (Lisnawanty)
core
A Theoretical Approach for Structuring and Analysing Knowledge Provenance for Visual Analytics
Computer Graphics Forum, EarlyView.VAKG unfolds the interactions within the current knowledge model (A) into a temporal knowledge graph (B), which is structured as a 4‐way graph containing two temporal (green) and two static (yellow) knowledge graphs. By using VAKG, one can structure and store the user's knowledge‐gathering process and all related interactions for eventual analysis (C).
L. Christino +3 more
wiley +1 more source