Results 91 to 100 of about 72,557 (222)
Multi-UAV Formation Path Planning Based on Compensation Look-Ahead Algorithm
DronesThis study primarily studies the shortest-path planning problem for unmanned aerial vehicle (UAV) formations under uncertain target sequences. In order to enhance the efficiency of collaborative search in drone clusters, a compensation look-ahead ...
Tianye Sun +3 more
doaj +1 more source
Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
, 2013 We give a short proof that any comparison-based n^(1-epsilon)-approximation algorithm for the 1-dimensional Traveling Salesman Problem (TSP) requires Omega(n log n) comparisons.Comment: Superseded by "On the complexity of approximating Euclidean ...
Young, Neal E.
core
Fluctuations in the Site Disordered Traveling Salesman Problem
, 2007 We extend a previous statistical mechanical treatment of the traveling salesman problem by defining a discrete "site disordered'' problem in which fluctuations about saddle points can be computed.
Barvinok A +15 more
core +2 more sources
Bio‐Inspired Swarm Robotics Design for Mine Automation
Natural Sciences, Volume 6, Issue 2, April 2026.Ants demonstrate tandem running for cooperative haulage, and honeybees use memory‐based routes between hive and flowers. These behaviours inspire autonomous haulage robots in open‐pit mines to achieve efficient scan‐plan‐retrieve ore transport, replacing small haulage robots with large mining trucks.
Joven Tan +2 more
wiley +1 more source
Business Ethics, the Environment &Responsibility, Volume 35, Issue 2, Page 954-975, April 2026.ABSTRACT This study examines how individuals accept and navigate paradoxical tensions within a sustainability context, using a multiple case study of five Italian companies implementing circularity measurement tools. By exploring the interplay between self‐efficacy and acceptance of paradoxical tensions, drawing upon the Goal Setting and Paradox ...
Alice Alosi +4 more
wiley +1 more source
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
, 2006 In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead,
Manthey, Bodo, Ram, L. Shankar
core +4 more sources
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
Elitist Ant System with 2-opt Local Search for the Traveling Salesman Problem
Advances in Electrical and Computer Engineering, 2012 The Traveling Salesman Problem is one of the most famous problems in combinatorial optimization. The paper presents an algorithm based upon the elitist ant system for solving the traveling salesman problem.
MARTINOVIC, G., BAJER, D.
doaj +1 more source
Qubit‐Efficient Quantum Local Search for Combinatorial Optimization
Advanced Quantum Technologies, Volume 9, Issue 3, March 2026.We introduce a qubit‐efficient variational quantum algorithm for combinatorial optimization that adaptively uses from logarithmic to a linear number of qubits to implement quantum local search. The method encodes flip probabilities of spin groups into quantum amplitudes, enabling exploration of classically intractable neighborhoods while maintaining ...
Mikhail Podobrii +4 more
wiley +1 more source
The Maximum Traveling Salesman Problem with Submodular Rewards [PDF]
, 2012 In this paper, we look at the problem of finding the tour of maximum reward on an undirected graph where the reward is a submodular function, that has a curvature of $\kappa$, of the edges in the tour. This problem is known to be NP-hard.
Jawaid Stephen, L. Smith, Syed Talha
core