Results 21 to 30 of about 8,730 (184)
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
The intermittent travelling salesman problem [PDF]
AbstractIn this paper, we introduce a new variant of the travelling salesman problem, namely the intermittent travelling salesman problem (ITSP), which is inspired by real‐world drilling/texturing applications. In this problem, each vertex can be visited more than once and there is a temperature constraint enforcing a time lapse between two consecutive
Pham, Tú San +2 more
openaire +2 more sources
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
EFFICIENT TOUR PLANNING FOR A MEASUREMENT VEHICLE BY COMBINING NEXT BEST VIEW AND TRAVELING SALESMAN [PDF]
Path planning for a measuring vehicle requires solving two popular problems from computer science, namely the search for the optimal tour and the search for the optimal viewpoint.
J. Gehrung +4 more
doaj +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
Linearity in the Traveling Salesman Problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruce W. Colletti, J. Wesley Barnes
openaire +2 more sources
On the Recoverable Traveling Salesman Problem
In this paper we consider the Recoverable Traveling Salesman Problem (TSP). Here the task is to find two tours simultaneously, such that the intersection between the tours is at least a given minimum size, while the sum of travel distances with respect to two different distance metrics is minimized.
Marc Goerigk, Stefan Lendl, Lasse Wulf
openaire +2 more sources
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
Indoor Traveling Salesman Problem (ITSP) Path Planning
With the growing complexity of indoor living environments, people have an increasing demand for indoor navigation. Currently, navigation path options in indoor are monotonous as existing navigation systems commonly offer single-source shortest-distance ...
Jinjin Yan +3 more
doaj +1 more source

