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 46 for “"Shortest Route"”.
-
A Genetic Algorithm Approach for Optimized Routing
… of genetic algorithms include determining the shortest route, lowest costs, highest returns etc. in systems defined by multi-variable parameters. This thesis work mainly focuses on finding the shortest distance given the start and end-points, and a set of possible constraints. These constraints …
-
Dirbtinės bičių kolonijos algoritmo keliaujančio pirklio uždaviniui spręsti lygiagretinimas /
… formulated as follows: the task is to find the shortest route by which the travelling salesman would visit all the required cities once and return to his starting city. Many exact and approximate algorithms have been devised to solve this problem. One category of approximate algorithms is called …
-
Topics in stochastic processes with special reference to first passage percolation theory
… form is the randomised version of the well-known shortest route problem. It thus has several important physical applications. Ordinary percolation theory is but a special case of this more general problem which we formulate as follows. </p> <p>To each arc of an arbitrary, countably infinite, …
-
Optimal stochastic paths
<p>A shortest-route algorithm for finite networks is modified for application to path-dependent finite networks and to stochastic networks. The type of stochastic network considered has a "capture" probability associated with each node;The problem of finding a path of minimum expected value on a …
-
MBA-DRR: A Delay-Reducing Routing Protocol for Multi-Beam Directional Antennas in Multi-Hop Ad Hoc Networks
… minimization. Solving this model shows that the routes that are selected for the different flows need to have certain key characteristics that depart from the widespread traditional shortest-route philosophy. Based on these characteristics, we design, in the fourth step, an MBA-Delay-Reducing …
-
Evaluation of a Spark-Enabled Genetic Algorithm Applied to the Travelling Salesman Problem
Traveling salesman problem aims to find the shortest route. A salesman travels to each of the cities once. Genetic Algorithm is used for solving this problem, which returns the best solution found showing the distance that can be covered with the minimum cost (shortest path). A Spark-enabled …
-
Probabilistic Modeling of Erroneous Human Response to In-Vehicle Route Guidance Systems: A Domain Decomposition-Based Algorithm
Drivers are generally assumed to follow the shortest route to their destinations prescribed by in-vehicle route navigation systems without mistake. However, it is not uncommon that drivers make mistakes when there are complex intersections along the route to miss turns. Such mistakes would result …
-
The Dutch East India Company and the Straits of Malacca, 1700-1784 : trade and politics in the eighteenth century
… lie on either side of the straits which form the shortest route between the pay of Bengal and the China Sea. Indian, Chinese, Sames and Europeans have at some time all played an active part in the development of this area. This thesis will examine events in these straits during the eighteenth …
-
Evoliuciniai algoritmai. Skruzdžių kolonijų optimizavimo algoritmas /
… Salesman Problem, which requires finding the shortest route through all cities, demonstrates the flexibility and efficiency of the ACO algorithm in logistics. The problem of finding the maximum of a function shows ACO's ability to adapt to varying complexities of functions, while the knapsack …
-
I. A1,3-Strain Enabled Retention of Chirality During Bis-Cyclization of β-Ketoamides: Asymmetric Synthesis and Bioactivity of Salinosporamide A and Derivatives II. Optimization of an Organic Syntheses: Asymmetric Nucleophile-Catalyzed Aldol- Lactonization of Aldehyde Acids
… dissertation, we successfully accomplished the shortest route to date with only a 9-step total synthesis of (–)-salinosporamide A. The conciseness of this strategy arises from the key bis-cyclization of a Beta-keto tertiary amide, amenable to gram scale, constructs both the Gamma-lactam and the …
-
Automated Planners and Planning analysis with Durative Actions
… of day-today life. Whether it is for finding the shortest route of travel in presence of traffic to selection of investment strategies, planning routines are in place to meet the needs of everyone and every machine. Most existing planning domains contain actions, which have common parameters such …
-
Land Leveling Using Optimal Earthmoving Vehicle Routing
… earthmoving vehicle routing. It addresses the Shortest Route Cut and Fill Problem (SRCFP) developed by Henderson, Vaughan, Wakefield and Jacobson [2000]. The SRCFP is a discrete optimization search problem, proven to be NP-hard. The SRCFP describes the process of reshaping terrain through a …
-
Optimization Models for Train Routing in Railyard Networks
… A fundamental problem is to determine the shortest route for a train given its desired initial and final locations on the railyard network. This network has geometrical limitations imposed by switch nodes, as well as constraints imposed by track and train lengths. In other words, depending …
-
Modeling of Consolidation by Household for Emergency Evacuation Events
… that everyone would seek the quickest or shortest route to safety, given a life-threatening situation. Observations, however, show that a large percentage of the population does not seek the quickest route to safety. Parents may move toward dangers to pick up their children from schools. …
-
Euristinių algoritmų palyginimas keliaujančio pirklio uždaviniui /
… objective of this problem is to construct the shortest route between a given number of cities, visiting each city once, and returning to the city in which the journey began. In this paper, the following heuristic algorithms for TSP are implemented and compared: a convexhull cheapest insertion …
-
„Mask R-CNN“ regionais pagrįsto giliojo konvoliucinio neuroninio tinklo efektyvumo didinimo tyrimas /
… cell detection in photos, etc.), transportation (route planning, finding the shortest route, etc.) and others. The Mask-RCNN network is used to address these issues. Mask R-CNN is a deep convolutional neural network used to solve the problem of instance segmentation. Neural networks have many …
-
Impairment aware cycle based routing algorithm (IACBRA)
… increase the success rate of finding the cyclic route with desired set of nodes. The heuristic algorithm in this paper utilizes Breadth First Search and Tree construction algorithms to find a least cost and shortest route between nodes. The experimental results show that our algorithm has lower …
-
PLANNING BICYCLE INFRASTRUCTURE BASED ON THE QUICKEST OR EASIEST ROUTE METHOD
… bicycle models assume average speed along the route and among routes and that travel time is proportional to distance. There is no method that determines realistic cycling time based on change in speed due to topography. My research proposes a model for the development of bicycle infrastructure …
-
Creating a seamless geodatabase for water infrastructure on the Potchefstroom Campus
… relationships and the capability to perform the shortest route analysis.
-
User optimal policies for a stochastic transportation network
… users in a network individually choose the best (shortest) route for themselves. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. We study this network system in the setting of both state-dependent routing and …
Page 1 of 3