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 81 for “"Traveling salesman problem"”.
-
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. …
-
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.
-
Application of traveling salesman problem in generating a collision-free tool path in drilling
… introduces a new algorithm based on Travelling Salesman Problem (TSP). The proposed local search algorithm generates an optimum collision free tool path in drilling operations. The developed optimization algorithm considers multiple constraints such as location of tool origin and presence of …
-
The traveling salesman problem with multiple drones : an optimization model for last-mile delivery
… literature currently exists on vehicle routing problems, research integrating drones as a supplement to these routing problems is scarce. This thesis explores the feasibility of deploying drones to the last mile, by modeling the cost of serving customers with one truck and multiple drones in the …
-
Tight Flow-Based Formulations for the Asymmetric Traveling Salesman Problem and Their Applications to some Scheduling Problems
… new flow-based formulations for the asymmetric traveling salesman problem (ATSP) and to the demonstration of their applicability in effectively solving some scheduling problems. The ATSP is commonly encountered in the areas of manufacturing planning and scheduling, and transportation logistics. …
-
Assessment of genetic algorithm based assignment strategies for unmanned systems using the multiple traveling salesman problem with moving targets
… fixed-base defense systems. One solution to this problem is weaponizing friendly unmanned systems to hunt and kill hostile unmanned systems. However, the assignment and path planning of these “Hunter-Killer” systems to incoming hostile unmanned systems, in a multiple friendly versus multiple enemy …
-
Attention-Based Learning for Combinatorial Optimization
Combinatorial optimization problems, such as the Traveling Salesman Problem (TSP), have been studied for decades. However, with the rise of reinforcement learning in recent years, many of these problems are being revisited as a way to gauge these new models in different environments. In this …
-
Modeling, Analysis, and Exact Algorithms for Some Biomass Logistics Supply Chain Design and Routing Problems
… focuses on supply chain design and logistics problems with emphasis on biomass logistics and routing problems. In biomass logistics, we have studied problems arising in a switchgrass-based bio-ethanol supply chain encountered in the Southeast, and a corn stover harvest scheduling problem faced …
-
Variations on the integrated inventory and transportation problem
… related to an efficient algorithm for the traveling salesman problem and route failures in fixed partition routing problems with stochastic demand"--Abstract, page iii.
Page 1 of 5