Results 61 to 70 of about 4,732 (227)

A new heuristic algorithm based on minimum spanning tree for solving metric traveling salesman problem [PDF]

International Journal of Industrial Engineering and Production Research
Due to the many applications of the travelling salesman problem, solving this problem has been considered by many researchers. One of the subsets of the travelling salesman problem is the metric travelling salesman problem in which a triangular ...
Malihe Masoumi, Javad Behnamian
doaj  

A Theoretical Approach for Structuring and Analysing Knowledge Provenance for Visual Analytics

Computer Graphics Forum, EarlyView.
VAKG unfolds the interactions within the current knowledge model (A) into a temporal knowledge graph (B), which is structured as a 4‐way graph containing two temporal (green) and two static (yellow) knowledge graphs. By using VAKG, one can structure and store the user's knowledge‐gathering process and all related interactions for eventual analysis (C).
L. Christino, S. Rezaeipour, E. Milios, F. Paulovich   +3 more
wiley   +1 more source

PEMANFAATAN TEKNOLOGI GOOGLE MAPS UNTUK PENYELESAIAN ONLINE TRAVELLING SALESMAN PROBLEM (TSP) BERBASIS GEOGRAFIS DENGAN MENGGUNAKAN ALGORITMA HEURISTIK

JUTI: Jurnal Ilmiah Teknologi Informasi, 2010
Travelling Salesman Problem (TSP) adalah salah satu metode klasik dalam proses pemecahan masalah optimasi dan penemuan rute terpendek dari sebuah rute perjalanan yang melewati beberapa titik lokasi.
Wahyudi Agustiono, Kurniawan Dwi Hermanto   +1 more
doaj   +1 more source

Scalable Computation of Topological Abstractions for Scalar Data

Computer Graphics Forum, EarlyView.
Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will, J. Lukasczyk, J. Tierny, A. Gyulassy, G. H. Weber, H. Carr, C. Garth   +6 more
wiley   +1 more source

On the Recoverable Traveling Salesman Problem

CoRR, 2021
In this paper we consider the Recoverable Traveling Salesman Problem (TSP). Here the task is to find two tours simultaneously, such that the intersection between the tours is at least a given minimum size, while the sum of travel distances with respect to two different distance metrics is minimized.
Marc Goerigk, Stefan Lendl, Lasse Wulf
openaire   +2 more sources

Genetic algorithm to the bi-objective multiple travelling salesman problem

Alexandria Engineering Journal
The travelling salesman problem (TSP) and its variants have been studied extensively due to its wide range of real-world applications, yet there are challenges in providing efficient algorithms to deal with some of its variants.
Shayathri Linganathan, Purusotham Singamsetty   +1 more
doaj   +1 more source

Representasi Matriks untuk Proses Crossover Pada Algoritma Genetika untuk Optimasi Travelling Salesman Problem

Matematika, 2017
Abstrak. Travelling Salesman Problem (TSP) merupakan salah satu permasalahan optimasi kombinatorial yang biasa terjadi dalam kehidupan sehari-hari. Permasalahan TSP yaitu mengenai seseorang yang harus mengunjungi semua kota tepat satu kali dan kembali ke
Ismi Fadhillah, Yurika Permanasari, Erwin Harahap   +2 more
doaj   +1 more source

Colored Traveling Salesman Problem

IEEE Transactions on Cybernetics, 2015
The multiple traveling salesman problem (MTSP) is an important combinatorial optimization problem. It has been widely and successfully applied to the practical cases in which multiple traveling individuals (salesmen) share the common workspace (city set).
Jun Li 0011, MengChu Zhou, Qirui Sun, Xianzhong Dai, Xiaolong Yu   +4 more
openaire   +2 more sources

A matheuristic for the traveling salesman problem with positional consistency constraints

International Transactions in Operational Research, EarlyView.
Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley   +1 more source

Complexity indices for the travelling salesman problem and data mining [PDF]

Transactions on Combinatorics, 2012
In this survey paper we extend our previous work on complexity indices for the travelling salesman problem (TSP), summarized in cite{CvCK3}, using graph spectral techniques of data mining. A complexity index is an invariant of an instance $I$ by which we
Dragos Cvetković
doaj