Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "routing" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 237
Tytuł:
A case study in school transportation logistics
Autorzy:
Worwa, K.
Powiązania:
https://bibliotekanauki.pl/articles/409077.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
School bus routing problem
Scheduling
Heuristic
optimization
Opis:
In the paper, a school bus routing problem, its mathematical models and solution methods are investigated. The aim of the study is to search for school bus routing problem and its solution method and to apply them for a sample case study. The case study concerns the routing and scheduling of school buses in an exemplary, well-recognized school located in one of Polish community. The problem is to find a series of school bus routes that ensure the service is provided equitably to all eligible students. Because of the NP-hardness of the school bus routing problem, it is solved using some heuristic optimization method using real data from the considered exemplary school. The aim is to increase bus utilization and to reduce transportation times for students, while maintaining on-time delivery of students to the school. Although the problem under consideration is one of the earliest logistics problems solved using methods of operations research, remains valid and is the subject of research, as evidenced by numerous contemporary publications, presenting new methods for the formal specification and solution of the problem.
Źródło:
Research in Logistics & Production; 2014, 4, 1; 45-54
2083-4942
2083-4950
Pojawia się w:
Research in Logistics & Production
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A communication network routing problem: Modeling and optimization using non-cooperative game theory
Autorzy:
Dubey, Sapana P.
Kedar, Ganesh D.
Ghate, Suresh H.
Powiązania:
https://bibliotekanauki.pl/articles/1838181.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
communication network
routing problem
game theory
focal points
Nash equilibrium
Pareto optimal solution
sieć komunikacyjna
teoria gier
punkt ogniskowy
równowaga Nasha
Opis:
We consider a communication network routing problem wherein a number of users need to efficiently transmit their throughput demand in the form of data packets (incurring less cost and less delay) through one or more links. Using the game theoretic perspective, we propose a dynamic model which ensures unhindered transmission of data even in the case where the capacity of the link is exceeded. The model incorporates a mechanism in which users are appropriately punished (with additional cost) when the total data to be transmitted exceeds the capacity of the link. The model has multiple Nash equilibrium points. To arrive at rational strategies, we introduce the concept of focal points and get what is termed focal Nash equilibrium (FNE) points for the model. We further introduce the concept of preferred focal Nash equilibrium (PFNE) points and find their relation with the Pareto optimal solution for the model.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 1; 155-164
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison between Dijkstra algorithm and simplified ant colony optimization in navigation
Analiza porównawcza algorytmu Dijkstry i uproszczonego algorytmu mrówkowego w nawigacji
Autorzy:
Dramski, M.
Powiązania:
https://bibliotekanauki.pl/articles/360173.pdf
Data publikacji:
2012
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
poszukiwanie najkrótszej drogi
akwen ograniczony
nawigacja
shortest path routing
restricted area
navigation
Opis:
In this paper, two different shortest path routing algorithms in respect of basic navigation problems are discussed. First of them is a “state of art” in computer science – well known Dijkstra algorithm. The second one is a method based on artificial intelligence – simplified ant colony optimization proposed originally by Marco Dorigo. Author used both ways to find an optimal / suboptimal route for a ship in a restricted area. Results showed the advantages and disadvantages of both algorithms in simple static navigation situations.
W artykule omówiono dwa różne algorytmy poszukiwania najkrótszej drogi w odniesieniu do zagadnień nawigacji. Pierwszym z nich jest algorytm Dijkstry, stanowiący podstawę rozwiązywania tego typu problemów. Drugi to metoda bazująca na sztucznej inteligencji – uproszczony algorytm mrówkowy, zaproponowany przez Marco Dorigo. Autor używał obu sposobów w celu uzyskania optymalnej, bądź suboptymalnej trasy dla statku na akwenie ograniczonym. Rezultaty badań pokazały korzyści i wady ze stosowania obu rozwiązań w prostych sytuacjach nawigacyjnych.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2012, 29 (101); 25-29
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Comprehensive Survey on Routing and Security in Mobile Wireless Sensor Networks
Autorzy:
Al-Nasser, Ahmed
Almesaeed, Reham
Al-Junaid, Hessa
Powiązania:
https://bibliotekanauki.pl/articles/1844499.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
WSN
routing
security
Opis:
With the continuous advances in mobile wireless sensor networks (MWSNs), the research community has responded to the challenges and constraints in the design of these networks by proposing efficient routing protocols that focus on particular performance metrics such as residual energy utilization, mobility, topology, scalability, localization, data collection routing, Quality of Service (QoS), etc. In addition, the introduction of mobility in WSN has brought new challenges for the routing, stability, security, and reliability of WSNs. Therefore, in this article, we present a comprehensive and meticulous investigation in the routing protocols and security challenges in the theory of MWSNs which was developed in recent years.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 3; 483-496
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Comprehensive Survey on Routing and Security in Mobile Wireless Sensor Networks
Autorzy:
Al-Nasser, Ahmed
Almesaeed, Reham
Al-Junaid, Hessa
Powiązania:
https://bibliotekanauki.pl/articles/1844561.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
WSN
routing
security
Opis:
With the continuous advances in mobile wireless sensor networks (MWSNs), the research community has responded to the challenges and constraints in the design of these networks by proposing efficient routing protocols that focus on particular performance metrics such as residual energy utilization, mobility, topology, scalability, localization, data collection routing, Quality of Service (QoS), etc. In addition, the introduction of mobility in WSN has brought new challenges for the routing, stability, security, and reliability of WSNs. Therefore, in this article, we present a comprehensive and meticulous investigation in the routing protocols and security challenges in the theory of MWSNs which was developed in recent years.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 3; 379-384
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Constrained Maximum Available Frequency Slots on Path Based Online Routing and Spectrum Allocation for Dynamic Traffic in Elastic Optical Networks
Autorzy:
Khan, Akhtar Nawaz
Powiązania:
https://bibliotekanauki.pl/articles/1844474.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
elastic optical networks
routing and spectrum allocation
blocking probability
continuity constraint
contiguity constraint
Opis:
Elastic optical networking is a potential candidate to support dynamic traffic with heterogeneous data rates and variable bandwidth requirements with the support of the optical orthogonal frequency division multiplexing technology (OOFDM). During the dynamic network operation, lightpath arrives and departs frequently and the network status updates accordingly. Fixed routing and alternate routing algorithms do not tune according to the current network status which are computed offline. Therefore, offline algorithms greedily use resources with an objective to compute shortest possible paths and results in high blocking probability during dynamic network operation. In this paper, adaptive routing algorithms are proposed for shortest path routing as well as alternate path routing which make routing decision based on the maximum idle frequency slots (FS) available on different paths. The proposed algorithms select an underutilized path between different choices with maximum idle FS and efficiently avoids utilizing a congested path. The proposed routing algorithms are compared with offline routing algorithms as well as an existing adaptive routing algorithm in different network scenarios. It has been shown that the proposed algorithms efficiently improve network performance in terms of FS utilization and blocking probability during dynamic network operation.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 4; 707-714
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm for vehicle routing in logistic networks with practical constraints
Autorzy:
Koloch, Grzegorz
Lewandowski, Michał
Zientara, Marcin
Grodecki, Grzegorz
Matuszak, Piotr
Kantorski, Igor
Nowackig, Adam
Powiązania:
https://bibliotekanauki.pl/articles/1981356.pdf
Data publikacji:
2021-12-30
Wydawca:
Główny Urząd Statystyczny
Tematy:
rich vehicle routing problem
brownfield
hubs and satellites
genetic algorithm
Opis:
We optimise a postal delivery problem with time and capacity constraints imposed on vehicles and nodes of the logistic network. Time constraints relate to the duration of routes, whereas capacity constraints concern technical characteristics of vehicles and postal operation outlets. We consider a method which can be applied to a brownfield scenario, in which capacities of outlets can be relaxed and prospective hubs identified. As a solution, we apply a genetic algorithm and test its properties both in small case studies and in a simulated problem instance of a larger (i.e. comparable with real-world instances) size. We show that the genetic operators we employ are capable of switching between solutions based on direct origin-to-destination routes and solutions based on transfer connections, depending on what is more beneficial in a given problem instance. Moreover, the algorithm correctly identifies cases in which volumes should be shipped directly, and those in which it is optimal to use transfer connections within a single problem instance, if an instance in question requires such a selection for optimality. The algorithm is thus suitable for determining hubs and satellite locations. All considerations presented in this paper are motivated by real-life problem instances experienced by the Polish Post, the largest postal service provider in Poland, in its daily plans of delivering postal packages, letters and pallets.
Źródło:
Przegląd Statystyczny; 2021, 68, 3; 16-40
0033-2372
Pojawia się w:
Przegląd Statystyczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A logistic optimization for the vehicle routing problem through a case study in the food industry
Autorzy:
Akpinar, Muhammet Enes
Powiązania:
https://bibliotekanauki.pl/articles/1835487.pdf
Data publikacji:
2021
Wydawca:
Wyższa Szkoła Logistyki
Tematy:
vehicle routing problem
time windows
optimization
metaheuristic algorithm
genetic algorithm
trasa pojazdu
okna czasowe
optymalizacja
algorytm metaheurystyczny
algorytm genetyczny
Opis:
In this study, the food delivery problem faced by a food company is discussed. There are seven different regions where the company serves food and a certain number of customers in each region. The time of requesting food for each customer varies according to the shift situation. This type of problem is referred to as a vehicle routing problem with time windows in the literature and the main aim of the study is to minimize the total travel distance of the vehicles. The second aim is to determine which vehicle will follow which route in the region by using the least amount of vehicle according to the desired mealtime. Methods: In this study, genetic algorithm methodology is used for the solution of the problem. Metaheuristic algorithms are used for problems that contain multiple combinations and cannot be solved in a reasonable time. Thus in this study, a solution to this problem in a reasonable time is obtained by using the genetic algorithm method. The advantage of this method is to find the most appropriate solution by trying possible solutions with a certain number of populations. Results: Different population sizes are considered in the study. 1000 iterations are made for each population. According to the genetic algorithm results, the best result is obtained in the lowest population size. The total distance has been shortened by about 14% with this method. Besides, the number of vehicles in each region and which vehicle will serve to whom has also been determined. This study, which is a real-life application, has provided serious profitability to the food company even from this region alone. Besides, there have been improvements at different rates in each of the seven regions. Customers' ability to receive service at any time has maximized customer satisfaction and increased the ability to work in the long term. Conclusions: The method and results used in the study were positive for the food company. However, the metaheuristic algorithm used in this study does not guarantee an optimal result. Therefore, mathematical models or simulation models can be considered in terms of future studies. Besides, in addition to the time windows problem, the pickup problem can also be taken into account and different solution proposals can be developed.
Źródło:
LogForum; 2021, 17, 3; 387-397
1734-459X
Pojawia się w:
LogForum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new algorithm for calculating the most reliable pair of disjoint paths in a network
Autorzy:
Gomes, T.
Craveirinha, J.
Violante, A.
Powiązania:
https://bibliotekanauki.pl/articles/308916.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
reliability
OR in telecommunications
routing
Opis:
In various types telecommunication networks, namely mobile ad hoc networks, WDM networks and MPLS networks, there is the necessity of calculating disjoint paths for given node to node connections in order to increase the reliability of the services supported by these networks. This leads to the problem of calculating a pair of disjoint paths (or a set of disjoint paths) which optimises some measure of performance in those networks. In this paper we present an algorithm, designated as OptDP, for obtaining the most reliable pair of disjoint paths based on the loopless version of MPS, a very efficient k-shortest path algorithm, and on Dijkstra algorithm. Since to the best of our knowledge there is no other proposal of an algorithm capable of solving exactly the same problem we perform a comparison with the application to this problem of the DPSP algorithm which calculates a set of disjoint paths with high reliability. Also a comparison with a simplified version (designated as NopDP) of the proposed algorithm, which stops after a maximal number F of candidate pairs of paths have been found, is presented. The comparison also includes the percentage of cases in which both algorithms were not capable of finding the optimal pair.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 4; 31-38
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new multiple objective dynamic routing method using implied costs
Autorzy:
Craveirinha, J.
Martins, L.
Antunes, C.H.
Climaco, J.N.
Powiązania:
https://bibliotekanauki.pl/articles/307698.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
dynamic routing
multicriteria decision support systems
traffic management
Opis:
There are advantages in considering the routing problem in integrated communication networks as a multiobjective shortest path problem, having in mind to grasp eventual conflicts and trade-offs among distinct objectives and quality of services (QoS) constraints. On the other hand the utilisation of dynamic routing methods in various types of networks is well known to have significant impact on network performance and cost, namely in overload and failure conditions. This paper presents the detailed formulation of a proposal of a multiple objective dynamic routing method (MODR) of periodic state dependent routing type, enabling to represent distinct QoS related metrics and requirements in a consistent manner. The MODR method present formulation is based on a multiple objective shortest path model with constraints and is prepared to use implied costs as one of the metrics. Alternative paths tor each traffic flow are changed as a function of periodic updates of certain QoS related parameters estimated from real time measurements on the routes and trunks of the network. Such paths are computed by a specialised and efficient variant of a bi-objective shortest path constrained algorithm, developed for the MODR, enabling to incorporate flexible requirements on the QoS metrics. The architecture of the routing system is discussed together with the features of its main modules. An illustrative example of application of the MODR path calculation module to a circuit-switched type network using blocking probability and implied cost as metrics, is also presented, considering different overload conditions.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 50-59
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new planning model to support logistics service providers in selecting mode, route, and terminal location
Autorzy:
Huynh, N.
Fotuhi, F.
Powiązania:
https://bibliotekanauki.pl/articles/260169.pdf
Data publikacji:
2013
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
intermodal transport
freight logistics
network design
facility location
routing
mode choice
Opis:
In this paper, we address thefreight network design problem. A mixed integer linear program is formulated to help logistics service providers jointlyselect the best terminal locations among a set of candidate locations, shipping modes, and route for shipping different types of commodities. The developed model isapplied to two different networksto show its applicability. Results obtained from CPLEX for the case studiesare presented, and the benefit of the proposed model is discussed.
Źródło:
Polish Maritime Research; 2013, S 1; 67-73
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Prototype of Ship Routing Decision Support System for an Operational Oceanographic Service
Autorzy:
Mannarini, G.
Coppini, G.
Oddo, P.
Pinardi, N.
Powiązania:
https://bibliotekanauki.pl/articles/116874.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Ship Routing
decision support system (DSS)
Operational Oceanographic Service
Opis:
A prototype for an operational ship routing Decision Support System using time‐dependent meteo‐oceanographic fields is presented. The control variable is ship course, which is modified using a directional resolution of less than 27 degrees. The shortest path is recovered using a modified Dijkstra’s algorithm. Safety restrictions for avoiding surfriding and parametric rolling according to the guidelines of the International Maritime Organization (IMO) are implemented. Numerical experiments tailored on a mediumsize vessel are presented and perspectives of development of the system are outlined.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2013, 7, 1; 53-59
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A routing algorithm and a router architecture for 3D NoC
Autorzy:
Kanagasabapathi, Somasundaram
Calicut, Chythanya
Powiązania:
https://bibliotekanauki.pl/articles/305713.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
3D topology
router
network on chip
routing algorithm
Opis:
In recent years, the enhancement of microchip technologies has enabled large scale Systems-on-Chip (SoC). Due to sharp increase in number of processing elements, SoC faces various challenges in design and testing. Network on Chip (NoC) is an alternative technology to overcome the challenges in SoC design and testing. NoC emerged as a key architecture that allows one to optimize the parameters like power and area. In spite of its applications, NoC faces some real time challenges like designing an optimum topology, routing scheme and application mappings. In this paper, we address the main three issues on NoC, namely, designing of an optimal topology, routing algorithm and a router design for the topology. First, we propose a topology and a routing algorithm. We prove that our recursive network topology is Hamiltonian connected and we propose an algorithm for data packet transmissions, which is free from cyclic deadlocks and the algorithm maximizes the congestion factor. Our experimental results show that the proposed topology gives better performance in terms of average latency and power than the other topologies. Finally, we propose a router architecture for our 3D-NoC. The router architecture is based on shared buffers. Also, our experimental results indicate that the proposed router architecture consumes less area and power than the Virtual Channel architecture.
Źródło:
Computer Science; 2019, 20 (3); 369-383
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A routing protocol for wireless network of bedside monitors in fetal surveillance system
Autorzy:
Seredynski, R.
Horoba, K.
Roj, D.
Bernys, M.
Przybyla, T.
Jezewski, J.
Powiązania:
https://bibliotekanauki.pl/articles/333626.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
monitorowanie płodu
tętno płodu
sieci bezprzewodowe
protokoły rutowania
symulacja
fetal monitoring
fetal heart rate
wireless networks
routing protocol
simulation
Opis:
The paper presents the methodology of wireless network design, developed according to the requirements originating from existing wired fetal surveillance systems. The proposed network structure is based on popular radio frequency modules, operating in 433/866MHz band. The described solution is a simple and cost effective alternative to the wired networks, and it will vastly increase the mobility of fetal monitors. The authors also describe software tools which were designed for this purpose and the results of simulations performed on their basis.
Źródło:
Journal of Medical Informatics & Technologies; 2012, 21; 27-33
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Scalable Multicast Routing Protocol for Mobile Ad-Hoc Networks
Autorzy:
Qabajeh, Liana Khamis
Powiązania:
https://bibliotekanauki.pl/articles/2142308.pdf
Data publikacji:
2022
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
ad-hoc network
MAODV
ODMRP
position-based multicast routing protocol
simulated performance evaluation
Opis:
The multicasting technique supports a variety of applications that require data to be instantaneously transmitted to a set of destination nodes. In environments with continuously moving nodes, such as mobile ad-hoc networks, the search for efficient routes from sources to the projected destinations is a common issue. Proposed Windmill protocol provides a scalable multicast solution for mobile ad-hoc networks. Windmill aims to improve routing protocol’s performance by introducing a hierarchal distributed routing algorithm and dividing the area into zones. Additionally, it attempts to demonstrate better scalability, performance and robustness when faced with frequent topology changes, by utilizing restricted directional flooding. A detailed and extensive simulated performance evaluation has been conducted to assess Windmill and compare it with multicast ad-hoc on-demand distance vector (MAODV) and on-demand multicast routing protocols (ODMRP). Simulation results show that the three protocols achieved high packet delivery rates in most scenarios. Results also show that Windmill is capable of achieving scalability by maintaining the minimum packet routing load, even upon increasing the nodes’ speed, the number of sources, the number of group members and the size of the simulated network. The results also indicate that it offers superior performance and is well suited for ad-hoc wireless networks with mobile hosts. The trade-off of using Windmill consists in slightly longer paths – a characteristic that makes it a good choice for applications that require simultaneous data transmission to a large set of nodes.
Źródło:
Journal of Telecommunications and Information Technology; 2022, 2; 58--74
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 237

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies