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 13 of 13 for “"Traveling salesman problems"”.
-
Probabilistic Traveling Salesman Problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1985.
-
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 …
-
Online optimization problems
In this thesis, we study online optimization problems in routing and allocation applications. Online problems are problems where information is revealed incrementally, and decisions must be made before all information is available. We design and analyze algorithms for a variety of online problems, …
-
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 …
-
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 …
-
Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems
… to address intractable discrete optimization problems. Many well-known local search algorithms can be formulated as GHC algorithms, including simulated annealing, threshold accepting, Monte Carlo search, and pure local search (among others). This dissertation develops a mathematical framework …
-
Route optimization under uncertainty for Unmanned Underwater Vehicles
… of the tasks, then the UUV only needs to solve a traveling salesman problem to find the best order. We focus on a tightly constrained situation, where the UUV must choose which tasks to perform to collect the highest reward. In prize collecting traveling salesman problems, authors are often …
-
A Differential Evolution Algorithm for Generic Combinatorial Optimization Problems
Combinatorial optimization problems (COPs) are well-known NP-hard realistic ones. Due to the drawbacks of existing approaches, many researchers proposed different evolutionary algorithms (EAs) for solving them. Differential evolution (DE) is primarily used to solve continuous-based optimization …
-
Scalable Autonomous Operations of Unmanned Assets
… of multiple UAVs using GA based multiple Traveling Salesman Problem (mTSP) which is solved by dividing into $m$ number of Traveling Salesman Problems (TSP) using two region division methods such as Uniform Region Division (URD) and K-means Voronoi Region Division (KVRD). The topic of the …
-
The Application of a Genetic Algorithm to a Scheduling Problem
… in an attempt to optimize complex scheduling problems as a way to reduce costs. These scheduling problems are often difficult to solve because of their combinatorial nature. Many Civil Engineering problems deal with the logistics of coordinating the movement of goods or people between various …
-
Mother Tree Optimization for Solving Continuous and Discrete Optimization Problems
Continuous and discrete optimization problems play a signi cant role in di erent academic and industrial disciplines. The main objective of a constraint optimization process is to nd a solution for a problem, that satis es a set of constraints while optimizing a given objective function. The exact …
-
A Disassembly Optimization Problem
… which are usually encountered in the well-known traveling salesman problems. Based on these SECs, a new valid formulation for asymmetric traveling salesman problem (ATSP) was developed. The ATSP formulation was further extended to obtain a valid formulation for the precedence constrained ATSP. A …
-
Entropy-based framework for combinatorial optimization problems and enabling the grid of the future
… a series of combinatorially complex optimization problems, while the second part is concerned with robust and scalable control architecture for a network of paralleled converter/inverter systems (DC/AC microgrids). Combinatorial optimization problems arise in many applications in various forms in …