Results 81 to 90 of about 2,383 (189)

Production routing decisions in a two‐echelon supply chain with multiple delivery modes

International Transactions in Operational Research, Volume 33, Issue 5, Page 3385-3421, September 2026.
Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel, Fayçal Belkaid, Nadjib Brahimi   +2 more
wiley   +1 more source

Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem

Revista Produção Online, 2014
In this paper, we propose new heuristic methods for solver the Clustered Traveling Salesman Problem (CTSP). The CTSP is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and ...
Mário Mestria
doaj   +1 more source

Advanced Trajectory Planning for Unmanned Aerial Vehicles in the Context of Data Collection from Spatially Distributed Wireless Sensor Networks

Cybernetics and Information Technologies
Wireless Sensor Networks (WSNs) are extensively used for monitoring large-scale areas with sensors having different coverage zones. Unmanned Aerial Vehicles (UAVs) are deployed to efficiently collect data from these distributed nodes.
Matkurbanov Tulkin, Utegenov Akhmet, Davlatyor Mengliyev, Matkurbonov Dilshod   +3 more
doaj   +1 more source

Multi-UAV Formation Path Planning Based on Compensation Look-Ahead Algorithm

Drones
This 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, Wei Sun, Changhao Sun, Ruofei He   +3 more
doaj   +1 more source

THE DUBINS TRAVELING SALESMAN PROBLEM WITH CONSTRAINED COLLECTING MANEUVERS

Acta Polytechnica CTU Proceedings, 2016
In this paper, we introduce a variant of the Dubins traveling salesman problem (DTSP) that is called the Dubins traveling salesman problem with constrained collecting maneuvers (DTSP-CM).
Petr Váňa, Jan Faigl
doaj   +1 more source

Dataset for the electric capacitated traveling salesman problem. [PDF]

Data Brief, 2023
Gialos A, Zeimpekis V.
europepmc   +1 more source

On random symmetric travelling salesman problems [PDF]

The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003
Let the edges of the complete graph Kn be assigned independent uniform [0, 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor, respectively. We show that whp |ZTSP − Z2FAC| = o(1).
openaire   +1 more source

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP) [PDF]

Journal of Optimization in Industrial Engineering, 2010
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution.
Ellips Masehian
doaj  

The on-line asymmetric traveling salesman problem

Journal of Discrete Algorithms, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura   +2 more
openaire   +6 more sources

Traveling salesman problem solution using magnonic combinatorial device. [PDF]

Sci Rep, 2023
Balinskyy M, Khitun A.
europepmc   +1 more source