Results 21 to 30 of about 5,636,127 (168)
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
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
TSP - Infrastructure for the Traveling Salesperson Problem [PDF]
The traveling salesperson or salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city.
Kurt Hornik +3 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
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
Modeling of transportation logistics processes for the urban environment [PDF]
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
Ant colony optimization with direct communication for the traveling salesman problem [PDF]
This article is posted here with permission from IEEE - Copyright @ 2010 IEEEAnts in conventional ant colony optimization (ACO) algorithms use pheromone to communicate.
Yang, S +5 more
core +1 more source
New techniques for cost sharing in combinatorial optimization games [PDF]
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
Caprara, A +3 more
core +4 more sources
Traveling Salesman Problem with Transportation [PDF]
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
Solving MTSP with Two-stage SA and GA Based on Spark [PDF]
A two-stage KSAGA algorithm combining Spark-based simulated annealing and genetic algorithms was proposed for the single-depot multiple traveling salesman problem with minimum total path length. In the first stage, the multiple traveling salesman problem
SUN Jian, LIU Pin, LI Hao, CHEN Pan
doaj +1 more source

