Results 91 to 100 of about 3,935 (225)
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
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
A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Sumanta Basu, Ghosh, Diptesh
core
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
, 2016 Travelling Salesman Problem (TSP) is one of the most researched combinatorial problems in mathematics. This chapter incorporates chaotic maps in evolutionary algorithms as random number generators and applies it to the TSP.
Zelinka, Ivan +3 more
core
, 2013 Link to publisher's homepage at http://scitation.aip.orgThe standard Traveling Salesman Problem (TSP) is the classical Traveling Salesman Problem (TSP) while Multiple Traveling Salesman Problem (MTSP) is an extension of TSP when more than one salesman is
Siti Jasmida, Jamil +2 more
core +1 more source
Getting Things in Order: An Introduction to the R package seriation
, 2007 Seriation, i.e., finding a linear order for a set of objects given data and a loss or merit function, is a basic problem in data analysis. Caused by the problem's combinatorial nature, it is hard to solve for all but very small sets.
Kurt Hornik +5 more
core +1 more source
, 2000 In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
core
Implementasi Teknik Program Dinamik Pada Traveling Salesman Problem (TSP) [PDF]
, 2019 Kegiatan pengoperasian yang baik dan tepat akan membantu perusahaan menghadapi persaingan dunia usaha yang semakin hari semakin tinggi. Salah satu kegiatan yag dilakukan perusahaan adalah yang bergerak dalam bidang jasa yaitu melakukan pengiriman ...
Mawaddah, Nur
core