Results 31 to 40 of about 232 (135)
Advanced Physics Research, Volume 5, Issue 5, May 2026.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
Systems Engineering, Volume 29, Issue 3, Page 387-405, May 2026.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
The team orienteering problem with variable time windows
International Transactions in Operational Research, Volume 33, Issue 3, Page 1705-1732, May 2026.Abstract The orienteering problem is well‐established within the domain of operational research. This paper introduces the team orienteering problem with variable time windows (TOPVTW) as a new variant of the team orienteering problem with time windows. The distinguishing feature of the TOPVTW is the adaptive time windows, which evolve dynamically as a
Bibiana Granda, Begoña Vitoriano
wiley +1 more source
Advanced Functional Materials, Volume 36, Issue 34, 27 April 2026.A stacked memristor crossbar architecture is presented that enables direct in‐memory computation of Euclidean distance through intrinsic current subtraction at a shared middle electrode. By physically encoding weights and squared weights in vertically aligned layers, the system realizes energy‐efficient self‐organizing map learning, demonstrating ...
Jinwoo Park, Hyungjin Kim
wiley +1 more source
A Heavy‐Duty Vehicle Routing Problem With Temperature Constraints
Networks, Volume 87, Issue 2, Page 131-150, March 2026.ABSTRACT This article studies a vehicle routing problem involving a fleet of heavy‐duty vehicles and pickup‐and‐delivery requests for crude items that are both heavy and high‐temperature. The objective is to route the fleet in such a way that maximizes resource efficiency and operational efficiency while simultaneously avoiding thermal overload of any ...
Biljana Roljić, Yuan Chen
wiley +1 more source
ALGORITMA LEXISEARCH MENGGUNAKAN REPRESENTASI ADJACENCY DAN PATH UNTUK MENYELESAIKAN BOTTLENECK TRAVELING SALESMAN PROBLEM [PDF]
, 2018 Traveling Salesman Problem (TSP) merupakan suatu permasalahan dimana seorang sales harus melalui semua kota dengan jarak yang terpendek dan setiap kota hanya boleh dilalui tepat satu kali.
SITI BAHJATUN SANIYAH, NIM. 14610016
core
Traveling salesman problem based on simulated annealing
, 2022 The term Ant Colony Optimization, or ACO for short, refers to a family of heuristic search methods that have been effectively utilized in the process of resolving combinational optimization (CO) issues.
Alashkar, Taha Sarmad Mahmood Mukhtar
core
International Transactions in Operational Research, Volume 33, Issue 2, Page 719-774, March 2026.Abstract The transformative potential of artificial intelligence (AI) ChatBots, leveraging natural language processing for information retrieval and knowledge synthesis, has garnered attention across diverse fields, including research. Recognizing AI's importance, researchers and policymakers are actively engaged in its development.
Cinzia Daraio +2 more
wiley +1 more source
Designing Memristive Materials for Artificial Dynamic Intelligence
Advanced Intelligent Discovery, Volume 2, Issue 1, February 2026.Key characteristics required of memristors for realizing next‐generation computing, along with modeling approaches employed to analyze their underlying mechanisms. These modeling techniques span from the atomic scale to the array scale and cover temporal scales ranging from picoseconds to microseconds. Hardware architectures inspired by neural networks
Youngmin Kim, Ho Won Jang
wiley +1 more source
Exploiting sparsity in pricing routines for the capacitated arc routing problem [PDF]
, 2008 The capacitated arc routing problem (CARP) is a well-known and fundamental vehicle routing problem. A promising exact solution approach to the CARP is to model it as a set covering problem and solve it via branch-cut-and-price.
Oukil, A +3 more
core