Results 91 to 100 of about 21,266 (220)
Genetic Algorithm for Optimizing Traveling Salesman Problems with Time Windows (TSP-TW)
International Journal of Artificial Intelligence & Robotics (IJAIR), 2019 The concept of Traveling Salesman Problem (TSP) used in the discussion of this paper is the Traveling Salesman Problem with Time Windows (TSP-TW), where the time variable considered is the time of availability of attractions for tourists to visit. The algorithm used for optimizing the solution of Traveling Salesman Problem with Time Windows (TSP-TW) is
Juwairiah, Juwairiah +4 more
openaire +2 more sources
Revista Produção Online, 2013 The Clustered Traveling Salesman Problem (CTSP) is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and objective is to find a minimum cost Hamiltonian cycle such that the ...
Mário Mestria
doaj +1 more source
A Comparison of Algorithms for Finding an Efficient Theme Park Tour
Journal of Applied Mathematics, 2018 The problem of efficiently touring a theme park so as to minimize the amount of time spent in queues is an instance of the Traveling Salesman Problem with Time-Dependent Service Times (TSP-TS). In this paper, we present a mixed-integer linear programming
Elizabeth L. Bouzarth +6 more
doaj +1 more source
Genetiniai algoritmai komivojažieriaus uždaviniui: negatyvieji ir pozityvieji aspektai*
Informacijos Mokslai, 2009 Šiame straipsnyje nagrinėjami klausimai, susiję su genetinių algoritmų taikymu, sprendžiant gerai žinomą kombinatorinio optimizavimo uždavinį – komivojažieriaus uždavinį (KU) (angl. traveling salesman problem).
Alfonsas Misevičius +3 more
doaj +1 more source
TSP Solver: An Integrated Framework for Solving Traveling Salesman Problems Consistent with TSPLIB
, 2017 The Traveling Salesman Problem (TSP) is the subject of study in operational research for more than 30 years. The TSP is considered as NP-complete; consequently, many heuristic and metaheuristic algorithms have been developed to cope with the intractable nature of the problem.
Avşar, Bihter +2 more
openaire +2 more sources
Jurnal Inovasi Teknik Industri, 2023 Travelling Salesman Problem (TSP) merupakan permasalahan penentuan rute terpendek yang diawali dari titik start untuk mengunjungi sekumpulan titik tepat sekali dan diakhiri dengan kembali ke titik start. Evolutionary Algorithm (EA) merupakan sebuah metaheuristic yang dapat diaplikasikan pada berbagai permasalahan optimasi, termasuk TSP.
openaire +1 more source
TSP – Infrastructure for the Traveling Salesperson Problem
Journal of Statistical Software, 2007 The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city ...
Michael Hahsler, Kurt Hornik
doaj
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)The Traveling Salesman Problem (TSP) is a problem that represents a difficult combinatorial optimization problem starting from practical problems. The ant colony optimization (ACO) algorithm is implemented in several topics, particularly in solving ...
Gabriel Bodhi, Charleen, Devi Fitrianah
doaj +1 more source
The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial
, 2017 6 ...
openaire +2 more sources
Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP)
, 2012 In this paper, the author proposes optimal tree as a "gauge" for the generation of the initial population at random in the Genetic Algorithms (GA) to benchmark against the good and the bad parent tours. Thus, without having the so-called bad parent tours in the initiate population, it will speed up the GA.
openaire +2 more sources