Results 21 to 30 of about 166,209 (267)
Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm
Biomimetics, 2023 The min-max clustered traveling salesmen problem (MMCTSP) is a generalized variant of the classical traveling salesman problem (TSP). In this problem, the vertices of the graph are partitioned into a given number of clusters and we are asked to find a ...
Xiaoguang Bao +3 more
doaj +1 more source
EFFICIENT TOUR PLANNING FOR A MEASUREMENT VEHICLE BY COMBINING NEXT BEST VIEW AND TRAVELING SALESMAN [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2021 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
Optimization Approaches for the Traveling Salesman Problem with Drone
Transportation Science, 2016 The fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last mile to their customers. One technology-enabled opportunity that recently has received much attention
Niels A. H. Agatz, P. Bouman, M. Schmidt
semanticscholar +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
A Niching Memetic Algorithm for Multi-Solution Traveling Salesman Problem
IEEE Transactions on Evolutionary Computation, 2020 Multi-solution problems extensively exist in practice. Particularly, the traveling salesman problem (TSP) may possess multiple shortest tours, from which travelers can choose one according to their specific requirements.
Ting Huang +4 more
semanticscholar +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
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
GeneTS : a relational-functional genetic algorithm for the traveling salesman problem [PDF]
, 1997 This work demonstrates a use of the relational-functional language RelFun for specifying and implementing genetic algorithms. Informal descriptions of the traveling salesman problem and a solution strategy are given.
Markus Perling
openalex +4 more sources