Results 41 to 50 of about 72,966 (206)
Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero
Revista Iberoamericana de Automática e Informática Industrial RIAI, 2016 Resumen: En este trabajo se estudia el Problema de Secuenciación de Trabajos codificado como un Problema de Agente Viajero y resuelto mediante Algoritmos Genéticos.
G.E. Anaya Fuentes +3 more
doaj +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
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
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
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
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
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
On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem [PDF]
, 2014 We present a very simple family of traveling salesman instances with $n$ cities where the nearest neighbor rule may produce a tour that is $\Theta(\log n)$ times longer than an optimum solution.
Hougardy, Stefan, Wilde, Mirko
core
Optimal Random Matchings, Tours, and Spanning Trees in Hierarchically Separated Trees [PDF]
, 2013 We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size $n$ distributed among the leaves of a balanced hierarchically separated tree. We consider {\it monochromatic} and {\it bichromatic}
Csaba, Béla +2 more
core +1 more source