Results 31 to 40 of about 2,267 (186)
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
Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero
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
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
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
OPTIMAL TOUR CONSTRUCTIONS FOR MULTIPLE MOBILE ROBOTS [PDF]
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
A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
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 parallelization by solving clustered subproblems
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
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
Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression
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
An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem
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

