Results 21 to 30 of about 2,267 (186)
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
Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem [PDF]
ISPRS International Journal of Geo-Information, 2018 The Equality-Generalized Travelling Salesman Problem (E-GTSP), which is an extension of the Travelling Salesman Problem (TSP), is stated as follows: given groups of points within a city, like banks, supermarkets, etc., find a minimum cost Hamiltonian cycle that visits each group exactly once.
Mohammed Zia +2 more
openaire +3 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
Indoor Traveling Salesman Problem (ITSP) Path Planning
ISPRS International Journal of Geo-Information, 2021 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
Traveling salesman problem with a center [PDF]
Physical Review E, 2005 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 $
Lipowski, Adam, Lipowska, Dorota
openaire +3 more sources
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
The geometric maximum traveling salesman problem [PDF]
Journal of the ACM, 2003 We consider the traveling salesman problem when the cities are points in ℝ d for some fixed d and distances are computed according to geometric distances, determined by some norm.
Barvinok, A. +5 more
openaire +4 more sources
The multi-stripe travelling salesman problem [PDF]
Annals of Operations Research, 2017 In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with q larger than 1, the objective function sums the costs for travelling from one city to each of the next q cities along the tour.
Çela, Eranda +2 more
openaire +6 more sources
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
Traveling Salesman Problem with Transportation [PDF]
Computer Science Journal of Moldova, 2006 Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined – a synthesis of classical TSP and classical Transportation Problem.
Valeriu Ungureanu
doaj