Results 21 to 30 of about 11,422 (178)
Implementation of Fuzzy Intuitionistic Algorithm for Traveling Salesman Problem
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
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
Traveling salesman problem with a center [PDF]
We study a travelling salesman problem where the path is optimized with a cost function that includes its length $L$ as well as a certain measure $C$ of its distance from the geometrical center of the graph. Using simulated annealing (SA) we show that such a problem has a transition point that separates two phases differing in the scaling behaviour of $
Adam Lipowski, Dorota Lipowska
openaire +3 more sources
Exploiting planarity in separation routines for the symmetric traveling salesman problem [PDF]
At present, the most successful approach for solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut.
Adam N. Letchford +5 more
core +1 more source
The Double Traveling Salesman Problem with Multiple Stacks and a Choice of Container Types
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
Reassembling Trees for the Traveling Salesman [PDF]
minor revision, final version, to appear in SIAM Journal of Discrete Mathematics, please use color ...
openaire +3 more sources
Traveling salesman path problems [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lam, F., Newman, A.
openaire +3 more sources
Computing compatible tours for the traveling salesman problem [PDF]
We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the subtour relaxation, yielding a solution x*, and then find the best tour x-bar that is 'compatible' with x*, where compatible means that every subtour ...
Fortini, M +14 more
core +1 more source
Variants of the Traveling Salesman Problem
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
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

