Dissertations / Theses on the topic 'Shortest paths'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
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.
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 textShinn, 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 textZhao, Hong Jun. "Towards online shortest paths computation." Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b2550689.
Full textChénier, Christian. "Shortest paths in weighted polygons." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/10034.
Full textGao, 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 textMoffat, Alistair. "Fast algorithms for shortest paths." Thesis, University of Canterbury. Computer Science, 1985. http://hdl.handle.net/10092/7926.
Full textChase, Melissa. "Shortest Path Problems: Multiple Paths in a Stochastic Graph." Scholarship @ Claremont, 2003. https://scholarship.claremont.edu/hmc_theses/143.
Full textWang, I.-Lin. "Shortest paths and multicommodity network flows." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/23304.
Full textTabatabai, Bijan Oni. "An investigation of shortest paths algorithms." Thesis, Durham University, 1987. http://etheses.dur.ac.uk/6685/.
Full textGarcia, Renan. "Resource constrained shortest paths and extensions." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/28268.
Full textCommittee 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.
Lorek, David Randolph. "Approximating shortest paths in large networks /." Electronic version (PDF), 2005. http://dl.uncw.edu/etd/2005/lorekd/davidlorek.pdf.
Full textCuerington, 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 textLi, 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 textMagnanti, 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 textPersson, 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 textKholondyrev, Yury. "Optimistic and pessimistic shortest paths on uncertain terrains." Thesis, University of British Columbia, 2007. http://hdl.handle.net/2429/32577.
Full textScience, Faculty of
Computer Science, Department of
Graduate
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 textPisaruk, Fabio. "K-menores caminhos." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-14072009-185725/.
Full textWe 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 to list the k paths connecting a given source-destination pair in the digraph with minimum total length. This dissertation deals with k-shortest simple paths algorithms designed for nonnegative costs, undirected graphs and some implementations of them.
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 textRossolini, 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 textCrane, 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 textWagner, Mitchell James. "Reconstructing Signaling Pathways Using Regular-Language Constrained Paths." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/85044.
Full textMaster of Science
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 textNannicini, 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 textTurner, 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 textBonaventura, 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 textWrede, 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 textSubramanian, Shivaram. "Routing Algorithms for Dynamic, Intelligent Transportation Networks." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/37056.
Full textMaster of Science
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 textVladu, 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 textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 289-302).
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 faster algorithm for the unit capacity minimum cost flow problem, which encompasses the shortest path with negative weights and minimum cost bipartite perfect matching problems. In the case of sparse graphs, this provides the first running time improvement for these problems in over 25 years. *-- We initiate the study of solving linear systems involving directed Laplacian matrices, and devise an almost-linear time algorithm for this task. This primitive enables us to also obtain almost-linear time algorithms for computing an entire host of quantities associated with Markov chains, such as stationary distributions, personalized PageRank vectors, hitting times, or escape probabilities. This significantly improves over the previous state-of-the-art, which was based on simulating random walks, or applying fast matrix multiplication. *-- We develop faster algorithms for scaling and balancing nonnegative matrices, two fundamental problems in scientific computing, significantly improving over the previously known best running times. In particular, if the optimal scalings/balancings have polynomially bounded condition numbers, our algorithms run in nearly-linear time. Beyond that, we leverage and extend tools from convex geometry in order to design an algorithm for online pricing with nearly-optimal regret. We also use convex optimization to shed a new light on the approximate Caratheodory problem, for which we give a deterministic nearly-linear time algorithm, as well as matching lower bounds.
by Adrian Valentin Vladu.
Ph. D.
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 textThe K-Shortest Path Problem is a generalization of the Shortest Path Problem, in which we must find the K paths between two vertices in a graph that have the lowest costs. We study some K-Shortest Path Problem algorithms applied to weighted directed graphs, allowing only paths with no repeated vertices. We compare empirically implementation of some algorithms, using instance graphs from the 9th DIMACS Implementation Challenge. We identify the strengths and weaknesses of each algorithm, and we propose a hybrid version of Feng\'s and Pascoal\'s algorithms. This proposed variant achieve better perfomance compared to both base algorithms in some graphs, and it is better than at least one of them in most cases.
Çaylak, Kayaturan Gökç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 textMuhandiramge, 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 textSuryasaputra, 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 textSouza, 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 textThe search for urban mobility solutions that minimize the aggression to the environment is increasing. Electric vehicles are an attractive alternative because they reduce greenhouse gas emissions, noise pollution, and oil consumption. However, their limited autonomy and the lack of charging stations restrict their popularization. Therefore, government incentive policies have been developed in order to offer benefits to those who choose an electric vehicle. It is estimated that the entire urban fleet will be replaced by these vehicles in a few decades. Therefore, it is important to understand the changes in travel time and energy consumption from the inclusion of electric vehicles in traffic scenarios. Previous works determined these changes by studying the differences between the internal engine of conventional and electric vehicles. However, given the characteristics of the latter, drivers of electric vehicles care about saving energy and may want to choose different routes. Thus, a complete analysis of these impacts should consider a redistribution of traffic. This work proposes a bi-objective traffic assignment method that considers the travel time and the energy consumption to determine the distribution of electric vehicles in urban traffic scenarios. We introduce two strategies for flow distribution as models of route choice. As a procedure of the traffic assignment method, we propose a bi-objective shortest path algorithm for electric vehicles. Our approach was applied to three different scenarios, which resulted in a decrease of up to 80% in total energy consumption. In congested scenarios, we observe an increase of about 10% in average travel time. In uncongested scenarios, travel time decreases about 2%. Energy recovery is almost 6% of the total savings of electric vehicles. Moreover, experiments have shown that investments in the efficiency of electric vehicles can result in up to 15% of energy savings.
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 textGueye, Fallou. "Algorithmes de recherche d'itinéraires en transport multimodal." Thesis, Toulouse, INSA, 2010. http://www.theses.fr/2010ISAT0042.
Full textThis thesis focuses on urban passenger multimodal transportation. In practice, a multimodal transportation problem requires taking into account several objectives and specific constraints related to modes or sequence of used modes. Such constraints are called viability constraints. This work has been carried out in collaboration with MobiGIS, a company specialized in consulting and development of applications around Geographical Information Systems.The problem studied in this thesis is the bi-objective multimodal viable point-to-point shortest path, aiming at minimizing the total travel time and the total number of mode changes. Given the considered objectives, this problem is polynomial.On the basis of a multi-layered graph model of the multimodal transportation networks, and of a finite state automaton model of the viability constraints, we propose various algorithms for solving this problem, based on the principle of label setting and extension.We also proposed a new dominance rule based on the states of the automaton to reduce the number of labels explored by our algorithms. Bidirectional and A* variants are also proposed.The algorithms are evaluated the transportation network of the city of Toulouse and experiments demonstrate the interest of the proposed dominance rules and bidirectional approach. A prototype software implementing different features of the shortest path algorithms has been developed. It notably enables calculations of point-to-point routes, accessibility and origin-destination matrices
Iglesias, Alexandre. "Calcul d'itinéraire multicritère en transport multimodal." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEM025/document.
Full textThe work carried out in this industrial PhD aims at improving the route planner of Cityway, a company specialized in information technologies applied to mobility. We first established an exhaustive state of the art, and compared it to the existing Cityway product. This allowed us to help the company take a step back from its urgent needs, and justify the research guidelines chosen for our work.We then looked at the multi-criteria aspect of the problem. Indeed, the trip planner, based on the Dijkstra algorithm, makes it possible to find paths minimizing a weighted sum of criteria. We have developed a multilabel algorithm to maintain and extend multiple labels at the same node. Despite a slight increase in computation time, satisfactory results were obtained in a bicriteria application of this new algorithm.We also worked on the generation and selection of alternative routes. The generation algorithm relies on the existing monolabel or newly developed multilabel algorithms. The selection algorithm is based on the definition of a distance between trips and adaptations of existing clustering algorithms to this specific case.Finally, we were interested in what we called the lexicographic criterion. For a trip to be interesting, it must be optimal on the usual criterion of earliest arrival, and, for trips arriving at the same time, on the latest departure criterion. The use of certain properties on this criterion makes it possible to reduce computation times on the bicriteria case
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 textGraphs are widely used to MODELISER a lot of real situations like road networks, computers networks or electricity ones. Using them, we can solve problems on these networks like routing (go from a vertex ti another one) or explore them (to have a map of studied graph).Studied networks, and so graphs which MODELISER them, can be large (i.e. have a lot of vertices). In this case, we can use the paradigm "Divide and conquer" to answer the questions. Indeed, working on small parts of graphs and merging the results on these small parts, we can obtain the result on the whole graph.In this document, we present a way to separate graphs using shortest paths like separators. This decomposition let to obtain a compact routing, a compact labeling to estimate the distance between vertices of the graph. This method let us to define new class of graphs
Delhome, Raphaë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 textThe travel time representation has a major impact on user-oriented routing information. In particular, congestion detection is not perfect in current route planners. Moreover, the travel times cannot be considered as static because of events such as capacity drops, weather disturbances, or demand peaks. Former researches focused on dynamic travel times, i.e. that depend on departure times, in order to improve the representation details, for example concerning the periodicity of congestions. Real-time information is also a significant improvement for users aiming to prepare their travel or aiming to react to on-line events. However these kinds of model still have an important drawback : they do not take into account all the aspects of travel time variability. This dimension is of huge importance, in particular if the user risk aversion is considered. Additionally in a multimodal network, the eventual connections make the travel time uncertainty critical. In this way the current PhD thesis has been dedicated to the study of stochastic travel times, seen as distributed random variables.In a first step, we are interested in the travel time statistical modeling as well as in the travel time variability. In this goal, we propose to use the Halphen family, a probability law system previously developed in hydrology. The Halphen laws show the typical characteristics of travel time distributions, plus they are closed under addition under some parameter hypothesis. By using the distribution moment ratios, we design innovative reliability indexes, that we compare with classical metrics. This holistic approach appears to us as a promising way to produce travel time information, especially for infrastructure managers.Then we extend the analysis to transportation networks, by considering previous results. A set of probability laws is tested during the resolution of the stochastic shortest path problem. This research effort helps us to describe paths according to the different statistical models. We show that the model choice has an impact on the identified paths, and above all, that the stochastic framework is crucial. Furthermore we highlight the inefficiency of algorithms designed for the stochastic shortest path problem. They need long computation times and are consequently incompatible with industrial applications. An accelerated algorithm based on a deterministic state-of-the-art is provided to overcome this problem in the last part of this document. The obtained results let us think that route planners might include travel time stochastic models in a near future
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 textPlanerare som arbetar bland annat med att fatta beslut som hänsyftar till vissa lokaler använder ofta rasterbaserade geografiska informationssystem (GIS) för att sätta ett värde på marken med avseende på lämplighet eller kostnad för en viss användning. Ur en beräkningssynpunkt kan denna process ses som en transformation av en eller flera uppsättningar värden associerade med ett rutnät av celler till en annan uppsättning sådana värden genom en funktion som återspeglar ett eller flera kriterier. Medan det generellt förväntas att olika omvandlingar leder till olika "bästa" platser, har lite varit känt om hur sådana skillnader uppstår (eller inte uppstår). Exempel på sådana rumsliga beslutsproblem kan lätt hittas i litteraturen och många av dem handlar om valet av en uppsättning celler (som markanvändningen övervägs tilldelas) från en rasteryta av lämplighet eller kostnad beroende på kontext. För att underlätta GISs algoritmiska tillvägagångssätt antas det ofta att kvaliteten på uppsättningen av celler kan utvärderas som helhet genom summan av deras cellvärden. Giltigheten av detta antagande måste emellertid ifrågasättas om dessa värden mäts på en skala som inte tillåter aritmetiska transformationer. Användning av ordinal skala enligt Stevens typologi är ett exempel av detta. En fråga uppstår naturligt: Finns det ett mer matematiskt sunt och konsekvent tillvägagångssätt för att utvärdera kvaliteten på en rutt när kvaliteten på varje cell i det givna rutnätet mäts med ordinalskala? Avhandlingen försöker svara på ovanstående frågor i samband med ruttplanering genom en serie beräkningsexperiment med hjälp av ett antal slumpmässigt genererade landskapsnät med en rad olika rumsliga och icke-rumsliga strukturer. I den första uppsättningen experiment genererade vi minsta-kostnad rutter på ett antal kostnadsnät som transformerats från landskapsnätverket med hjälp av en mängd olika transformationsparametrar, och analyserade lägen och de (viktade) längderna för dessa rutter. Resultaten visar att samma par ändpunkter mycket väl kan vara sammanbundna med olika minsta-kostnad banor på olika kostnadsraster härledda från samma landskapsraster, och att variationen mellan dessa banor påverkas av hur givna värden fördelas i landskapsrastret såväl som av hur härledda värden fördelas i kostnadsrastret. Mest signifikant är att variationen tenderar att vara mindre när landskapsrastret innehåller mer distinkta grupper av celler som potentiellt lockar eller distraherar kostnadsbesparande passage, eller när kostnadsrastret innehåller ett mindre antal låg-kostnad celler. Den andra uppsättningen experiment syftar till att jämföra två optimeringsmodeller, minisum och minimax (eller maximin) sökmodeller, vilka sammanställer värdena för cellerna som är associerade med en sökväg med summanfunktionen respektive maximum (eller minimum) funktionen. Resultaten tyder på att minisumbanemodellen är effektiv om sökningen av sökvägen kan översättas till det konventionella minsta kostnadsproblemet, vilket syftar till att hitta en väg med den minsta kostnadsvägda längden mellan två terminaler på en ratio-skalad rasterkostyta, men minimax (eller maximin) banmodellen är matematiskt sundare om kostnadsvärdena mäts i ordinär skala och praktiskt användbar om problemet inte bara avser minimering av kostnad men samtidigt maximering av någon önskvärd egenskap såsom lämplighet.
QC 20181002
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 textDean, 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 textIncludes bibliographical references (p. 116-117).
by Brian C. Dean.
S.B.and M.Eng.
Hua, Liyan. "Shortest Path - Capacitated Maximum Covering Problems." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1275477591.
Full textHojnacki, Susan M. "Optimizing algorithms for shortest path analysis /." Online version of thesis, 1991. http://hdl.handle.net/1850/11143.
Full textLanthier, Mark (Mark Anthony) Carleton University Dissertation Computer Science. "Shortest path problems on polyhedral surfaces." Ottawa, 1999.
Find full textGlenn, 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 textIncludes bibliographical references (leaves 103-104).
by Andrew M. Glenn.
M.Eng.and S.B.
Gray, Chris. "Shortest paths on uncertain terrains." Thesis, 2004. http://hdl.handle.net/2429/15691.
Full text"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"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 textIncludes bibliographical references (p. 24-25).
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.