Results 61 to 70 of about 3,935 (225)
A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
International Journal of Computational Intelligence Systems, 2018 Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc.
Kin-Ming Lo +5 more
doaj +1 more source
IMPLEMENTASI ALGORITMA I-SOS DALAM PENYELESAIAN TRAVELING SALESMAN PROBLEM (TSP)
TEKNIMEDIA: Teknologi Informasi dan Multimedia, 2021 The problem with TSP is an attempt to find the shortest distance traveled by a salesman in visiting each city without having to visit the same city more than once. The purpose of implementing the I-SOS algorithm in this case is to find the minimum distance traveled, a solution can be obtained after going through the calculation of the mutualism phase ...
null Zulkarnaen Zulkarnaen +1 more
openaire +2 more sources
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
Advanced Functional Materials, Volume 36, Issue 34, 27 April 2026.A stacked memristor crossbar architecture is presented that enables direct in‐memory computation of Euclidean distance through intrinsic current subtraction at a shared middle electrode. By physically encoding weights and squared weights in vertically aligned layers, the system realizes energy‐efficient self‐organizing map learning, demonstrating ...
Jinwoo Park, Hyungjin Kim
wiley +1 more source
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
Advanced Intelligent Systems, Volume 8, Issue 4, April 2026.Large‐scale Hopfield neural networks (HNNs) for associative computing are implemented using vertical NAND (VNAND) flash memory. The proposed VNAND HNN with the asynchronous update scenario achieve robust image restoration performance despite fabrication variations, while significantly reducing chip area (≈117× smaller than resistive random‐access ...
Jin Ho Chang +4 more
wiley +1 more source
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +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
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