OPTIMAL TOUR CONSTRUCTIONS FOR MULTIPLE MOBILE ROBOTS [PDF]
Journal of Engineering Science and Technology, 2011 The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental
AMIR A. SHAFIE
doaj
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
An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem
Mathematics, 2023 The ant colony algorithm faces dimensional catastrophe problems when solving the large-scale traveling salesman problem, which leads to unsatisfactory solution quality and convergence speed.
Kezong Tang +4 more
doaj +1 more source
Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem [PDF]
, 2010 The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some other problems.
Balas +24 more
core +3 more sources
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
Traveling salesman problem parallelization by solving clustered subproblems
Foundations of Computing and Decision Sciences, 2023 A method of parallelizing the process of solving the traveling salesman problem is suggested, where the solver is a heuristic algorithm. The traveling salesman problem parallelization is fulfilled by clustering the nodes into a given number of groups ...
Romanuke Vadim
doaj +1 more source
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
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