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 354 for “"Traveling Salesman Problem"”.
-
A bicriterion traveling salesman problem
A Bicriterion Traveling Salesman Problem (BCTSP) is introduced. The problems considered include both a cost matrix and a time matrix, and the objective is to minimize both cost and time. A set of undominated solutions will be found by solving the BCTSP. Several exact solution approaches: …
-
The bottleneck traveling salesman problem
<p>A variation of the traveling salesman problem with a bottleneck type objective function is posed. A statistical analysis shows that for large problems in which the costs are independent identically distributed random variables, the optimal objective function value is almost deterministic and can …
-
The symmetric generalized traveling salesman problem
… is a mathematical model known as the Generalized Traveling Salesman Problem (GTSP). The GTSP is a generalization of a well known problem in the field of operations research known as the Traveling Salesman Problem (TSP). The GTSP can be simply described as follows. A salesman is given a list of …
-
The mixing genetic algorithm for traveling salesman problem
The Traveling Salesman Problem (TSP) is one of the most intensively studied NP-Hard problems. The TSP solvers are well-suited for multi-core CPU-based architectures. With the decline in Moore's law, there is an increasing need to port the codes to parallel architectures such as the GPU massively. …
-
Compatible tours for the asymmetric traveling salesman problem
… we consider this question through the study of a problem called the Compatible Tour Problem (CTP). Given an optimal ASEP solution x*, a compatible tour for x* is a directed Hamiltonian cycle that has exactly one edge coming in and one edge going out of the node set (henceforth called a tight set) …
-
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 …
-
Primal Cutting Plane Methods for the Traveling Salesman Problem
Most serious attempts at solving the traveling salesman problem (TSP) are based on the dual fractional cutting plane approach, which moves from one lower bound to the next. This thesis describes methods for implementing a TSP solver based on a primal cutting plane approach, which moves from tour to …
-
Solving Traveling Salesman Problem With a non-complete Graph
One of the simplest, but still NP-hard, routing problems is the Traveling Salesman Problem (TSP). In the TSP, one is given a set of cities and a way of measuring the distance between cities. One has to find the shortest tour that visits all cities exactly once and returns back to the starting city. …
-
Well-Separation Heuristics for the Metric Traveling Salesman Problem
… constrains the structure of tours in the metric Traveling Salesman Problem (TSP). In this work, we investigate the relationship between WSPDs and TSP tours, providing new insights into how well-separation can be leveraged to design efficient heuristics for the metric TSP. Our main result shows …
-
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 …
-
A coordinate oriented algorithm for the traveling salesman problem
"The traveling salesman problem may be stated as follows: "A salesman is required to visit each of n given cities once and only once, starting from any city and returning to the original place of departure. What route should be chosen in order to minimize the total distance traveled?" A new …
-
Greedy randomized adaptive search procedure for traveling salesman problem
… adaptive search procedure (GRASP) to solve the traveling salesman problem (TSP). Starting with nearest neighbor method to construct the initial TSP tour, we apply the 2-opt and the path-relinking method for the initial tour improvement. To increase 2-opt search speed, fixed-radius near neighbor …
-
Traveling salesman problem with time windows and drones (TSPTWD)
… I study a relatively novel variant form of traveling salesman problem (TSP), i.e. traveling salesman problem with time windows and a drone (TSPTWD) or multiple drones (TSPTWmD) with intermediate points. Mathematical models and metaheuristics were successfully developed, and numerical …
-
A Primal-Dual Heuristic for the Traveling Salesman Problem
… formulation and a heuristic for the symmetric Traveling Salesman Problem (TSP) on certain complete graphs having the triangle inequality.</p> <p>TSP models cities and their pairwise connections as vertices and edges between them in a graph. The distances are represented by cost values on edges, …
-
Approximation Algorithms and Heuristics for a Heterogeneous Traveling Salesman Problem
… set of given targets. In such scenarios, routing problems arise naturally where there is a need to plan paths in order to optimally use resources and time. The focus of this thesis is to address a basic optimization problem that arises in this setting. We consider a routing problem where some …
-
Algorithmic and Probabilistic Aspects of the Bipartite Traveling Salesman Problem
… stammt folgende Variante des Handlungsreisendenproblems (Traveling Salesman Problem): Die 2n Knoten eines vollständigen Graphen mit nichtnegativen Kantengewichten seien in zwei gleichgroße Klassen eingeteilt. Man finde einen Hamiltonkreis minimalen Gesamtgewichts, der die Klassen in fester …
Page 1 of 18