Results 11 to 20 of about 16,247 (139)
The bottleneck traveling salesman problem and some variations
, 2010 We present powerful heuristics for the bottleneck traveling salesman problem (BTSP) and closely related problems such as the maximum scatter traveling salesman problem (MSTSP) and the balanced traveling salesman problem, the later being a new problem which we in- troduce. Extensive computational results are presented.
John Larusic
openalex +2 more sources
An approximation algorithm for a bottleneck traveling salesman problem
J. Discrete Algorithms, 2009 Ming‐Yang Kao, Manan Sanghi
openalex +2 more sources
Designing Memristive Materials for Artificial Dynamic Intelligence
Advanced Intelligent Discovery, EarlyView.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
A Heavy‐Duty Vehicle Routing Problem With Temperature Constraints
Networks, EarlyView.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
Systems Engineering, EarlyView.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
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
Advanced Intelligent Systems, Volume 8, Issue 1, January 2026.This perspective article considers what computations optical computing can and should enable. Focusing upon free‐space optical computing, it argues that a codesign approach whereby materials, devices, architectures, and algorithms are simultaneously optimized is needed.
Prasad P. Iyer +6 more
wiley +1 more source
Automating Algorithm Experiments With ALGator: From Problem Modeling to Reproducible Results
Software: Practice and Experience, Volume 56, Issue 1, Page 26-41, January 2026.ABSTRACT Background Theoretical algorithm analysis provides fundamental insights into algorithm complexity but relies on simplified and often outdated computational models. Experimental algorithmics complements this approach by evaluating the empirical performance of algorithm implementations on real data and modern computing platforms.
Tomaž Dobravec
wiley +1 more source
Workload equity in multiperiod vehicle routing problems
International Transactions in Operational Research, Volume 33, Issue 1, Page 245-267, January 2026.Abstract An equitable distribution of workload is essential when deploying vehicle routing solutions in practice. For this reason, previous studies have formulated vehicle routing problems with workload‐balance objectives or constraints, leading to trade‐off solutions between routing costs and workload equity.
Najmeh Nekooghadirli +3 more
wiley +1 more source