New Heuristic Approaches for the Min–Max Regret Traveling Salesman Problem
IEEE AccessThe traveling salesman problem (TSP) is widely known as one of the most important NP-hard combinatorial optimization problems. In this paper, we consider the min-max regret traveling salesman problem (MMR-TSP) with interval travel costs. The MMR-TSP aims
Kazuki Hasegawa +2 more
doaj +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
Didactic Visualization of Routing Problems
Education Sciences, 2020 The Traveling Salesman and Vehicle Routing Problems are integral parts of bachelor and master programs related to Operations Research/Management Science. This is due to their relevance in both practical applications and research.
Margaretha Gansterer, Veronika Klug
doaj +1 more source
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
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
On Evaluating Human Problem Solving of Computationally Hard Problems
, 2013 This article is concerned with how computer science, and more exactly computational complexity theory, can inform cognitive science. In particular, we suggest factors to be taken into account when investigating how people deal with computational hardness.
Stege, Ulrike, Carruthers, Sarah
core +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
, 2022 Στόχος της εκπονηθείσας εργασίας, είναι η επίλυση του «Προβλήματος του Πλανόδιου Πωλητή (Travelling Salesman Problem -TSP)», μέσω της δημιουργίας κωδίκων στη γλώσσα προγραμματισμού Pyhton με τέσσερεις διαφορετικές μεθόδους - αλγορίθμους [Genetic ...
Κλητοράκης, Δημήτριος +1 more
core
An exact and heuristic approach for the traveling salesman problem with drone and variable drone speeds selection [PDF]
, 2022 openGrazie al rapido avanzamento tecnologico avvenuto negli ultimi anni, i sistemi di consegna via drone stanno diventando sempre più popolari. In questa tesi, proponiamo un metodo esatto e un metodo euristico per il problema del Flying Sidekick ...
MICHELOTTO, FEDERICO
core
Optimum buckling design of composite stiffened panels using ant colony algorithm [PDF]
, 2010 Optimal design of laminated composite stiffened panels of symmetric and balanced layup with different number of T-shape stiffeners is investigated and presented. The stiffened panels are simply supported and subjected to uniform biaxial compressive load.
Wang, Wei +3 more
core +1 more source