Traveling salesman problem: an overview of applications, formulations, and solution approaches
The traveling salesman problem (TSP) were studied in the 18th century by a mathematician
from Ireland named Sir William Rowam Hamilton and by the British mathematician named …
from Ireland named Sir William Rowam Hamilton and by the British mathematician named …
Generalize a small pre-trained model to arbitrarily large tsp instances
For the traveling salesman problem (TSP), the existing supervised learning based
algorithms suffer seriously from the lack of generalization ability. To overcome this …
algorithms suffer seriously from the lack of generalization ability. To overcome this …
Free-floating bike sharing: Solving real-life large-scale static rebalancing problems
Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-
up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of …
up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of …
Ant colony optimization
Swarm intelligence is a relatively new approach to problem solving that takes inspiration
from the social behaviors of insects and of other animals. In particular, ants have inspired a …
from the social behaviors of insects and of other animals. In particular, ants have inspired a …
Iterated local search: Framework and applications
The key idea underlying iterated local search is to focus the search not on the full space of
all candidate solutions but on the solutions that are returned by some underlying algorithm …
all candidate solutions but on the solutions that are returned by some underlying algorithm …
Iterated local search
The importance of high performance algorithms for tackling difficult optimization problems
cannot be understated, and in many cases the only available methods are metaheuristics …
cannot be understated, and in many cases the only available methods are metaheuristics …
An efficient harris hawk optimization algorithm for solving the travelling salesman problem
FS Gharehchopogh, B Abdollahzadeh - Cluster Computing, 2022 - Springer
Abstract Travelling Salesman Problem (TSP) is an Np-Hard problem, for which various
solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this …
solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this …
Enhanced discrete particle swarm optimization path planning for UAV vision-based surface inspection
In built infrastructure monitoring, an efficient path planning algorithm is essential for robotic
inspection of large surfaces using computer vision. In this work, we first formulate the …
inspection of large surfaces using computer vision. In this work, we first formulate the …
Electrical cable optimization in offshore wind farms—A review
JA Pérez-Rúa, NA Cutululis - Ieee Access, 2019 - ieeexplore.ieee.org
A state-of-the-art review of the optimization of electrical cables in offshore wind farms
(OWFs) is presented in this paper. One of the main contributions of this paper is to propose a …
(OWFs) is presented in this paper. One of the main contributions of this paper is to propose a …
A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
The clustered generalized traveling salesman problem (CGTSP) is an extension of the
classical traveling salesman problem (TSP), where the set of nodes is divided into clusters of …
classical traveling salesman problem (TSP), where the set of nodes is divided into clusters of …