Results 21 to 30 of about 72,966 (206)
Implementation of Fuzzy Intuitionistic Algorithm for Traveling Salesman Problem
EAI Endorsed Transactions on Energy Web, 2018 Traveling Salesman Problem is one of the motivating problem in classical and advanced Optimization. In this work, theoretical analysis and relative study of Traveling Salesman Problem in Intuitionistic Fuzzy Optimization is examined with real examples.
Anitha. N, C. Vijayalakshmi
doaj +1 more source
Optimasi Asymmetric City Tour di Kota Kediri Menggunakan Ant Colony System
Jurnal Nasional Teknik Elektro dan Teknologi Informasi, 2020 Kota Kediri merupakan kota persinggahan lalu lintas transportasi dan memiliki sejumlah potensi di bidang pariwisata, pendidikan, dan industri. Dengan demikian, Kota Kediri menjadi salah satu kota yang sangat mungkin untuk berkembang dan ramai dikunjungi.
Abidatul Izzah +3 more
doaj +1 more source
The Double Traveling Salesman Problem with Multiple Stacks and a Choice of Container Types
Mathematics, 2020 The double traveling salesman problem with multiple stacks involves the transportation of goods between two regions. In one region, a vehicle carrying a container visits customers, where pallets of goods are loaded into the container.
Lars Magnus Hvattum +2 more
doaj +1 more source
Variants of the Traveling Salesman Problem
Studies in Business and Economics, 2019 This paper includes an introduction to the concept of spreadsheet optimization and modeling as it specifically applies to combinatorial problems. One of the best known of the classic combinatorial problems is the “Traveling Salesman Problem” (TSP).
Patterson Mike, Friesen Daniel
doaj +1 more source
A Memetic Algorithm for the Generalized Traveling Salesman Problem [PDF]
, 2009 The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from ...
Gutin, Gregory, Karapetyan, Daniel
core +4 more sources
Logic, 2019 Traveling Salesman Problem is a problem solving used in finding the shortest route to visit all nodes at once and then return to the initial node. Troubleshooting of the Traveling Salesman Problem using the Brute Force algorithm.
Indri Ariyanti +2 more
doaj +1 more source
The statistical mechanics of combinatorial optimization problems with site disorder [PDF]
, 2005 We study the statistical mechanics of a class of problems whose phase space is the set of permutations of an ensemble of quenched random positions. Specific examples analyzed are the finite temperature traveling salesman problem on several different ...
A. Barvinok +9 more
core +4 more sources
An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem
Mathematics, 2023 The ant colony algorithm faces dimensional catastrophe problems when solving the large-scale traveling salesman problem, which leads to unsatisfactory solution quality and convergence speed.
Kezong Tang +4 more
doaj +1 more source
Modeling of transportation logistics processes for the urban environment [PDF]
E3S Web of Conferences, 2019 The article deals with the approach to modeling the road transport movement in large cities (with a population of over 100 thousand people) for the delivery of goods from a large warehouse to stores belonging to a trading network company, with the task ...
Romanov Petr, Romanova Irina
doaj +1 more source
Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem [PDF]
, 2010 The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some other problems.
Balas +24 more
core +3 more sources