Log in

Relevant bibliographies by topics / Shortest path search in network / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Shortest path search in network.

Dissertations / Theses on the topic 'Shortest path search in network'

Author: Grafiati

Published: 30 May 2022

Last updated: 31 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 path search in network.'

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

Holmgren, Johan. "Efficient Updating Shortest Path Calculations for Traffic Assignment." Thesis, Linköping University, Department of Mathematics, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2573.

Full text

Abstract:

<p>Traffic planning in a modern congested society is an important and time consuming procedure. Finding fast algorithms for solving traffic problems is therefore of great interest for traffic planners allover the world. </p><p>This thesis concerns solving the fixed demand traffic assignment problem (TAP) on a number of different transportation test networks. TAP is solved using the Frank-Wolfe algorithm and the shortest path problems that arise as subproblems to the Frank-Wolfe algorithm are solved using the network simplex algorithm. We evaluate how a number of existing pricing strategies to

APA, Harvard, Vancouver, ISO, and other styles

2

Hong, Chyi-Fu. "O(n) planar network shortest path algorithm." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/24841.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

4

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

5

Montes, Anel A. "Network shortest path application for optimum track ship routing." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://handle.dtic.mil/100.2/ADA435601.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ruan, Ning. "Network Backbone with Applications in Reachability and Shortest Path Computation." Kent State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=kent1334516240.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Allen, Andrea J. "Average Shortest Path Length in a Novel Small-World Network." Oberlin College Honors Theses / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1516362622694547.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ahmed, Mahad A. (Mahad Mohamed) 1973 Carleton University Dissertation Engineering Systems and Computer. "Performance analysis and improvement of the Open Shortest Path First routing protocol." Ottawa.:, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Перепеліцин, Сергій Олександрович, та Sergiy Perepelitsyn. "Технологія налаштовування радіомережі в умовах завад інтеграцією маршрутизації та самонавчання". Thesis, Національний авіаційний університет, 2021. https://er.nau.edu.ua/handle/NAU/49767.

Full text

Abstract:

Дисертаційна робота присвячене розв'язання науково-технічної задачі зі створення інформаційної технології моделювання ефективного контролю за топологією однорангової мобільної радіомережі, що само налагоджується, тактичного рівня й управління зміною показників її функціонування в умовах впливу радіоперешкод та радіоелектронної протидії (РЕБ). У дисертаційній роботі вперше запропоновано нова топологія, що відрізняється від відомих тим, що включає елементи навчання поведінки мережі в умовах перешкод. Введені нові процеси інтелектуальної системи керування вузлом мобільної радіомережі: пошукова

APA, Harvard, Vancouver, ISO, and other styles

10

Mohiuddin, Mohammed Aijaz. "Engineering Nature-Inspired Heuristics for the Open Shortest Path First Weight Setting Problem." Thesis, University of Pretoria, 2018. http://hdl.handle.net/2263/65988.

Full text

Abstract:

In the thesis of “Mohammed Aijaz Mohiuddin”, Engineering Nature-Inspired Heuristics for the Open Shortest Path First Weight Setting Problem, nature inspired heuristics were developed. Besides the existing two objectives, namely maximum utilization and the number of congested links, a third objective namely the number of unused links was used to formulate the fuzzy based objective function for the OSPFWS problem. The idea was to make use unused network links if any. Furthermore, a hybrid fuzzy based evolutionary Particle Swarm Optimization (FEPSO) algorithm was designed that harnessed evolution

APA, Harvard, Vancouver, ISO, and other styles

11

Vorster, James Michael. "Cycle route network development and evaluation using spatial multi-criteria analysis and shortest path analysis." Master's thesis, Faculty of Engineering and the Built Environment, 2018. http://hdl.handle.net/11427/30136.

Full text

Abstract:

The current global trend of urbanisation has resulted in many cities today with growing transportation problems. Locally, South Africa is dealing with both urbanisation and spatial inequalities as a result of the apartheid era, with the poor very often located on the outskirts of urban areas, and therefore far from centres of employment and other amenities. Active mobility in the form of walking and cycling have been suggested as a means to address urban transport challenges, as it simultaneously promotes sustainability and improves the liveability of cities. Moreover, the infrastructural requ

APA, Harvard, Vancouver, ISO, and other styles

12

Managbanag, JR. "Application of Shortest-Path Network Analysis to Identify Genes that Modulate Longevity in Saccharomyces cerevisiae." VCU Scholars Compass, 2008. http://scholarscompass.vcu.edu/etd/1613.

Full text

Abstract:

Shortest-path network analysis was employed to identify novel genes that modulate longevity in the baker’s yeast Saccharomyces cerevisiae. Based upon a set of previously reported genes associated with increased life span, a shortest path network algorithm was applied to a pre-existing protein-protein interaction dataset in order to construct a shortest-path longevity network. To validate this network, the replicative aging potential of 88 single gene deletion strains corresponding to predicted components of the shortest path longevity network was determined. The 88 single-gene deletion str

APA, Harvard, Vancouver, ISO, and other styles

13

Sandberg, Richard. "A survey of optimization methods for solving the inverse shortest path routing problem." Thesis, Linköpings universitet, Optimeringslära, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-59536.

Full text

Abstract:

Ruttningen av trafik i IP-nätverk sker ofta med hjälp av bågvikter som bestämmer vilken väg trafiken tar (kortastevägruttning). Problemet här är att avgöra ifall det existerar en uppsättning vikter givet ett önskat ruttningsschema. Den hör rapporten undersöker prestandan hos ett antal modeller och optimeringsprogram avsedda att lösa denna typ av problem som ofta kallas inversa kortastevägruttningsproblemet. Undersökningen visar att det existerar en stor skillnad mellan modellerna och optimeringsprogrammen och att modellen baserad på cykelbaser löst med CPLEXdualopt lösaren är snabbast.<br>The

APA, Harvard, Vancouver, ISO, and other styles

14

Kirkizoglu, Isil. "Heat Exchanger Network Synthesis With Detailed Design: Reformulation As A Shortest Path Problem By Temperature Discretization." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614877/index.pdf.

Full text

Abstract:

This study presents an optimization approach to heat exchanger network synthesis (HENS). HENs are widely used in industry and bring several fluid streams into their desired temperatures by using available heat in the process for efficient usage of energy. Our aim is to provide a network design coupled with a detailed equipment design for heat exchangers. The suggested approach involves discretization of temperatures based on heat load equalities and reformulation as a shortest-path problem, rather than dealing with a nonlinear model and a previously structured HEN, which are common methods in

APA, Harvard, Vancouver, ISO, and other styles

15

Olsson, Per-Magnus. "Methods for Network Optimization and Parallel Derivative-free Optimization." Doctoral thesis, Linköpings universitet, Optimeringslära, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-104110.

Full text

Abstract:

This thesis is divided into two parts that each is concerned with a specific problem. The problem under consideration in the first part is to find suitable graph representations, abstractions, cost measures and algorithms for calculating placements of unmanned aerial vehicles (UAVs) such that they can keep one or several static targets under constant surveillance. Each target is kept under surveillance by a surveillance UAV, which transmits information, typically real time video, to a relay UAV. The role of the relay UAV is to retransmit the information to another relay UAV, which retransmits

APA, Harvard, Vancouver, ISO, and other styles

16

Farooq, Farhan. "Optimal Path Searching through Specified Routes using different Algorithms." Thesis, Högskolan Dalarna, Datateknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530.

Full text

Abstract:

To connect different electrical, network and data devices with the minimum cost and shortest path, is a complex job. In huge buildings, where the devices are placed at different locations on different floors and only some specific routes are available to pass the cables and buses, the shortest path search becomes more complex. The aim of this thesis project is, to develop an application which indentifies the best path to connect all objects or devices by following the specific routes.To address the above issue we adopted three algorithms Greedy Algorithm, Simulated Annealing and Exhaustive sea

APA, Harvard, Vancouver, ISO, and other styles

17

Leary, John J. "Search for a stealthy flight path through a hostile radar defense network." Thesis, Monterey, California. Naval Postgraduate School, 1995. http://hdl.handle.net/10945/31582.

Full text

Abstract:

This thesis develops a method for quickly selecting a good flight path for an aircraft flying from its base to its mission objective when the flight path must be over a geographic area containing hostile radar installations. Several models are developed in detail and then integrated permitting a shortest path algorithm to be used to find a route from a starting location to a goal that approximately minimizes probability of detection. Fuel, time and distance constraints are incorporated indirectly, but one strong assumption is made: Detections are assumed independent across network edges and am

APA, Harvard, Vancouver, ISO, and other styles

18

Grigoleit, Mark Ted. "Optimisation of large scale network problems." Thesis, Curtin University, 2008. http://hdl.handle.net/20.500.11937/1405.

Full text

Abstract:

The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved in polynomial time; with them, the CSPP is NP-hard and thus far no polynomial-time algorithms exist for solving it optimally. The problem arises in a number of practical situations. In the case of vehicle path planning, the vehicle may be an aircraft flying through a region with obstacles such as mountains or radar detectors, with an upper bound on the fuel consumption, the tr

APA, Harvard, Vancouver, ISO, and other styles

19

Grigoleit, Mark Ted. "Optimisation of large scale network problems." Curtin University of Technology, Department of Mathematics and Statistics, 2008. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=115092.

Full text

Abstract:

The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved in polynomial time; with them, the CSPP is NP-hard and thus far no polynomial-time algorithms exist for solving it optimally. The problem arises in a number of practical situations. In the case of vehicle path planning, the vehicle may be an aircraft flying through a region with obstacles such as mountains or radar detectors, with an upper bound on the fuel consumption, the tr

APA, Harvard, Vancouver, ISO, and other styles

20

Jenkins, Kevin Dean. "The shortest path problem in the plane with obstacles : a graph modeling approach to producing finite search lists of homotopy classes." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/26761.

Full text

Abstract:

The problem of finding the shortest path between two points in a plane containing obstacles is considered. The set of such paths is uncountably infinite, making an exhaustive search impossible. This difficulty is overcome by reducing the size of the search space. The search is first restricted to a countably infinite set by focusing attention on the set of homotopy classes. By applying simple optimality principles, a finite list of such classes is obtained whose union contains the shortest path. This process of simplification is accomplished by modeling the topology of the region with a graph.

APA, Harvard, Vancouver, ISO, and other styles

21

Moore, Amy Marie. "Estimating freight costs over a multi-modal network: an auto industry supply chain example." Thesis, Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47706.

Full text

Abstract:

The objective of this research is to implement multi-modal cost calculations on a freight transportation network, in order to estimate the cost of freight shipments from parts suppliers to original equipment manufacturers (OEMs), and from OEMs to final consumers involved in the automobile manufacturing industry supply chain. The research will describe gaps in the current freight cost estimation literature, determine the strengths and weaknesses of current practices, and offer possible improvement strategies. The necessary components for this research include: a multi-modal (highway-rail-water-

APA, Harvard, Vancouver, ISO, and other styles

22

Harbart, Robert Allan. "Addressing and Distances for Cellular Networks with Holes." Kent State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

So, Keith Kam-Ho Computer Science &amp Engineering Faculty of Engineering UNSW. "Lexicographic path searches for FPGA routing." Publisher:University of New South Wales. Computer Science & Engineering, 2008. http://handle.unsw.edu.au/1959.4/41295.

Full text

Abstract:

This dissertation reports on studies of the application of lexicographic graph searches to solve problems in FPGA detailed routing. Our contributions include the derivation of iteration limits for scalar implementations of negotiation congestion for standard floating point types and the identification of pathological cases for path choice. In the study of the routability-driven detailed FPGA routing problem, we show universal detailed routability is NP-complete based on a related proof by Lee and Wong. We describe the design of a lexicographic composition operator of totally-ordered monoids as

APA, Harvard, Vancouver, ISO, and other styles

24

Montojo, Villasanta Javier, and Viñas Manuel Maqueda. "Congestion Identification in a Radio Access Transport Network." Thesis, KTH, Radio Systems Laboratory (RS Lab), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-142437.

Full text

Abstract:

The convergence of mobile services and Internet has brought a radical change in mobile networks. An all IP network architecture, an evolution of the radio access transport network, is required to support new high-bandwidth services. Unfortunately, existing control mechanisms are insufficient to guarantee end users a high quality of experience. However, coordinating radio and transport network resources is expected to yield a more efficient solution. This thesis project investigates the interactions between the congestion avoidance protocols, explicit congestion notification, and the traffic en

APA, Harvard, Vancouver, ISO, and other styles

25

Zhu, Lei. "Routing Map Topology Analysis and Application." Diss., The University of Arizona, 2014. http://hdl.handle.net/10150/347053.

Full text

Abstract:

The transportation routing map is increasingly used in various transportation network modeling applications such as vehicle navigation and traffic assignment modeling. A typical navigation GIS map contains all detailed road facility layers and may not be as computationally efficient as a lower-resolution map for path finding. A lower-resolution transportation routing map retains only route-finding related roadways and is efficient for path finding but may result in sub-optimal routes because of misclassification links. With the goal in balancing the traffic analysis requirement of intended app

APA, Harvard, Vancouver, ISO, and other styles

26

Žlebek, Petr. "Hra Sokoban a umělá inteligence." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-442845.

Full text

Abstract:

The thesis is focused on solving the Sokoban game using artificial intelligence algorithms. The first part of the thesis describes the Sokoban game, state space and selected state space search methods. In the second part selected methods were implemented and graphic user interface was created in the Python environment. Comparative experiments were executed in the final part.

APA, Harvard, Vancouver, ISO, and other styles

27

Touray, Barra. "Energy-efficient routing algorithms for wireless sensor networks." Thesis, Liverpool John Moores University, 2013. http://researchonline.ljmu.ac.uk/4352/.

Full text

Abstract:

A wireless sensor network (WSN) is made of tiny sensor nodes usually deployed in high density within a targeted area to monitor a phenomenon of interest such as temperature, vibration or humidity. The WSNs can be employed in various applications (e.g., Structural monitoring, agriculture, environment monitoring, machine health monitoring, military, and health). For each application area there are different technical issues and remedies. Various challenges need to be considered while setting up a WSN, including limited computing, memory and energy resources, wireless channel errors and network s

APA, Harvard, Vancouver, ISO, and other styles

28

Patharlapati, Sai Ram Charan. "Balancing of Network Energy using Observer Approach." Master's thesis, Universitätsbibliothek Chemnitz, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-209453.

Full text

Abstract:

Efficient energy use is primarily for any sensor networks to function for a longer time period. There have been many efficient schemes with various progress levels proposed by many researchers. Yet, there still more improvements are needed. This thesis is an attempt to make wireless sensor networks with further efficient on energy usage in the network with respect to rate of delivery of the messages. In sensor network architecture radio, sensing and actuators have influence over the power consumption in the entire network. While listening as well as transmitting, energy is consumed by the radi

APA, Harvard, Vancouver, ISO, and other styles

29

Prytz, Mikael. "On Optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic." Doctoral thesis, KTH, Mathematics, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3307.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Shim, Sangho. "Large scale group network optimization." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31737.

Full text

Abstract:

Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2010.<br>Committee Chair: Ellis L. Johnson; Committee Member: Brady Hunsaker; Committee Member: George Nemhauser; Committee Member: Jozef Siran; Committee Member: Shabbir Ahmed; Committee Member: William Cook. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

31

Liang, Yung-Chin. "Dynamic Routing and Load Balancing Techniques for Integrated Access and Backhaul Network." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-288174.

Full text

Abstract:

Mobile networks have rapidly evolved over decades, and have arrived at the fifth generation (5G) system in recent years. From 2019, companies started to bring 5G networks into business, providing higher data rates, lower latency, and larger network capacity to the world. One of the main advancements in 5G network systems is the use of millimetre waves for wireless transmission. This not only grants higher throughput with wide bandwidth but also introduces new challenges to the radio access networks in 5G systems. To tackle the challenges, a new type of network, which is called the Integrated A

APA, Harvard, Vancouver, ISO, and other styles

32

Ma, Qi. "Reinforcement in Biology : Stochastic models of group formation and network construction." Doctoral thesis, Uppsala universitet, Analys och tillämpad matematik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-186989.

Full text

Abstract:

Empirical studies show that similar patterns emerge from a large number of different biological systems. For example, the group size distributions of several fish species and house sparrows all follow power law distributions with an exponential truncation. Networks built by ant colonies, slime mold and those are designed by engineers resemble each other in terms of structure and transportation efficiency. Based on the investigation of experimental data, we propose a variety of simple stochastic models to unravel the underlying mechanisms which lead to the collective phenomena in different syst

APA, Harvard, Vancouver, ISO, and other styles

33

Moran, Michael. "On Comparative Algorithmic Pathfinding in Complex Networks for Resource-Constrained Software Agents." ScholarWorks, 2017. https://scholarworks.waldenu.edu/dissertations/3951.

Full text

Abstract:

Software engineering projects that utilize inappropriate pathfinding algorithms carry a significant risk of poor runtime performance for customers. Using social network theory, this experimental study examined the impact of algorithms, frameworks, and map complexity on elapsed time and computer memory consumption. The 1,800 2D map samples utilized were computer random generated and data were collected and processed using Python language scripts. Memory consumption and elapsed time results for each of the 12 experimental treatment groups were compared using factorial MANOVA to determine the imp

APA, Harvard, Vancouver, ISO, and other styles

34

Goold, Jeremy C. "Improving Routing Security Using a Decentralized Public Key Distribution Algorithm." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd797.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Šulák, Michal. "Aplikace neuronových sítí v telekomunikacích." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217313.

Full text

Abstract:

This Master’s Thesis consists of description of current routing protocols and routers, basic principles of neural networks and their interpretation in connection with the use for routing in data networks and telecommunications networks. In the thesis I focused on neural networks, which use energetic functions to find solution stabled states and their use for data routing. I produced the application software to test and find suitable variables for each function. This application counts the shortest path and is able to change variables to reach the best solution of stabled state of neural networ

APA, Harvard, Vancouver, ISO, and other styles

36

Marinho, Max Robert. "Otimização do problema de reconfiguração de sistemas de distribuição de energia elétrica por meio das Meta-Heurísticas Busca Tabu, GRASP e Path Relinking /." Ilha Solteira, 2020. http://hdl.handle.net/11449/192743.

Full text

Abstract:

Orientador: Rubén Augusto Romero Lazaro<br>Resumo: O problema de reconfiguração de sistemas de distribuição de energia elétrica consiste em encontrar uma configuração radial por meio da permutação do estado das chaves (abertura ou fechamento) dos ramos de um sistema elétrico. O objetivo é de se alcançar a minimização das perdas elétricas. Cada configuração radial só é considerada factível se respeitar certas restrições operacionais como o limite de tensão nas barras e os limites de correntes nos circuitos. O modelo tratado neste trabalho apresenta explosão combinatória e difícil tratabilidade

APA, Harvard, Vancouver, ISO, and other styles

37

Lourenço, Wilson Da Silva. "Objeto de aprendizagem para o ensino de algoritmos solucionadores de problemas de otimização em redes." Universidade Nove de Julho, 2015. http://bibliotecadigital.uninove.br/handle/tede/1122.

Full text

Abstract:

Submitted by Nadir Basilio (nadirsb@uninove.br) on 2015-07-17T15:18:49Z No. of bitstreams: 1 Wilson da Silva Lourenco.pdf: 1321079 bytes, checksum: ea090b0df77d0c04ef1dde30e7b41558 (MD5)<br>Made available in DSpace on 2015-07-17T15:18:49Z (GMT). No. of bitstreams: 1 Wilson da Silva Lourenco.pdf: 1321079 bytes, checksum: ea090b0df77d0c04ef1dde30e7b41558 (MD5) Previous issue date: 2015-02-26<br>The network optimization problems (NOP) are common to several areas such as engineering, transport and telecommunications, and have been objects of intense research and studies. Among the classical NOP

APA, Harvard, Vancouver, ISO, and other styles

38

Bastos, Rodrigo. "Determinação de caminhos mínimos em aplicações de transporte público: um estudo de caso para a cidade de Porto Alegre." Universidade do Vale do Rio dos Sinos, 2013. http://www.repositorio.jesuita.org.br/handle/UNISINOS/4589.

Full text

Abstract:

Submitted by William Justo Figueiro (williamjf) on 2015-07-21T22:37:51Z No. of bitstreams: 1 63c.pdf: 2699232 bytes, checksum: 1ae2013ef31101508f9fef3997d71790 (MD5)<br>Made available in DSpace on 2015-07-21T22:37:51Z (GMT). No. of bitstreams: 1 63c.pdf: 2699232 bytes, checksum: 1ae2013ef31101508f9fef3997d71790 (MD5) Previous issue date: 2013<br>SIMTUR - Sistema Inteligente De Monitoramento de Tráfego Urbano<br>O crescente aumento do uso de automóveis e de motocicletas tem provocado uma contínua degradação no trânsito urbano das grandes metrópoles. Este cenário é agravado pelas deficiênc

APA, Harvard, Vancouver, ISO, and other styles

39

Silva, Paulo Wagner Lopes da. "O papel da distância em projetos topológicos de redes de distribuição elétrica." Universidade Federal de Alagoas, 2015. http://www.repositorio.ufal.br/handle/riufal/1602.

Full text

Abstract:

This dissertation investigates in which conditions the optimal conﬁguration of an electric power network is a minimum length spanning tree, and in which conditions it is shortest path tree conﬁguration. For this purpose the dissertation, it applies computational optimization mathematical models of an optimal local access network design problem. The focus of the study is the 13.8 kV spacer cable primary radial networks. Applied models seek for the balance betweenﬁxedcostsandvariablecosts.Savedvaluesfromanoptimalnetworkcouldbeapplied to increase the range of the network and people reached as wel

APA, Harvard, Vancouver, ISO, and other styles

40

Junior, Nilton Alves. "Caracterização de redes complexas: aplicação à modelagem relacional entre sistemas autônomos da Internet." Universidade do Estado do Rio de Janeiro, 2007. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=607.

Full text

Abstract:

Neste trabalho, foram utilizadas técnicas e conceitos tipicamente encontrados em estudos de Redes Complexas, uma sub-área da Física Estatística, para caracterizar a Internet e sua evolução em uma década, de 1998 a 2007. Foi considerada como unidade básica de análise, a estrutura Sistema Autônomo. Nesta caracterização, foram utilizadas várias ferramentas computacionais desenvolvidas em linguagem C/C++, que permitiram classificar, simular e modelar propriedades dinâmicas. Dentre estas propriedades podemos destacar o coeficiente de conectividade, fundamental para os estudos topológicos, e o parâ

APA, Harvard, Vancouver, ISO, and other styles

41

Lu, Qifeng. "Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/26444.

Full text

Abstract:

With the technological advancement in computer science, Geographic Information Science (GIScience), and transportation, more and more complex path finding queries including category based queries are proposed and studied across diverse disciplines. A category based query, such as Optimal Sequenced Routing (OSR) queries and Trip Planning Queries (TPQ), asks for a minimum-cost path that traverses a set of categories with or without a predefined order in a graph. Due to the extensive computing time required to process these complex queries in a large scale environment, efficient algorithms are hi

APA, Harvard, Vancouver, ISO, and other styles

42

Cherng, Cherng Yi, and 程怡誠. "The Study of Shortest Path Search Based on Zone Partition Network." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/83625692207302174982.

Full text

Abstract:

碩士<br>國立交通大學<br>交通運輸研究所<br>89<br>Route choices over transportation networks are operations required by many Geographic Information Systems applications. Such networks, typically modeled as graphs compose of nodes and links and represented as link relations, can be large and hence often need to be stored on secondary storage device. Route choice computation over such large persistent networks amounts to high I/O costs due to having to repeatedly bring in links from the link relation from storage into the main memory buffer for processing. This paper presents a comparative experimental evaluatio

APA, Harvard, Vancouver, ISO, and other styles

43

Wang, Hui. "Transportation shortest path search area model." 2003. http://etd.utk.edu/2003/WangHui.pdf.

Full text

Abstract:

Thesis (Ph. D.)--University of Tennessee, Knoxville, 2003.<br>Title from title page screen (viewed Mar. 24, 2004). Thesis advisor: Lee D. Han. Document formatted into pages (xiii, 139 p. : ill. (chiefly col.)). Vita. Includes bibliographical references (p. 119-121).

APA, Harvard, Vancouver, ISO, and other styles

44

Jhuo, Jhe-chiang, and 卓哲強. "The Shortest Path Problems for Linear Network." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/gvxwwb.

Full text

Abstract:

碩士<br>國立虎尾科技大學<br>工業工程與管理研究所<br>94<br>The essence of this research is to investigate two shortest path problems inside a convex polygon. The first one is to find the shortest cycle connecting all the edges of the convex polygon. This problem is a special type of TSP. The major different between this problem and the traditional TSP is that the nodes to be connected in this problem are not fixed points but are located somewhere along the corresponding edges. The second problem is to find the minimum spanning tree to link all the vertices of the convex polygon. It is an Euclidean Steiner tree pro

APA, Harvard, Vancouver, ISO, and other styles

45

Lin, Yusiang, and 林育詳. "High efficient strategy for finding traffic network shortest path." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/12998035362661439667.

Full text

Abstract:

碩士<br>國立成功大學<br>土木工程學系<br>89<br>Finding shortest paths for a traveler from a given location to a desired destination is a important process in Intelligent Transport Systems. The most formidable challenge to researchers is to fuel the speed of determining shortest paths up because the extreme bound is reached by using advanced data structures and searching algorithms such as many researchers utilize a priority queue (binary heap) implementation which reduces the calculating time of Dijkstra’s algorithm to O(mlogn). Although altering the data structures and search routines used in label-setting

APA, Harvard, Vancouver, ISO, and other styles

46

Shiu, Ming-Je, and 許銘哲. "The Shortest Path of Hamiltonian on The Grid Network." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/2t5g36.

Full text

Abstract:

碩士<br>國立虎尾科技大學<br>工業工程與管理研究所<br>101<br>In order to reduce the production cost and uncertainty, automation will gradually replace human in the future, especially in high-tech industry. The planning of production path that offers least cost is a critical issue for automatic production process. To solve the production path problem, a new algorithm is proposed in this research. The basic characteristic of the proposed algorithm is to solve a Hamiltonian path along a set of given points on a grid graph that has only horizontal and vertical freedom. The proposed algorithm includes the following majo

APA, Harvard, Vancouver, ISO, and other styles

47

Huang, Chia-Cheng, and 黃家政. "Efficient Browsing and Heuristic Shortest-Path Search on Digital Vector Maps." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/20061489591982516521.

Full text

Abstract:

碩士<br>義守大學<br>資訊工程學系碩士班<br>95<br>As the rapid development of computer hardware and software, people have widely used electronic maps in a variety of geographical information application systems. One of most important technologies is the indexing and searching technology on spatial data. For a general embedded device, memory size is often insufficient to load all maps into memory at once because of the volume, power and cost. When browsing a large map, the transmission speed between main memory and auxiliary memory is a critical bottleneck. The access frequency of memory will influence the disp

APA, Harvard, Vancouver, ISO, and other styles

48

"Forward path search : a new dual coordinate ascent algorithm for shortest paths." Laboratory for Information and Decision Systems, Massachusetts Institute of Technology], 1990. http://hdl.handle.net/1721.1/3203.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Yang, Kai-Chieh, and 楊凱傑. "The Near-Shortest Path Search on a Quadric Surface and Its Application." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/31731977630965509707.

Full text

Abstract:

碩士<br>國立臺灣海洋大學<br>電機工程學系<br>101<br>Recently, a new algorithm to obtain the sub-shortest path in the Euclidean plane based on the concepts of Delaunay triangulation, an improved Dijkstra algorithm and Fermat points was presented. The length of path obtained by this algorithm is the shortest among two other fastest O(n log n) algorithms in the literature. Based on the previous works, a novel O(n log n) sub–shortest path algorithm in the Quadric plane based on the Delaunay triangulation, an improved Dijkstra algorithm and Ridge points is presented in this paper. Compare to the another O(n log n)

APA, Harvard, Vancouver, ISO, and other styles

50

Lee, Cheng-Han, and 李承翰. "Algorithms of The Shortest Path and Maximum Flow on Network Models." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/73068312746904609815.

Full text

Abstract:

碩士<br>國立臺灣海洋大學<br>資訊工程學系<br>103<br>In this thesis, we investigate the problems of the shortest path and the maximum flow in network models. Regarding finding the shortest path,the classical algorithm of Dijkstra is good and popular. However, it still can be improved in the storage space and the efficiency of computation.Recently, a new approach of solving this problem, by applying matrix operations and finding the minimum spanning tree, was proposed by Juang. But, the further work, such as the implementation, adaptiveness, and verification, has not been explored yet.We therefore present a modi

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!