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 22 for “"Travelling Salesman Problem"”.
-
Analysis of a combinatorial approach to the travelling salesman problem
… p-optimality -- Ch. 3. Algorithms for the travelling salesman problem -- Ch. 4. Discussion.
-
An examination of heuristic algorithms for the travelling salesman problem
… is discussed. Published heuristics for the Travelling Salesman Problem (TSP) were reviewed and morphological boxes were used to develop new heuristics for the TSP. New and published heuristics were programmed for symmetric TSPs where the triangle inequality holds, and were tested on micro …
-
On the Stochastic Travelling Salesman problem for the Dubin's vehicle
In this thesis, I solve the following problem: Given a rectangular region R in which n (n is large) targets are distributed according to some continuous or piece-wise continuous distribution, find the length of the optimal Stochastic Travelling Salesperson tour of a Dubin vehicle over the n targets …
-
A more robust ant colony learning algorithm : with application to travelling salesman problem
Graph problems model many real life applications, where the quantity of the nodes often changes with time. In such graphs, the evaluation of shortest tour is important as various guiding and navigation systems use this information. Nodes of a graph, in many applications, often change over time, and …
-
Maximum-entropy principle approach to the multiple travelling salesman problem and related problems
… principle as a heuristic for the multiple travelling salesman problem. This is a computationally complex problem which requires special treatment by conventional optimization techniques. Specific focus is given to developing a generalized framework for this problem that can be applied to …
-
Application of mixed-integer programming in chemical engineering
… formulations developed for two well-studied problems, one with a central role in the area of Optimisation, the other of great interest to the chemical industry. These are the Travelling Salesman Problem and the problem of scheduling cleaning actions for heat exchanger networks subject to …
-
Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation
… for classes of combinatorial optimisation problems. We introduce a method, called dynasearch, of constructing new neighbourhoods, and of viewing some previously derived exponentially sized neighbourhoods which are searchable in polynomial time. We produce new neighbourhoods by combining …
-
Approaches for solving some scheduling and routing problems
… for three difficult combinatorial optimisation problems.<br/>The supply ship travelling salesman problem is a simplification of a situation faced by a naval logistics coordinator who must direct a support vessel tasked with resupplying ships in a fleet. It is a generalisation of the travelling …
-
A mathematical programming based model and algorithm for a two stage production process
… exploit the inherent generalized assignment and travelling salesman problem substructures in the model. The algorithm is computationally intensive and generates (near) optimal solutions with a reasonable amount of effort. Heuristic algorithmic procedures for the generation of good solutions for …
-
3D Path Planning for Radiation Scanning of Cargo Containers
… from people. This thesis attempts to solve the problem of autonomous search by using an initial 3D scan of the search area to input into a 3D path planning algorithm to generate a flight path that will sufficiently scan the search area while minimizing flight time. Coverage is a main area of …
-
Application of traveling salesman problem in generating a collision-free tool path in drilling
… This thesis 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 …
-
View Point Planning for Inspecting Static and Dynamic Scenes with Multi-Robot Teams
We study the problem of viewpoint planning in static and dynamic scenes using multi-robot teams. This work is motivated by two applications: bridge inspection and environmental monitoring using Unmanned Aerial Vehicles. For static scenes, we are given a set of target points in a polygonal …
-
Polynomial time optimal algorithm for stencil row planning in e-beam lithography
… However, the top-level 2D stencil planning problem has been proven to be an NP-hard problem. As its most essential step, the 1D row ordering is believed hard as well, and no polynomial time optimal solution has been provided so far. Previous research formulates the problem as the travelling …
-
Optimizing Data Compression via Data Reordering Strategies
… other employs a heuristic-based solver for the Travelling Salesman Problem (TSP). The data encoding process enables the identification of internal repetitive patterns within the original datasets. Records with similar features are grouped together and compressed into a much smaller size after …
-
Evolutionary computation applied to combinatorial optimisation problems
… (GA) when applied to hard optimisation problems. In particular it examines the problem of selecting and implementing appropriate genetic operators in order to meet the validity constraints for constrained optimisation problems. The problem selected is the travelling salesman problem …
-
Human-UAV Collaborative Search with Concurrent Flights and Re-Tasking
… station uses a nearest neighbor solution to the travelling salesman problem and a wavefront path planner to create a path for the low altitude drone. The software architecture is based on the Robot Operating System (ROS), and the GCS uses the MAVLink messaging protocol to communicate with the …
-
The networked polis: Unravelling Magnesia's place in the Hellenistic world through the digital reconstruction of journeys.
… list. The network is applied to solving the travelling salesman problem under constraints consistent with the limited historical knowledge of the Magnesian journeys, yielding plausible itineraries and timings. I demonstrate that relatively simple quantitative journey planning techniques could …
-
The Plant Propagation Algorithm for Discrete Optimisation
… heuristics for the so called NP-hard problems of optimisation. A particular algorithm which has been recently introduced and shown to be effective in continuous optimisation is the Plant Propagation Algorithm or PPA. Here, we intend to extend it to cope with combinatorial optimisation. …
-
Vehicle routing on real road networks
The vehicle routing problem (VRP) has received particular attention, in the field of transportation and logistics. Producing good solutions for the problem is of interest both commercially and theoretically. Reliable solutions to real life applications require an approach based on realistic …
-
Intelligent Digital Twin for Optimizing Warehouse Operations: Embedded Optimization Components for Enhanced Order-Picking Efficiency
… simulate real-world systems and optimize complex problems. By incorporating optimization and AI-based techniques, DTs facilitate data analysis and accurate simulations, enabling more efficient decision-making. An intelligent warehouse digital twin can simulate the order-picking process, generate …
Page 1 of 2