Results 41 to 50 of about 72,557 (222)
Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution
, 2006 We report a new statistical general property in traveling salesman problem, that the $n$th-nearest-neighbor distribution of optimal tours verifies with very high accuracy an exponential decay as a function of the order of neighbor $n$.
Brooke +21 more
core +1 more source
Multi‐Agent Reinforcement Learning for Joint Police Patrol and Dispatch
Naval Research Logistics (NRL), EarlyView.ABSTRACT Police patrol units need to split their time between performing preventive patrol and being dispatched to serve emergency incidents. In the existing literature, patrol and dispatch decisions are often studied separately. We consider joint optimization of these two decisions to improve police operations efficiency and reduce response time to ...
Matthew Repasky, He Wang, Yao Xie
wiley +1 more source
Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression
Journal of Applied Mathematics, 2014 This paper solves the dynamic traveling salesman problem (DTSP) using dynamic Gaussian Process Regression (DGPR) method. The problem of varying correlation tour is alleviated by the nonstationary covariance function interleaved with DGPR to generate a ...
Stephen M. Akandwanaho +2 more
doaj +1 more source
Approximation algorithms for the traveling salesman problem
, 2002 We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable ...
Monnot, Jérôme +2 more
core +3 more sources
Asymmetric Traveling Salesman Path and Directed Latency Problems [PDF]
, 2009 We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nodes s and t, both problems ask to find an s-t path visiting all other nodes.
Friggstad, Zachary +2 more
core +7 more sources
On‐Time Meal Delivery Assisted by Drone Resupply
Naval Research Logistics (NRL), EarlyView.ABSTRACT Ensuring timely delivery is crucial with the increasing competition in online meal delivery services. This requires the industry to adopt new technologies and the corresponding operational models, including the use of drones. Concerning the desired features of meal delivery, such as safety and reliability, we propose an operational model that ...
Wenqian Liu, Lindong Liu, Xiangtong Qi
wiley +1 more source
Insights into the application of the traveling salesman problem to logistics without considering financial risk: A bibliometric study [PDF]
Management Science LettersSuppliers can use different strategies to distribute their products, Among the most common complex optimization problems related to the transportation of products is the traveling salesman problem.
Amir Mohammad Larni-Fooeik +2 more
doaj +1 more source
Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem [PDF]
ISPRS International Journal of Geo-Information, 2018 The Equality-Generalized Travelling Salesman Problem (E-GTSP), which is an extension of the Travelling Salesman Problem (TSP), is stated as follows: given groups of points within a city, like banks, supermarkets, etc., find a minimum cost Hamiltonian cycle that visits each group exactly once.
Mohammed Zia +2 more
openaire +3 more sources
Systems Engineering, EarlyView.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
The Computational Complexity of the Traveling Salesman Problem [PDF]
, 2011 In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.Comment: 1 page, made a minor ...
Feinstein, Craig Alan
core +2 more sources