Results 71 to 80 of about 21,266 (220)
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm [PDF]
Journal of Optimization in Industrial Engineering, 2014 The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution.
Hossein Larki, Majid Yousefikhoshbakht
doaj
New Ant Colony Optimization Algorithm for the Traveling Salesman Problem
International Journal of Computational Intelligence Systems, 2020 As one suitable optimization method implementing computational intelligence, ant colony optimization (ACO) can be used to solve the traveling salesman problem (TSP).
Wei Gao
semanticscholar +1 more source
IET Optoelectronics, Volume 20, Issue 1, January/December 2026.In this paper, we have reviewed six distinct metaheuristic optimisation algorithms applicable to challenging problems in electromagnetics and optics. Specifically, we applied each method to the synthesis of GMR narrowband reflection filters and performed a systematic comparative evaluation. ABSTRACT The design of optical elements often requires precise
Amirreza Asadollahzadeh +2 more
wiley +1 more source
PLoS ONE, 2019 In the carrier-based coverage repair problem, a single mobile robot replaces damaged sensors by picking up spare ones in the region of interest or carrying them from a base station in wireless sensor and robot networks.
Kun Miao +3 more
doaj +1 more source
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
A branch‐and‐cut approach and alternative formulations for the traveling salesman problem with drone
Networks, 2020 In this paper, we are interested in studying the traveling salesman problem with drone (TSP‐D). Given a set of customers and a truck that is equipped with a single drone, the TSP‐D asks that all customers are served exactly once and minimal delivery time
D. Schermer, M. Moeini, O. Wendt
semanticscholar +1 more source
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
Entropy, 2020 The dynamic traveling salesman problem (DTSP) falls under the category of combinatorial dynamic optimization problems. The DTSP is composed of a primary TSP sub-problem and a series of TSP iterations; each iteration is created by changing the previous ...
P. Stodola +3 more
semanticscholar +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
A New Evolutionary Multiobjective Model for Traveling Salesman Problem
IEEE Access, 2019 The traveling salesman problem (TSP) is one of the most classical NP-hard problems in the combinatorial optimization, as many practical problems, such as scheduling problems and vehicle-routing cost allocation problems can be abstracted. The introduction
Xuejiao Chen +5 more
doaj +1 more source