IAM-TSP: Iterative Approximate Methods for Solving the Travelling Salesman Problem
Esra’a Alkafaween +5 more
openaire +1 more source
Evolution-based tabu search approach to traveling salesman problem
碩士組合最佳化問題中,旅行銷售員問題(Traveling Salesman Problem, TSP)是最基本且典型的例子,許多問題都可以轉變成TSP的形式求解,又由於TSP是屬於NP-Complete問題,在資料量龐大的情況之下無法找出最佳解,所以又有將大型TSP變換成數個小型TSP的分群旅行銷售員問題(Clustered Traveling Salesman Problem, CTSP)的研究提出。所以,如何設計一個良好的演算法,使得我們能夠能找出近似最佳解變得相當重要。因此 ...
張震宇; Chang, Chen-yu
core
An Immune-genetic Based TSP Solution
:Using the characteristics of the genetic algorithm and the immune algorithm, an immune-genetic algorithm was presented for solving TSP (traveling salesman problem) more effectively.
doaj
ALGORITMA FLEURY UNTUK MENYELESAIKAN PERMASALAHAN TSP (TRAVELING SALESMAN PROBLEM)
Algoritma Fleury sendiri pada dasarnya adalah salah satu metode untuk menemukan suatu jejak Euler pada suatu graf Euler dimana hal ini mirip dengan permasalahan Traveling Salesman Problem (TSP) dimana kita diharuskan menemukan jejak (rute) dari suatu ...
Putri, Iin Karmila; Universitas Cokroaminoto Palopo
core
MINIMASI BIAYA DISTRIBUSI DENGAN MENGGUNAKAN METODE TRAVELING SALESMAN PROBLEM (TSP)
Permasalahan TSP (Traveling Salesman Problem) adalah permasalahan dimana seorang salesman harus mengunjungi semua kota dimana tiap kota hanya dikunjungi sekali, dan harus mulai dari dan kembali ke kota asal.
Yulmasari, Astria
core
Solving multi-depot closed-path multiple traveling salesman problem using k-means++ hierarchical clustering and neural combinatorial networks. [PDF]
Zhao CS, Wong LP, Fung C.
europepmc +1 more source
Genetic algorithm-based coverage path planning for autonomous aircraft cabin cleaning by reconfigurable robot. [PDF]
Dinh CH +5 more
europepmc +1 more source
Employing in-context learning prompts with large language models for drone routing in delivery services. [PDF]
Masoud M, Elhenawy M, Abdelhay A.
europepmc +1 more source
Getting Things in Order: An Introduction to the R Package seriation
Seriation, i.e., finding a suitable linear order for a set of objects given data and a loss or merit function, is a basic problem in data analysis.
Kurt Hornik +2 more
core
Probabilistic greedy algorithm solver using magnetic tunneling junctions for traveling salesman problem. [PDF]
Zhang R +17 more
europepmc +1 more source

