Results 41 to 50 of about 28,986 (210)

Robot Monitoring for the Detection and Confirmation of Stochastic Events

, 2014
In this paper we consider a robot patrolling problem in which events arrive randomly over time at the vertices of a graph. When an event arrives it remains active for a random amount of time.
Asghar, Ahmad Bilal, Smith, Stephen L.
core   +1 more source

The Traveling Salesman Problem Under Squared Euclidean Distances [PDF]

, 2010
Let $P$ be a set of points in $\mathbb{R}^d$, and let $\alpha \ge 1$ be a real number. We define the distance between two points $p,q\in P$ as $|pq|^{\alpha}$, where $|pq|$ denotes the standard Euclidean distance between $p$ and $q$.
de Berg, Mark, Sitters, René, van Nijnatten, Fred, Woeginger, Gerhard J., Wolff, Alexander   +4 more
core   +5 more sources

Engineering Binary Metal Oxide Nano‐Oscillators for Deterministic and Probabilistic Computing: From Material Physics to Emerging Paradigms

Advanced Physics Research, EarlyView.
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, Jaehyun Moon, Seung‐Youl Kang, Jiyong Woo   +3 more
wiley   +1 more source

Parallel ACO with a Ring Neighborhood for Dynamic TSP

, 2012
The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distances between cities as travel times are no longer fixed.
A.Sameh, C.-M.Pintea, E.Lawler, L.Kang, M.Dorigo, M.Dorigo, M.Dorigo, P.Pop, T.Stützle, V.-D.Cung   +9 more
core   +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, Ben-Arieh, Bontoux, D. Karapetyan, Fischetti, Fischetti, G. Gutin, Gutin, Helsgaun, Helsgaun, Johnson, Laporte, Laporte, Lin, Noon, Noon, Pintea, Pop, Pop, Rego, Reinelt, Renaud, Snyder, Tasgetiren, Yang   +24 more
core   +3 more sources

Operations Research‐Based Formalisation and Design of Sustainable Reverse Logistics for E‐Waste Supply Chains

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

The Application of Ant Colony Algorithm in Solve the Traveling Salesman Problem with Fuzzy Movement Time among Cities [PDF]

Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2010
Traveling salesman problem (TSP) is one of the most well-known combinational optimization problems which recently has been a suitable base to validate different heuristic and Meta heuristic algorithms.
Jamshid Salehi Sadaghiani
doaj  

A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based Approaches for E-GTSP

, 2014
The Generalized Traveling Salesman Problem (GTSP) is one of the NP-hard combinatorial optimization problems. A variant of GTSP is E-GTSP where E, meaning equality, has the constraint: exactly one node from a cluster of a graph partition is visited.
Pintea, Camelia-M.
core   +1 more source

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems [PDF]

, 2000
We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices.
A. I. Barvinok, A. Tamir, C. Bajaj, D. Applegate, D. S. Johnson, E. Weiszfeld, H. W. Kuhn, J. Edmonds, J. Edmonds, J. S. B. Mitchell, K. Mehlhorn, K. R. Varadarajan, P. M. Vaidya, S. Boyd, S. P. Fekete, W. Cook   +15 more
core   +2 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