Log in

Relevant bibliographies by topics / Shortest paths / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Shortest paths.

Dissertations / Theses on the topic 'Shortest paths'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Shortest paths.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Nagubadi, RadhaKrishna. "K Shortest Path Implementation." Thesis, Linköpings universitet, Databas och informationsteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451.

Full text

Abstract:

The problem of computing K shortest loopless paths, or ranking of the K shortest loopless paths between a pair of given vertices in a network is a well-studied generalization of shortest path problem. The K shortest paths problem determines not only one shortest path but the K best shortest paths from s to t in an increasing order of weight of the paths. Yen’s algorithm is known to be the efficient and widely used algorithm for determining K shortest loopless paths. Here, we introduce a new algorithm by modifying the Yen’s algorithm in the following way: instead of removing the vertices and th

APA, Harvard, Vancouver, ISO, and other styles

2

Shinn, Tong-Wook. "Combining Shortest Paths, Bottleneck Paths and Matrix Multiplication." Thesis, University of Canterbury. Computer Science and Software Engineering, 2014. http://hdl.handle.net/10092/9740.

Full text

Abstract:

We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) problems, and can be solved by utilising matrix multiplication. Thus in our research of the SP-AF problem, we also make a series of contributions to the underlying topics of the SP problem, the BP problem, and matrix multiplication. For the topic of matrix multiplication we show that on an n-by-n two dimensional (2D) square mesh array, two n-by-n matrices can be multiplied

APA, Harvard, Vancouver, ISO, and other styles

3

Zhao, Hong Jun. "Towards online shortest paths computation." Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b2550689.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chénier, Christian. "Shortest paths in weighted polygons." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/10034.

Full text

Abstract:

Consider a polygon P and two points $p,\ q\in P.$ Suppose that to move from p to q, we can travel along the edges of P or through the interior of P. Assume that the speed at which we can travel along the edges of P is one unit per second, and the travel speed through the interior of P is 1/s units per seconds ($s>1$). The problem consists of finding the shortest path between p and q. We solve this problem in O(n) time for convex polygons. For simple polygons, we show two algorithms. The first algorithm runs in O(E log n) time using O(E) space (where E is the size of the visibility of P). The s

APA, Harvard, Vancouver, ISO, and other styles

5

Gao, Guo-Gang. "Planning shortest paths amongst discs." Thesis, McGill University, 1988. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=64080.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Moffat, Alistair. "Fast algorithms for shortest paths." Thesis, University of Canterbury. Computer Science, 1985. http://hdl.handle.net/10092/7926.

Full text

Abstract:

The problem of finding all shortest paths in a non-negatively weighted directed graph is addressed, and a number of new algorithms for solving this problem on a graph of n vertices and m edges are given. The first of these requires in the worst case min { 2mn, nᶟ } + O(n²˙⁵ ) addition and binary comparisons on path and edge costs, improving the previous bound (Dantzig, 1960) of n³ + O(n²logn) operations in a computational model where addition and comparison are the only operations permitted on path costs. The second algorithm presented, and the main result of this thesis, has an expected

APA, Harvard, Vancouver, ISO, and other styles

7

Chase, Melissa. "Shortest Path Problems: Multiple Paths in a Stochastic Graph." Scholarship @ Claremont, 2003. https://scholarship.claremont.edu/hmc_theses/143.

Full text

Abstract:

Shortest path problems arise in a variety of applications ranging from transportation planning to network routing among others. One group of these problems involves finding shortest paths in graphs where the edge weights are defined by probability distributions. While some research has addressed the problem of finding a single shortest path, no research has been done on finding multiple paths in such graphs. This thesis addresses the problem of finding paths for multiple robots through a graph in which the edge weights represent the probability that each edge will fail. The objective is to fin

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, I.-Lin. "Shortest paths and multicommodity network flows." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/23304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Tabatabai, Bijan Oni. "An investigation of shortest paths algorithms." Thesis, Durham University, 1987. http://etheses.dur.ac.uk/6685/.

Full text

Abstract:

In this work, we classify the shortest path problems, review all source algorithms and analyse the different implementations of single source algorithms using various list structures and labelling techniques. Furthermore, we study the Sensitivity Analysis of one-to-all problems and present an algorithm, Senet, for their Post Optimality Analysis. Senet determines all the critical values for the weight of an arc (which could be optimal, non-optimal or non-existant) at which the optimal solution changes. Senet also provides the updated optimal solution for every range formed by two successive cri

APA, Harvard, Vancouver, ISO, and other styles

10

Garcia, Renan. "Resource constrained shortest paths and extensions." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/28268.

Full text

Abstract:

Thesis (M. S.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.<br>Committee Co-Chair: George L. Nemhauser; Committee Co-Chair: Shabbir Ahmed; Committee Member: Martin W. P. Savelsbergh; Committee Member: R. Gary Parker; Committee Member: Zonghao Gu.

APA, Harvard, Vancouver, ISO, and other styles

11

Lorek, David Randolph. "Approximating shortest paths in large networks /." Electronic version (PDF), 2005. http://dl.uncw.edu/etd/2005/lorekd/davidlorek.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Cuerington, Andre M. "The shortest path problem in the plane with obstacles : bounds on path lengths and shortest paths within homotopy classes." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/28532.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Li, Dan. "Shortest paths through a reinforced random walk." Thesis, Uppsala universitet, Analys och tillämpad matematik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-153802.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Magnanti, Thomas L., and Prakash Mirchandani. "Shortest Paths, Network Design and Associated Polyhedra." Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5186.

Full text

Abstract:

We study a specialized version of network design problems that arise in telecommunication, transportation and other industries. The problem, a generalization of the shortest path problem, is defined on an undirected network consisting of a set of arcs on which we can install (load), at a cost, a choice of up to three types of capacitated facilities. Our objective is to determine the configuration of facilities to load on each arc that will satisfy the demand of a single commodity at the lowest possible cost. Our results (i) demonstrate that the single-facility loading problem and certain "comm

APA, Harvard, Vancouver, ISO, and other styles

15

Persson, Nicklas. "Shortest paths and geodesics in metric spaces." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-66732.

Full text

Abstract:

This thesis is divided into three part, the first part concerns metric spaces and specically length spaces where the existence of shortest path between points is the main focus. In the second part, an example of a length space, the Riemannian geometry will be given. Here both a classical approach to Riemannian geometry will be given together with specic results when considered as a metric space. In the third part, the Finsler geometry will be examined both with a classical approach and trying to deal with it as a metric space.

APA, Harvard, Vancouver, ISO, and other styles

16

Kholondyrev, Yury. "Optimistic and pessimistic shortest paths on uncertain terrains." Thesis, University of British Columbia, 2007. http://hdl.handle.net/2429/32577.

Full text

Abstract:

In the Uncertain Terrain Shortest Path problem we consider a triangulated terrain with vertices having uncertain Z-coordinates: each vertex is denned as a (x,y,z―,z+) tuple, where the z coordinate of a vertex is uncertain and can be anywhere in the range from z― to z+. We are looking for a path (defined by its projection to the XY- plane) such that, over all possible terrains, the path is as short as possible. We look at both pessimistic (terrain arranges itself to maximize the length of the path that we choose) and optimistic (terrain takes the state that minimizes the length of our path) sce

APA, Harvard, Vancouver, ISO, and other styles

17

Péchaud, Mickaël. "Shortest paths calculations, and applications to medical imaging." Phd thesis, Ecole Normale Supérieure de Paris - ENS Paris, 2009. http://tel.archives-ouvertes.fr/tel-00843997.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Pisaruk, Fabio. "K-menores caminhos." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-14072009-185725/.

Full text

Abstract:

Tratamos da generalização do problema da geração de caminho mínimo, no qual não apenas um, mas vários caminhos de menores custos devem ser produzidos. O problema dos k-menores caminhos consiste em listar os k caminhos de menores custos conectando um par de vértices. Esta dissertação trata de algoritmos para geração de k-menores caminhos em grafos simétricos com custos não-negativos, bem como algumas implementações destes.<br>We consider a long-studied generalization of the shortest path problem, in which not one but several short paths must be produced. The k-shortest (simple) paths problem is

APA, Harvard, Vancouver, ISO, and other styles

19

Tian, Lin. "Improved Shortest Path Algorithms by Dynamic Graph Decomposition." Thesis, University of Canterbury. Computer Science and Software Engineering, 2006. http://hdl.handle.net/10092/1196.

Full text

Abstract:

In this thesis, we introduce three new approaches for solving the single source shortest path (SSSP) problem in nearly acyclic directed graphs, and algorithms based on these approaches. In the first approach, we extend a technique of strongly connected components (sc-components) decomposition by Takaoka [23], and the generalized decomposition approach is called a higher-order decomposition. According to Takaoka's definition of acyclicity, the degree of cyclicity of a graph G, cyc(G), is defined by the maximum cardinality of the strongly connected components of G. Based on the higher-order deco

APA, Harvard, Vancouver, ISO, and other styles

20

Rossolini, Andrea. "Analysis and Implementation of Algorithms for Bicriteria Shortest Paths Problems." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/19617/.

Full text

Abstract:

Questa tesi si pone l'obbiettivo di affrontare ed analizzare un problema di pathfinding partendo da un'analisi di alcuni algoritmi per la ricerca del percorso più breve su normali grafi, per poi ampliare lo studio e concentrarsi su algoritmi che calcolano molteplici percorsi su grafi che utilizzano due pesi per ogni arco. Gli algoritmi per i grafi `bicriteria' (appunto che considerano due pesi su ogni arco) verranno analizzati, implementati e le loro soluzioni confrontate con gli altri algoritmi, al fine di individuare i più efficienti in termini di tempo di elaborazione e quelli che riescono

APA, Harvard, Vancouver, ISO, and other styles

21

Crane, Jerry Allen. "Searching for Shortest and Safest Paths Along Obstacle Common Tangents." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/43782.

Full text

Abstract:

This thesis describes a method for computing globally shortest paths for a point robot in a two-dimensional, orthogonal world composed of convex and concave polygons through the construction of obstacle common tangent visibility graphs. Visibility and intersection testing are based on the orientation of three or more points in the plane, and complex obstacle tangent visibility graphs are constructed using only these orientation relationships. Obstacle common tangents for convex and concave polygonal obstacles are implemented as a computational representation of locally shortest paths. A series

APA, Harvard, Vancouver, ISO, and other styles

22

Wagner, Mitchell James. "Reconstructing Signaling Pathways Using Regular-Language Constrained Paths." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/85044.

Full text

Abstract:

Signaling pathways are widely studied in systems biology. Several databases catalog our knowledge of these pathways, including the proteins and interactions that comprise them. However, high-quality curation of this information is slow and painstaking. As a result, many interactions still lack annotation concerning the pathways they participate in. A natural question that arises is whether or not it is possible to automatically leverage existing annotations to identify new interactions for inclusion in a given pathway. Here, we present RegLinker, an algorithm that achieves this purpose by com

APA, Harvard, Vancouver, ISO, and other styles

23

Chen, Lijuan. "An efficient method to compute shortest paths in real road network /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202005%20CHEN.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Nannicini, Giacomo. "Point-to-point shortest paths on dynamic time-dependent road networks." Phd thesis, Ecole Polytechnique X, 2009. http://pastel.archives-ouvertes.fr/pastel-00005275.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Turner, Lara Ruth [Verfasser]. "Universal Combinatorial Optimization: Matroid Bases and Shortest Paths / Lara Ruth Turner." München : Verlag Dr. Hut, 2013. http://d-nb.info/1033041297/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Bonaventura, Moreno. "Shortest paths to success : network indicators of performance in innovation ecosystems." Thesis, Queen Mary, University of London, 2017. http://qmro.qmul.ac.uk/xmlui/handle/123456789/24555.

Full text

Abstract:

In this thesis I show how various theories and methodologies borrowed from complexity science, organisation science, and network science can be suitably integrated to provide a comprehensive and interdisciplinary approach to the study of innovation processes. I study the network foundations of success in innovation ecosystems and I conduct several empirical investigations to identify those network characteristics that are expected to correlate with positive outcomes and success. I assess the extent to which the diversity and the strength in the networks of relationships boost the performance a

APA, Harvard, Vancouver, ISO, and other styles

27

Wrede, Simon. "Memory efficient Monte Carlo methods for computing shortest paths in stochastic graphs." Thesis, Linköpings universitet, Programvara och system, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-178160.

Full text

Abstract:

Threat modeling for information technology infrastructure can be done using shortest path algorithms in stochastic graphs. By modeling the infrastructure as a graph, potential vulnerabilities may be presented by computing what paths an attacker might take. This thesis project presents and compares two memory efficient algorithms that can be used to solve this problem approximately, the online k-means and sampled k-shortest path algorithm. By computing paths for several different graph types, the two algorithms were compared against a naive algorithm. The online k-means algorithm uses approxima

APA, Harvard, Vancouver, ISO, and other styles

28

Subramanian, Shivaram. "Routing Algorithms for Dynamic, Intelligent Transportation Networks." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/37056.

Full text

Abstract:

Traffic congestion has been cited as the most conspicuous problem in traffic management. It has far-reaching economic,social and political effects. Intelligent Transportation Systems (ITS) research and development programs have been assigned the task of developing sophisticated techniques and counter-measures to reduce traffic congestion to manageable levels, and also achieve these objectives using area-wide traffic management methods. During times of traffic congestion, the traffic network in a transient, time-dynamic state, and resembles a dynamic network. In addition, in the context of ITS,

APA, Harvard, Vancouver, ISO, and other styles

29

Ganugpati, Sridevi V. 1975. "Dynamic shortest paths algorithms : parallel implementations and application to the solution of dynamic traffic assignment models." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/46478.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Vladu, Adrian Valentin. "Shortest paths, Markov chains, matrix scaling and beyond : improved algorithms through the lens of continuous optimization." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/112828.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 289-302).<br>In this thesis, we build connections between classic methods from convex optimization and the modern toolkit from the fast Laplacian solver literature, in order to make progress on a number of fundamental algorithmic problems: *-- We develop a

APA, Harvard, Vancouver, ISO, and other styles

31

Kykuta, Diogo Haruki. "Comparação de algoritmos para o Problema dos K Menores Caminhos." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20032018-003225/.

Full text

Abstract:

O Problema dos K Menores Caminhos é uma generalização do Problema do Menor Caminho, em que desejamos encontrar os K caminhos de menor custo entre dois vértices de um grafo. Estudamos e implementamos algoritmos que resolvem esse problema em grafos dirigidos, com peso nos arcos e que permitem apenas caminhos sem repetição de vértices na resposta. Comparamos seus desempenhos utilizando grafos do 9th DIMACS Implementation Challenge. Identificamos os pontos fortes e fracos de cada algoritmo, e propusemos uma variante híbrida dos algoritmos de Feng e de Pascoal. Essa variante proposta obteve desem

APA, Harvard, Vancouver, ISO, and other styles

32

Çaylak, Kayaturan Gökçe. "Representing shortest paths in graphs using Bloom filters without false positives and applications to routing in computer networks." Thesis, University of Essex, 2018. http://repository.essex.ac.uk/22334/.

Full text

Abstract:

A Bloom filter is data structure for representing sets in a compressed form, which has many applications. Bloom filters save time and space, but produce errors known as false positives. In this thesis, a new approach is suggested. Instead of choosing labels for edges in graphs at random (as is done in the standard Bloom filter approach), labels for edges are chosen based on the graph and the position of an edge in the graph. It is shown that under some assumptions (the graph is known, and only shortest paths are encoded), there will be no false positives leading to a message being delivered to

APA, Harvard, Vancouver, ISO, and other styles

33

Muhandiramge, Ranga. "Maritime manoeuvring optimization : path planning in minefield threat environments." University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2009.0015.

Full text

Abstract:

The aim of the research project that is the subject of this thesis is to apply mathematical techniques, especially those in the area of operations research, to the problem of maritime minefield transit. We develop several minefield models applicable to different aspects of the minefield problem. These include optimal mine clearance, shortest time traversal and time constrained traversal. We hope the suite of models and tools developed will help make mine field clearance and traversal both safer and more efficient and that exposition of the models will bring a clearer understanding of the mine

APA, Harvard, Vancouver, ISO, and other styles

34

Suryasaputra, Robert, and rsuryasaputra@gmail com. "Congestion Removal in the Next Generation Internet." RMIT University. Electrical and Computer Engineering, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080521.114723.

Full text

Abstract:

The ongoing development of new and demanding Internet applications requires the Internet to deliver better service levels that are significantly better than the best effort service that the Internet currently provides and was built for. These improved service levels include guaranteed delays, jitter and bandwidth. Through extensive research into Quality of Service and Differentiated Service (DiffServ) it has become possible to provide guaranteed services, however this turns out to be inadequate without the application of Traffic Engineering methodologies and principles. Traffic Engineering is

APA, Harvard, Vancouver, ISO, and other styles

35

Souza, Marcelo de. "Um método biobjetivo de alocação de tráfego para veículos convencionais e elétricos." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/130509.

Full text

Abstract:

A busca de soluções para a mobilidade urbana que minimizem a agressão do setor de tráfego e transportes ao meio ambiente está cada vez maior. Os veículos elétricos se posicionam como uma alternativa interessante, pois reduzem a emissão de gases poluentes na atmosfera, a poluição sonora e o consumo de petróleo. No entanto, sua limitada autonomia e a escassez de postos de recarga intimidam sua adoção. Por conta disso, políticas governamentais de incentivo têm sido desenvolvidas para a oferta de benefícios a quem optar por um veículo elétrico. Estima-se que dentro de poucas décadas toda a frota u

APA, Harvard, Vancouver, ISO, and other styles

36

Krauter, Michal. "Nejkratší cesty v grafu." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2009. http://www.nusl.cz/ntk/nusl-236740.

Full text

Abstract:

This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue of graph theory with many pracitcal applications. We can divide this problem into two following generalizations: single-source shortest path problem and all-pairs shortest paths problem. This text introduces principles and algorithms for generalizations. We describe both classical and new more efficient methods. It contains information about how some of these algorithms were implemented and offers an experimental comparison of these algorithms.

APA, Harvard, Vancouver, ISO, and other styles

37

Gueye, Fallou. "Algorithmes de recherche d'itinéraires en transport multimodal." Thesis, Toulouse, INSA, 2010. http://www.theses.fr/2010ISAT0042.

Full text

Abstract:

Ce travail de thèse s’est intéressé au transport urbain de passagers dans un contexte d’offre de transport multimodale consistant en la coexistence de plusieurs modes de transport. Dans la pratique, un problème de transport multimodal nécessite la prise en compte de plusieurs objectifs et de contraintes spécifiques liées aux modes ou à la séquence de modes utilisés. De telles contraintes sont appelées contraintes de viabilité.Cette thèse CIFRE s’est déroulée en collaboration avec la société MobiGIS, spécialisée dans le conseil et le développement d’applications autour des Systèmes d’Informatio

APA, Harvard, Vancouver, ISO, and other styles

38

Iglesias, Alexandre. "Calcul d'itinéraire multicritère en transport multimodal." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEM025/document.

Full text

Abstract:

Les travaux effectués dans cette thèse industrielle concernent l'amélioration du calculateur d'itinéraire de Cityway, société spécialisée dans les technologies de l’information appliquées à la mobilité.Nous avons d'abord établi un état de l'art exhaustif, accompagné d'une mise en perspective de l'existant Cityway avec celui-ci. Cela nous a permis d'aider l'entreprise à prendre du recul sur son produit et de justifier les axes de recherche choisis pour nos travaux.Nous nous sommes ensuite intéressés à l'aspect multicritère du problème. En effet, le calculateur, basé sur l'algorithme de Dijkstra

APA, Harvard, Vancouver, ISO, and other styles

39

Diot, Emilie. "Etude structurelle et algorithmique des graphes pouvant être séparés avec des plus courts chemins." Thesis, Bordeaux 1, 2011. http://www.theses.fr/2011BOR14425/document.

Full text

Abstract:

Les graphes sont des objets couramment utilisés pour modéliser de nombreuses situations réelles comme des réseaux routiers, informatiques ou encore électriques. Ils permettent de résoudre des problèmes sur ces réseaux comme le routage (aller d'un sommet à un autre en suivant les arêtes du graphe) ou encore leur exploration (obtenir une carte du graphe étudié). Les réseaux étudiés, et donc les graphes qui les modélisent, peuvent être grands, c'est-à-dire avoir un très grand nombre de sommets. Dans ce cas, comme dans le cas de l'étude de grandes données en général, nous pouvons utiliser le parad

APA, Harvard, Vancouver, ISO, and other styles

40

Delhome, Raphaël. "Modélisation de la variabilité des temps de parcours et son intégration dans des algorithmes de recherche du plus court chemin stochastique." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSET010/document.

Full text

Abstract:

La représentation des temps de parcours est un enjeu influençant la qualité de l’information transmise aux usagers des réseaux de transport. En particulier, la congestion constitue un inconvénient majeur dont la prise en compte n’est pas toujours maîtrisée au sein des calculateurs d’itinéraires. De même, les évènements comme les réductions de capacité, les perturbations climatiques, ou encore les pics de fréquentation incitent à dépasser la définition statique des temps de parcours. Des travaux antérieurs se sont focalisés sur des temps dynamiques, i.e. dépendants de la date de départ, de mani

APA, Harvard, Vancouver, ISO, and other styles

41

Murekatete, Rachel Mundeli. "An Analysis of Consequences of Land Evaluation and Path Optimization." Licentiate thesis, KTH, Geoinformatik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-235687.

Full text

Abstract:

Planners who are involved in locational decision making often use raster-based geographic information systems (GIS) to quantify the value of land in terms of suitability or cost for a certain use. From a computational point of view, this process can be seen as a transformation of one or more sets of values associated with a grid of cells into another set of such values through a function reflecting one or more criteria. While it is generally anticipated that different transformations lead to different ‘best’ locations, little has been known on how such differences arise (or do not arise). Exam

APA, Harvard, Vancouver, ISO, and other styles

42

Lanthier, Mark. "Shortest path problems on polyhedral surfaces." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0019/NQ48348.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Dean, Brian C. (Brian Christopher) 1975. "Continuous-time dynamics shortest path algorithms." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80530.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.<br>Includes bibliographical references (p. 116-117).<br>by Brian C. Dean.<br>S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

44

Hua, Liyan. "Shortest Path - Capacitated Maximum Covering Problems." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1275477591.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Hojnacki, Susan M. "Optimizing algorithms for shortest path analysis /." Online version of thesis, 1991. http://hdl.handle.net/1850/11143.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Lanthier, Mark (Mark Anthony) Carleton University Dissertation Computer Science. "Shortest path problems on polyhedral surfaces." Ottawa, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

47

Glenn, Andrew M. 1978. "Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86701.

Full text

Abstract:

Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.<br>Includes bibliographical references (leaves 103-104).<br>by Andrew M. Glenn.<br>M.Eng.and S.B.

APA, Harvard, Vancouver, ISO, and other styles

48

Gray, Chris. "Shortest paths on uncertain terrains." Thesis, 2004. http://hdl.handle.net/2429/15691.

Full text

Abstract:

In this dissertation, we introduce the concept of uncertain terrains first suggested by Jorg Sack. We then examine the problem of finding the shortest path that stays on these terrains given certain assumptions about the terrains. We show that this problem is NP-hard under two fairly natural assumptions (meaning that we do not expect any polynomial time algorithm that finds these paths to be discovered).

APA, Harvard, Vancouver, ISO, and other styles

49

"An auction algorithm for shortest paths." Massachusetts Institute of Technology, Laboratory for Information and Decision Systems, 1990. http://hdl.handle.net/1721.1/3222.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

"Polynomial auction algorithms for shortest paths." Massachusetts Institute of Technology, Laboratory for Information and Decision Systems], 1992. http://hdl.handle.net/1721.1/3264.

Full text

Abstract:

by Dimitri P. Bertsekas, Stefano Pallottino, and Maria Grazia Scutella.<br>Includes bibliographical references (p. 24-25).<br>Supported by NSF. DDM-8903385 Supported by the ARO. C DAAL03-86-K-0171 Supported by a CNR-GNIM grant, and by a Fullbright grant.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!