Trajectory Optimisation for UAV Data Collection in IoT‐Based WSN: A Lévy Flight‐Based Approach
IET Smart Cities, Volume 8, Issue 1, January/December 2026.In large‐scale IoT and WSN deployments, data transmission to base stations is often limited by restricted network coverage, and drones can help extend connectivity by collecting data from cluster head nodes. This work proposes an energy‐efficient drone‐assisted data collection approach that jointly optimises system costs and energy consumption, taking ...
Hamayadji Abdoul Aziz +6 more
wiley +1 more source
Finding optimal solutions to Traveling Salesman Problem by using Branch and Bound method and one of intelligence techniques with application [PDF]
المجلة العراقية للعلوم الاحصائية, 2013 In this research we find an optimal solutions for traveling salesman problem (TSP) using Branch and Bound method as well as we use an intelligence techniques represented by ant colony optimization (ACO) and applied them on the DNA chain data, where the ...
doaj +1 more source
Restricted Dynamic Programming Heuristic for Precedence Constrained Bottleneck Generalized TSP [PDF]
, 2015 We develop a restricted dynamical programming heuristic for a complicated traveling salesman problem: a) cities are grouped into clusters, resp.
Salii, Y.
core
Two-phase framework for optimal multi-target Lambert rendezvous
, 2017 This paper proposes a two-phase framework to solve an optimal multi-target Lambert rendezvous problem. The first phase solves a series of single-target rendezvous problems for all departure-arrival object pairs to generate the elementary solutions, which
Ahn, Jaemyung, Bang, Jun
core +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
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP). [PDF]
PeerJ Comput Sci, 2023 Hao T, Yingnian W, Jiaxing Z, Jing Z.
europepmc +1 more source
PENERAPAN PROGRAM DINAMIK PADA TRAVELING SALESMAN PROBLEM (TSP) [PDF]
, 2009 Masalah Traveling Salesman Problem (TSP) merupakan persoalan kombinatorial yang tidak sederhana sehingga diperlukan suatu algoritma atau metode yang dapat menyelesaikannya.
Astuti, Rema
core
A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone
, 2018 This paper addresses the Traveling Salesman Problem with Drone (TSP-D), in which a truck and drone are used to deliver parcels to customers. The objective of this problem is to either minimize the total operational cost (min-cost TSP-D) or minimize the ...
Deville, Yves +3 more
core +1 more source
A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Ghosh, Diptesh, Sumanta Basu
core
The 2-period balanced traveling salesman problem [PDF]
In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days); moreover, the number of customers visited in every ...
Francesco Mason, Tatiana Bassetto
core