Results 41 to 50 of about 10,276 (236)
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
Advanced Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
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]
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
Business Strategy and the Environment, EarlyView.ABSTRACT This study demonstrates how a profitable, lean, and environmentally responsible e‐waste reverse logistics system can be designed using integrated Operations Research (OR) techniques. Addressing the growing urgency of responsible consumption (UN SDG 12) and the projected rise of the e‐waste sector to USD 137.60 billion by 2029, the research ...
Sheeba Pathak, Hajar Fatorachian
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
A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
International Journal of Computational Intelligence Systems, 2018 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
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
New techniques for cost sharing in combinatorial optimization games [PDF]
, 2010 Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
Caprara, A +3 more
core +1 more source