Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 96 for “"Traveling salesman"”.
-
Traveling salesman path problems
In the Traveling Salesman Path Problem, we are given a set of cities, traveling costs between city pairs and fixed source and destination cities. The objective is to find a minimum cost path from the source to destination visiting all cities exactly once. The problem is a generalization of the …
-
Probabilistic Traveling Salesman Problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1985.
-
Decision Transformer-based Traveling Salesman Tour Generation
… methods, research in classic problems like the Traveling Salesman Problem (TSP) is receiving a resurgence of popularity. One of the biggest goals in this renewed interest is to create a model that can not only outperform state-of-the-art heuristic solvers in speed for trivial sizes, but also …
-
Generalized partition crossover for the traveling salesman problem
The Traveling Salesman Problem (TSP) is a well-studied combinatorial optimization problem with a wide spectrum of applications and theoretical value. We have designed a new recombination operator known as Generalized Partition Crossover (GPX) for the TSP. GPX is unique among other recombination …
-
GPU accelerated Hungarian algorithm for traveling salesman problem
In this thesis, we present a model of the Traveling Salesman Problem (TSP) cast in a quadratic assignment problem framework with linearized objective function and constraints. This is referred to as Reformulation Linearization Technique at Level 2 (or RLT2). We apply dual ascent procedure for …
-
Approximation algorithms for variants of the traveling salesman problem
The traveling salesman problem, hereafter abbreviated and referred to as TSP, is a very well known NP-optimization problem and is one of the most widely researched problems in computer science. Classical TSP is one of the original NP - hard problems [1]. It is also known to be NP - hard to …
-
The Traveling Salesman Problem and orienteering for kinodynamic vehicles
The Traveling Salesman Problem is a major foundational problem in the fields of Computer Science, Operations Research, and Applied Mathematics, in which an agent wants to visit a set of target points with the shortest path possible. This problem is of the highest interest both theoretically in …
-
The Traveling Salesman Problem for Systems with Dynamic Constraints
The Traveling Salesman Problem (TSP) is a foundational problem in the fields of theoretical computer science and optimization in which an agent is tasked with visiting a set of 𝑛 target locations (in any order) in the shortest amount of time, either on a graph or in a space. As this problem is …
-
Genetic algorithms for the traveling salesman problem using edge assembly crossovers
… make up a genetic algorithm is reviewed. The traveling salesman problem is defined. The EAX as an algorithm within an algorithm is explained. The crossover's implementation is original and is listed. The use of the graphic user interface, TSP View, used to run algorithms is explained as well …
-
Optimizing Traveling Salesman Problem in Multi-Agent Systems with Practical Constraints
The Traveling Salesman Problem (TSP) is a fundamental challenge in multi-agent systems, particularly in task allocation scenarios. Traditional models considering the unconstrained multi-agent TSP, which require multiple salesmen to visit all customers collectively, often fail to produce feasible …
-
Algorithms for a scheduling application of the Asymmetric Traveling Salesman Problem.
Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
-
A group theoretic-implicit enumeration algorithm for the traveling salesman problem.
Massachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1968. M.S.
-
Solving the Traveling Salesman Problem via Semantic Segmentation with Convolutional Neural Networks
The Traveling Salesman Problem (TSP) is a problem that has been formally studied since the 1930s and attracts great theoretical and practical interest. The theoretical aspects are particularly interesting as the TSP is an NP-hard problem and exact solutions for large TSPs are difficult to obtain. …
-
A central facilities location problem involving traveling salesman tours and expected distances
… a significant facilities location problem, the traveling salesman location problem, and to develop several heuristic solution procedures for determining minimum distance locations. Despite the wide applicability of the traveling salesman location problem, a survey of the facilities location …
-
A Hybrid Lehmer Code Genetic Algorithm and Its Application on Traveling Salesman Problems
<p>Traveling Salesman Problems (TSP) is a widely studied combinatorial optimization problem. The goal of the TSP is to find a tour which begins in a specific city, visits each of the remaining cities once and returns to the initial cities such that the objective functions are optimized, typically …
-
Experiences with a synchronous parallel simulated annealing algorithm for the traveling salesman problem
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1990.
Page 1 of 5