Results 91 to 100 of about 15,296 (207)
A grid-based ant colony algorithm for automatic 3D hose routing [PDF]
Ant Colony Algorithms applied to difficult combinatorial optimization problems such as the traveling salesman problem (TSP) and the quadratic assignment problem.
Fernando, WAC +2 more
core +2 more sources
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
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
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
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
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
EVALUASI KINERJA ALGORITMA TRAVELING SALESMAN PROBLEM DENGAN TEKNIK PEMROGRAMAN DINAMIK [PDF]
, 2008 Traveling Salesman Problem (TSP) dapat diilustrasikan sebagai perjalanan seorang salesman yang harus melalui semua kota yang dituju dengan jarak terpendek, dimana setiap kota hanya boleh dilalui satu kali.
Ernastuti, Ernastuti +2 more
core
Implementing Tabu Search to Exploit Sparsity in ATSP Instances [PDF]
Real life traveling salesman problem (TSP) instances are often large,sparse, and asymmetric. Conventional tabu search implementations for the TSP that have been reported in the literature, almost always deals with small, dense and symmetric instances. In
Ghosh, Diptesh +2 more
core
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
The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial
, 2017 6 ...
openaire +2 more sources