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ę "a* algorithm" wg kryterium: Wszystkie pola

  Lista filtrów

Dostawca treści

Podbaza

Wyrównaj
Wyświetlanie 1-50 z 2863
Tytuł:
Path Planning for Multiple Mobile Robots Using A* Algorithm
Autorzy:
Hüseyin Filiz, İ.
Olguner, S.
Evyapan, E.
Powiązania:
https://bibliotekanauki.pl/articles/1031600.pdf
Data publikacji:
2017-09
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
02.60.Pn
Opis:
This study presents optimization of planetary gear train in a specific configuration. General characteristics of planetary gear trains are discussed briefly. A compound configuration for planetary gear train is selected and an optimization study is performed for this configuration. For the given input power, motor speed and overall gear ratio, modules, facewidths, teeth numbers of gears are found, satisfying the condition of minimum kinetic energy of the gear trains. In optimization, the objective is set to minimization of kinetic energy. Allowable bending stress and allowable contact stress are considered as design constraints. Minimum teeth number for a given pressure angle, center distance, recommendation on the facewidth, limitations on teeth ratios are considered as geometrical and kinematical constraints. The Matlab® Optimtool optimization toolbox is used. Results for certain operating conditions are obtained and tabulated.
Źródło:
Acta Physica Polonica A; 2017, 132, 3; 728-733
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Path Planning for Multiple Mobile Robots Using A* Algorithm
Autorzy:
Batik Garip, Z.
Karayel, D.
Ozkan, S.
Atali, G.
Powiązania:
https://bibliotekanauki.pl/articles/1031599.pdf
Data publikacji:
2017-09
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
42.30.Tz
45.40.Ln
87.85.St
87.55.de
87.55.K-
87.55.kd
Opis:
One of the main problems in path planning for multiple mobile robots is to find the optimal path between two points so that robots can follow the shortest path and consume the least energy. Also, motion planning is important to avoid collisions if multiple mobile robots are running together within environments with obstacles. In this study, motion planning for multiple robots has been proposed. It is desired that robots could move in coordination with each other from the starting point to the destination point on a plane. The coordinates of the objects and mobile robots have been acquired using image processing with a single ceiling camera. The path planning for the shortest distance has been performed using A* algorithm in dynamic frame between robot-object and object-target point, respectively. A graphical user interface has been developed based on MATLAB GUI. It is hoped that the developed system will have a wide area of applications in industry and will make important contributions for the improvement of manufacturing, assembly, transportation and storage technologies.
Źródło:
Acta Physica Polonica A; 2017, 132, 3; 685-688
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The idea of using the A* algorithm for route planning an unmanned vehicle “Edredon”
Autorzy:
Naus, K.
Wąż, M.
Powiązania:
https://bibliotekanauki.pl/articles/359690.pdf
Data publikacji:
2013
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
A* algorithm
navigation system
route planning
electronic chart
vehicle „Edredon”
Opis:
This article presents the concept of algorithm A* functioning in a navigation system equipped with electronic navigational chart for autonomous planning the shortest and safest route crossing an offshore unmanned vehicle “Edredon”. The first part describes the general technical architecture and functionality of the vehicle's navigation system. In the second part shows in detail the modules of the system responsible for the planning of the road and how to implement them in the A* algorithm. The third part describes the proper operation of testing whether the A* algorithm in the navigation system, while the task of planning the route of the autonomous vehicle. Final part is a discussion of the results obtained from tests carried out in order to evaluate the applicability of the A* algorithm for route planning in autonomous navigation systems.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 2; 143-147
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
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ł:
Sequential Classification of Palm Gestures Based on A* Algorithm and MLP Neural Network for Quadrocopter Control
Autorzy:
Wodziński, M.
Krzyżanowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/221525.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
machine learning
shortest path
sequential data
quadrocopter
GPU
CUDA
Opis:
This paper presents an alternative approach to the sequential data classification, based on traditional machine learning algorithms (neural networks, principal component analysis, multivariate Gaussian anomaly detector) and finding the shortest path in a directed acyclic graph, using A* algorithm with a regression-based heuristic. Palm gestures were used as an example of the sequential data and a quadrocopter was the controlled object. The study includes creation of a conceptual model and practical construction of a system using the GPU to ensure the realtime operation. The results present the classification accuracy of chosen gestures and comparison of the computation time between the CPU- and GPU-based solutions.
Źródło:
Metrology and Measurement Systems; 2017, 24, 2; 265-276
0860-8229
Pojawia się w:
Metrology and Measurement Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A mesh algorithm for principal quadratic forms
Autorzy:
Polak, A.
Powiązania:
https://bibliotekanauki.pl/articles/106252.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
mesh algorithm
quadratic form
quadratic diophantine equation
Opis:
In 1970 a negative solution to the tenth Hilbert problem, concerning the determination of integral solutions of diophantine equations, was published by Y. W. Matiyasevich. Despite this result, we can present algorithms to compute integral solutions (roots) to a wide class of quadratic diophantine equations of the form q(x) = d, where q : Z is a homogeneous quadratic form. We will focus on the roots of one (i.e., d = 1) of quadratic unit forms (q11 = ... = qnn = 1). In particular, we will describe the set of roots Rq of positive definite quadratic forms and the set of roots of quadratic forms that are principal. The algorithms and results presented here are successfully used in the representation theory of finite groups and algebras. If q is principal (q is positive semi-definite and Ker q={v ∈ Zn; q(v) = 0}= Z · h) then |Rq| = ∞. For a given unit quadratic form q (or its bigraph), which is positive semi-definite or is principal, we present an algorithm which aligns roots Rq in a Φ-mesh. If q is principal (|Rq| is less than ∞), then our algorithm produces consecutive roots in Rq from finite subset of Rq, determined in an initial step of the algorithm.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2011, 11, 1; 23-31
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Numerical Algorithm for Filtering and State Observation
Autorzy:
Ibrir, S.
Powiązania:
https://bibliotekanauki.pl/articles/908263.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
krzywa składana
różniczkowanie numeryczne
obserwator
spline functions
numerical differentiation
observers
smooth filters
Opis:
This paper deals with a numerical method for data fitting and estimation of continuous higher-order derivatives of a given signal from its non-exactsampled data. The proposed algorithm is a generalization of the algorithm proposed by Reinsch (1967). This algorithm is conceived as a key element in the structure of the numerical observer discussed in our recent papers. Satisfactory results are obtained which prove the efficiency of the proposed approach.
Źródło:
International Journal of Applied Mathematics and Computer Science; 1999, 9, 4; 855-869
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new algorithm for generation of decision trees
Autorzy:
Grzymała-Busse, J. W.
Hippe, Z. S.
Knap, M.
Mroczek, T.
Powiązania:
https://bibliotekanauki.pl/articles/1965778.pdf
Data publikacji:
2004
Wydawca:
Politechnika Gdańska
Tematy:
artificial intelligence
supervised machine learning
decision trees
Bayes networks
Opis:
A new algorithm for development of quasi-optimal decision trees, based on the Bayes theorem, has been created and tested. The algorithm generates a decision tree on the basis of Bayesian belief networks, created prior to the formation of the decision tree. The efficiency of this new algorithm was compared with three other known algorithms used to develop decision trees. The data set used for the experiments was a set of cases of skin lesions, histopatolgically verified.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2004, 8, 2; 243-247
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A quick algorithm for planning a path for a biomimetic autonomous underwater vehicle
Autorzy:
Praczyk, T.
Powiązania:
https://bibliotekanauki.pl/articles/135094.pdf
Data publikacji:
2016
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
path planning
underwater vehicle
autonomy
collision avoidance
automatic control
effective planning algorithm
Opis:
Autonomous underwater vehicles are vehicles that are entirely or partly independent of human decisions. In order to obtain operational independence, the vehicles have to be equipped with specialized software. The task of the software is to move the vehicle along a trajectory while avoiding collisions. In its role of avoiding obstacles, the vehicle may sometimes encounter situations in which it is very difficult to determine what the next movement should be from an ad hoc perspective. When such a situation occurs, a planning component of the vehicle software should be run with the task of charting a safe trajectory between nearby obstacles. This paper presents a new path planning algorithm for a Biomimetic Autonomous Underwater Vehicle. The main distinguishing feature of the algorithm is its high speed compared with such classic planning algorithms as A*. In addition to presenting the algorithm, this paper also summarizes preliminary experiments intended to assess the effectiveness of the proposed algorithm.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 45 (117); 23-28
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new optimal algorithm for a time-dependent scheduling problem
Autorzy:
Kubale, M.
Ocetkiewicz, K. M.
Powiązania:
https://bibliotekanauki.pl/articles/969669.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
scheduling
single machine
deteriorating jobs
total completion time
algorithms
Opis:
In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs, j1,...,jn, and the processing time pi of the i-th job is given by pi = 1 + biSi, where si is the starting time of the i-th job, i = 1,...n. If all jobs have different and non-zero deterioration rates and bi [wzór], where bmin = min{bi}, then an optimal schedule can be found in O(n log n) time. The conducted computational experiments show that the presented algorithm performs very well even on data not satisfying the assumed constraints.
Źródło:
Control and Cybernetics; 2009, 38, 3; 713-721
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Application of Probabilistic Grammars to Efficient Machne Translation
Autorzy:
Skórzewski, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/1037598.pdf
Data publikacji:
2010-09-15
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
a* algorithm
machine translation
natural language parsing
pcfg
probabilistic grammars
Opis:
In this paper we present one of the algorithms used to parse probabilistic context-free grammars: the A* parsing algorithm, which is based on the A* graph search method. We show an example of application of the algorithm in an existing machine translation system. The existing CYK-based parser used in the Translatica system was modified by applying the A* parsing algorithm in order to examine the possibilities of improving its performance. This paper presents the results of applying the A* algorithm with different heuristic functions and their impact on the performance of the parser.
Źródło:
Investigationes Linguisticae; 2010, 21; 90-98
1426-188X
1733-1757
Pojawia się w:
Investigationes Linguisticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parallelizing a new algorithm for the set partition problem
Autorzy:
Chi Thanh, Hoang
Powiązania:
https://bibliotekanauki.pl/articles/764365.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2010, 10, 2
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
RED-LE: A Revised Algorithm for Active Queue Management
Autorzy:
Hassan, Samuel O.
Powiązania:
https://bibliotekanauki.pl/articles/2142301.pdf
Data publikacji:
2022
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
active queue management
network congestion
router
RED-LE
simulation
Opis:
The random early detection (RED) algorithm was developed in 1993. Nearly three decades later, several improved variants have been proposed by scientists. The use of a (pure) linear function for computing packet drop probability has turned out to be a disadvantage, leading to the problem of large delays. Such a problem may be addressed by using linear and non-linear (i.e. as exponential) packet drop probability functions. This paper proposes a revised RED active queue management algorithm named RED-linear exponential (RED-LE). This variant involves an interplay of linear and exponential drop functions, in order to improve the performance of the original RED algorithm. More importantly, at low and moderate network traffic loads, the RED-LE algorithm employs the linear drop action. However, for high traffic loads, RED-LE employs the exponential function for computing the packet drop probability rate. Experimental results have shown that RED-LE effectively controls congestion and offers an improved network performance under different traffic loads.
Źródło:
Journal of Telecommunications and Information Technology; 2022, 2; 91--97
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A direct algorithm of possibilistic clustering with partial supervision
Autorzy:
Viattchenin, D.
Powiązania:
https://bibliotekanauki.pl/articles/385026.pdf
Data publikacji:
2007
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
clustering
fuzzy tolerance
fuzzy cluster
membership degree
allotment
typical point
labeled object
and partial supervision
Opis:
Fuzzy clustering plays an important role in intelligent systems design and the respective methods constitute a part of the areas of automation and robotics. This paper describes a modification of a direct algorithm of possibilistic clustering that takes into account the information coming from the labeled objects. The clustering method based on the concept of allotment among fuzzy clusters is the basis of the new algorithm. The paper provides the description of basic ideas of the method and the plan of the basic version of a direct possibilistic-clustering algorithm. A plan of modification of the direct possibilistic-clustering algorithm in the presence of information from labeled objects is proposed. An illustrative example of the method's application to the Sneath and Sokal's two-dimensional data in comparison with the Gaussian-clustering method is carried out. Preliminary conclusions are formulated.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2007, 1, 3; 29-38
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hybrydowy algorytm samolokalizacji
A hybrid algorithm for self location
Autorzy:
Dimitrova-Grekow, T.
Powiązania:
https://bibliotekanauki.pl/articles/156755.pdf
Data publikacji:
2013
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
roboty mobilne
nawigacja
lokalizacja
metryczno-topologiczne strategie
roboty edukacyjne
Mindstorms NXT
mobile robotics
navigation
location
topological-metric strategies
educational robots
Opis:
Niniejszy artykuł prezentuje podejście hybrydowe do samolokalizacji w oparciu o zintegrowany system zbierania danych. Obie funkcje topologiczna i metryczna zostały zrealizowane z użyciem dalmierza ultradźwiękowego. Do przetestowania poprawności działania opracowanej metody wykorzystano robot Lego Mindstorms NXT. Zaprezentowane rozwiązanie przyśpiesza pracę pojazdu, skracając czas rozpoznawania napotkanych obiektów orientacyjnych. Minimalizowany jest błąd odometryczny. Bardzo istotnym elementem pracy jest identyfikacja obiektów, ich orientacji i budowanie modelu mapy o względnym stopniu zaufania. Przeprowadzone badania wykazały wysoką dokładność zaprezentowanej metody samolokalizacji.
Application of two independent systems is a classical approach when realizing topological-metric localization algorithms [1, 2, 3]. In this issue a hybrid localization method with an integrated data collecting is proposed. Both functions, topological and metric, are based on a sonar. Multi-reflections are one of the biggest problems by the sonar systems [7, 8]. However, there are many examples of using sonars in the Simultaneous Localization and Mapping (SLAM) [4, 9]. The presented method (Section 2) consists of four phases: 1) data collec-tion and filtering (Figs. 1 and 2), 2) object classification (Fig. 3), 3) building map with a confidence coefficient (Fig. 4), 4) local and global map (Fig. 5) comparison and end decision. Many authors use a grid map for the topological localization [5, 6]. Here a model matching attempt is performed. The concept of the confidence coefficient map is very important in this work. Section 3 describes an experiment whose workspace is shown in Fig. 6. The results (Section 4) are presented in Table 1: 77% of the tests were successful , 14% gave fault results, while in 9% – no solution was found. In spite of the restrictions of the used robot, the project seems very perspective.
Źródło:
Pomiary Automatyka Kontrola; 2013, R. 59, nr 11, 11; 1163-1166
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A hybrid algorithm for solving inverse problems in elasticity
Autorzy:
Barabasz, B.
Gajda-Zagórska, E.
Migórski, S.
Paszyński, M.
Schaefer, R.
Smołka, M.
Powiązania:
https://bibliotekanauki.pl/articles/331427.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
inverse problem
hierarchic genetic strategy
hybrid optimization
automatic hp adaptive finite element method
zagadnienie odwrotne
strategia genetyczna
optymalizacja hybrydowa
metoda elementów skończonych
Opis:
The paper offers a new approach to handling difficult parametric inverse problems in elasticity and thermo-elasticity, formulated as global optimization ones. The proposed strategy is composed of two phases. In the first, global phase, the stochastic hp-HGS algorithm recognizes the basins of attraction of various objective minima. In the second phase, the local objective minimizers are closer approached by steepest descent processes executed singly in each basin of attraction. The proposed complex strategy is especially dedicated to ill-posed problems with multimodal objective functionals. The strategy offers comparatively low computational and memory costs resulting from a double-adaptive technique in both forward and inverse problem domains. We provide a result on the Lipschitz continuity of the objective functional composed of the elastic energy and the boundary displacement misfits with respect to the unknown constitutive parameters. It allows common scaling of the accuracy of solving forward and inverse problems, which is the core of the introduced double-adaptive technique. The capability of the proposed method of finding multiple solutions is illustrated by a computational example which consists in restoring all feasible Young modulus distributions minimizing an objective functional in a 3D domain of a photo polymer template obtained during step and flash imprint lithography.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 865-886
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new algorithm for a CFE-approximated solution of a discrete-time noninteger-order state equation
Autorzy:
Oprzędkiewicz, K.
Stanisławski, R.
Gawin, E.
Mitkowski, W.
Powiązania:
https://bibliotekanauki.pl/articles/199796.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fractional order calculus
discrete-time noninteger-order state equation
continuous fraction expansion
Al-Alaoui operator
równanie dyskretne
aproksymacja Al-Alaoui
CFE
Opis:
In the paper, a new method for solution of linear discrete-time fractional-order state equation is presented. The proposed method is simpler than other methods using directly discrete-time version of the Grünwald-Letnikov operator. The method is dedicated to use with any approximator to the operator expressed by a discrete transfer function, e.g. CFE-based Al-Alaoui approximation. A simulation example confirms the usefulness of the method.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 429-437
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Planning and management of aircraft maintenance using a genetic algorithm
Autorzy:
Kowalski, Mirosław
Izdebski, Mariusz
Żak, Jolanta
Gołda, Paweł
Manerowski, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/1841765.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
aircraft operation
maintenance
multi-criteria optimization
genetic algorithm
Opis:
The aim of the article was to develop a tool to support the process of planning and managing aircraft (ac) maintenance. Aircraft maintenance management has been presented for scheduled technical inspections resulting from manufacturers’ technical documentation for ac. The authors defined the problem under investigation in the form of a four-phase decisionmaking process taking into account assignment of aircraft to airports and maintenance stations, assignment of crew to maintenance points, setting the schedules, i.e. working days on which aircraft are directed to maintenance facilities. This approach to the planning and management of aircraft maintenance is a new approach, unprecedented in the literature. The authors have developed a mathematical model for aircraft maintenance planning and management in a multi-criteria approach and an optimisation tool based on the operation of a genetic algorithm. To solve the problem, a genetic algorithm was proposed. The individual steps of the algorithm construction were discussed and its effectiveness was verified using real data.
Źródło:
Eksploatacja i Niezawodność; 2021, 23, 1; 143-153
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Planning and management of aircraft maintenance using a genetic algorithm
Autorzy:
Kowalski, Mirosław
Izdebski, Mariusz
Żak, Jolanta
Gołda, Paweł
Manerowski, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/1841824.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
aircraft operation
maintenance
multi-criteria optimization
genetic algorithm
Opis:
The aim of the article was to develop a tool to support the process of planning and managing aircraft (ac) maintenance. Aircraft maintenance management has been presented for scheduled technical inspections resulting from manufacturers’ technical documentation for ac. The authors defined the problem under investigation in the form of a four-phase decisionmaking process taking into account assignment of aircraft to airports and maintenance stations, assignment of crew to maintenance points, setting the schedules, i.e. working days on which aircraft are directed to maintenance facilities. This approach to the planning and management of aircraft maintenance is a new approach, unprecedented in the literature. The authors have developed a mathematical model for aircraft maintenance planning and management in a multi-criteria approach and an optimisation tool based on the operation of a genetic algorithm. To solve the problem, a genetic algorithm was proposed. The individual steps of the algorithm construction were discussed and its effectiveness was verified using real data.
Źródło:
Eksploatacja i Niezawodność; 2021, 23, 1; 143-153
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
Algorytm 45. Heurystyczny algorytm dla zagadnienia komiwojażera
Autorzy:
Adrabiński, A.
Powiązania:
https://bibliotekanauki.pl/articles/742298.pdf
Data publikacji:
1976
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Źródło:
Applicationes Mathematicae; 1976-1977, 15, 2; 223-244
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A practical algorithm management of patients with benign prostatic hyperplasia
Autorzy:
Dutkiewicz, S.
Powiązania:
https://bibliotekanauki.pl/articles/3168.pdf
Data publikacji:
2008
Wydawca:
Instytut Medycyny Wsi
Tematy:
algorithm management
human disease
patient
benign prostate hyperplasia
hyperplasia
man
urinary outflow obstruction
enlargement
prostate
alpha1-adrenoreceptor blocker
5-alpha-reductase inhibitor
combination therapy
surgical treatment
Źródło:
Journal of Pre-Clinical and Clinical Research; 2008, 02, 2
1898-2395
Pojawia się w:
Journal of Pre-Clinical and Clinical Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
R peak determination using a WDFR algorithm and Adaptive threshold
Autorzy:
Nguyen, Thanh-Nghia
Nguyen, Thanh-Hai
Ngo, Ba-Viet
Powiązania:
https://bibliotekanauki.pl/articles/38437166.pdf
Data publikacji:
2022
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
ECG signal
wavelet transforms
WDFR algorithm
R peak determination
adaptive threshold
Opis:
The determination of the R peak position in the ECG signal helps physicians not only to know the heart rate per minute, but also to monitor the patient’s health related to heart disease. This paper proposes a system to accurately determine the R peak position in the ECG signal. The system consists of a pre-processing block for filtering out noise using a WDFR algorithm and highlighting the amplitude of the R peak and a threshold value is calculated for determining the R peak. In this research, the MIT-BIH ECG dataset with 48 records are used for evaluation of the system. The results of the SEN, +P, DER and ACC parameters related to the system quality are 99.70%, 99.59%, 0.70% and 99.31%, respectively. The obtained performance of the proposed R peak position determination system is very high and can be applied to determine the R peak of the ECG signal measuring devices in practice.
Źródło:
Applied Computer Science; 2022, 18, 3; 19-30
1895-3735
2353-6977
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A diagnostic algorithm diagnosing the failure of railway signal equipment
Autorzy:
Wu, Yongcheng
Cao, Dejin
Powiązania:
https://bibliotekanauki.pl/articles/1955227.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Polskie Towarzystwo Diagnostyki Technicznej PAN
Tematy:
failure diagnosis
railway signal equipment
denoising
feature extraction
diagnostyka uszkodzeń
sygnalizacja kolejowa
odszumianie
ekstrakcja cech
Opis:
Failure of railway signal equipment can cause an impact on its normal operation, and it is necessary to make a timely diagnosis of the failure. In this study, the data of a railway bureau from 2016 to 2020 were studied as an example. Firstly, denoising and feature extraction were performed on the data; then the Adaptive Comprehensive Oversampling (ADASYN) method was used to synthesize minority class samples; finally, three algorithms, back-propagation neural network (BPNN), support vector machine (SVM) and C4.5 algorithms, were used for failure diagnosis. It was found that the three algorithms performed poorly in diagnosing the original data but performed significantly better in diagnosing the synthesized samples, among which the BPNN algorithm had the best performance. The average precision, recall rate and F1 score of the BPNN algorithm were 0.94, 0.92 and 0.93, respectively. The results verify the effectiveness of the BPNN algorithm for failure diagnosis, and the algorithm can be further promoted and applied in practice.
Źródło:
Diagnostyka; 2021, 22, 4; 33-38
1641-6414
2449-5220
Pojawia się w:
Diagnostyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm for the maximum 2-packing set problem
Autorzy:
Trejo-Sánchez, Joel Antonio
Fajardo-Delgado, Daniel
Gutierrez-Garcia, J. Octavio
Powiązania:
https://bibliotekanauki.pl/articles/330154.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
maximum 2-packing set
genetic algorithms
graph algorithms
algorytm genetyczny
algorytm grafowy
Opis:
Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality. In this paper, we present a genetic algorithm for the maximum 2-packing set problem on arbitrary graphs, which is an NP-hard problem. To the best of our knowledge, this work is a pioneering effort to tackle this problem for arbitrary graphs. For comparison, we extended and outperformed a well-known genetic algorithm originally designed for the maximum independent set problem. We also compared our genetic algorithm with a polynomial-time one for the maximum 2-packing set problem on cactus graphs. Empirical results show that our genetic algorithm is capable of finding 2-packing sets with a cardinality relatively close (or equal) to that of the maximum 2-packing sets. Moreover, the cardinality of the 2-packing sets found by our genetic algorithm increases linearly with the number of vertices and with a larger population and a larger number of generations. Furthermore, we provide a theoretical proof demonstrating that our genetic algorithm increases the fitness for each candidate solution when certain conditions are met.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 1; 173-184
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Artificial intelligence in solving collision problem in restricted area
Autorzy:
Mąka, M.
Dramski, M.
Powiązania:
https://bibliotekanauki.pl/articles/359349.pdf
Data publikacji:
2013
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
shortest path
safe route
restricted area
trapezoidal grid
area discretization
simplified ant algorithm
A* algorithm
Opis:
This paper presents one of the approaches to solve the collision problem in restricted area for two moving objects using artificial intelligence (SACO algorithm). Although AI should be used only when the classic methods fail, a simple comparison between them is very interesting. As we know the main task of navigation is to conduct safely an object from the point of departure to destination. This problem does not seem easy, especially if we consider the movement in restricted areas such narrow passages, ports etc.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 2; 118-122
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A control algorithm for joint flight of a group of drones
Autorzy:
Sabziev, Elkhan
Powiązania:
https://bibliotekanauki.pl/articles/2116418.pdf
Data publikacji:
2021
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
group flight
drone
algorithm
lot grupowy
dron
algorytm
Opis:
Using drones in groups in the military field is not a novel idea. A massive attack by a large amount of equipment is known to be very difficult to prevent. Therefore, it is a good tactic to sacrifice some of the relatively cheap drones to destroy special enemy targets in a massive attack. This raises the issue of joint control of the behaviour of a group of drones. This paper proposes a System of Systems ideology-based decision-making system that allows to individually control each drone in a group flight. An algorithm is developed that allows controlling drones by controlling their speed.
Źródło:
Zeszyty Naukowe. Transport / Politechnika Śląska; 2021, 110; 157--167
0209-3324
2450-1549
Pojawia się w:
Zeszyty Naukowe. Transport / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A linear algorithm for the two paths problem on permutation graphs
Autorzy:
Gopalakrishnan, C.
Pandu Rangan, C.
Powiązania:
https://bibliotekanauki.pl/articles/972048.pdf
Data publikacji:
1995
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
algorithm
bridge
connectivity
disjoint paths
permutation graph
two paths problem
Opis:
The 'two paths problem' is stated as follows. Given an undirected graph G = (V,E) and vertices s₁,t₁;s₂,t₂, the problem is to determine whether or not G admits two vertex-disjoint paths P₁ and P₂ connecting s₁ with t₁ and s₂ with t₂ respectively. In this paper we give a linear (O(|V|+ |E|)) algorithm to solve the above problem on a permutation graph.
Źródło:
Discussiones Mathematicae Graph Theory; 1995, 15, 2; 147-166
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A parallel algorithm of icsym forcomplexsymmetric linear systems in quantum chemistry
Autorzy:
Zhang, Y.
Lv, Q.
Xiao, M.
Xie, G.
Breitkopf, P.
Powiązania:
https://bibliotekanauki.pl/articles/305677.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
complex symmetric linear systems
parallel computing
improved conjugate gradient-type iterative algorithm (ICSYM)
Opis:
Computational effort is a common issue for solving large-scale complex symmetric linear systems, particularly in quantum chemistry applications. In order to alleviate this problem, we propose a parallel algorithm of improved conjugate gradient-type iterative (ICSYM). Using three-term recurrence relation and or- thogonal properties of residual vectors to replace the tridiagonalization process of classical CSYM, which allows to decrease the degree of the reduce-operator from two to one communication at each iteration and to reduce the amount of vector updates and vector multiplications. Several numerical examples are implemented to show that high performance of proposed improved version is obtained both in convergent rate and in parallel efficiency.
Źródło:
Computer Science; 2018, 19 (4); 385-401
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm for the project scheduling with the resource constraints
Autorzy:
Klimek, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/764689.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2010, 10, 1
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An autonomous vehicle sequencing problem at intersections: A genetic algorithm approach
Autorzy:
Yan, F.
Dridi, M.
El Moudni, A.
Powiązania:
https://bibliotekanauki.pl/articles/329874.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
autonomous vehicle
autonomous intersection management
genetic algorithm
dynamic programming
heuristics
pojazd autonomiczny
algorytm genetyczny
programowanie dynamiczne
Opis:
This paper addresses a vehicle sequencing problem for adjacent intersections under the framework of Autonomous Intersection Management (AIM). In the context of AIM, autonomous vehicles are considered to be independent individuals and the traffic control aims at deciding on an efficient vehicle passing sequence. Since there are considerable vehicle passing combinations, how to find an efficient vehicle passing sequence in a short time becomes a big challenge, especially for more than one intersection. In this paper, we present a technique for combining certain vehicles into some basic groups with reference to some properties discussed in our earlier works. A genetic algorithm based on these basic groups is designed to find an optimal or a near-optimal vehicle passing sequence for each intersection. Computational experiments verify that the proposed genetic algorithms can response quickly for several intersections. Simulations with continuous vehicles are carried out with application of the proposed algorithm or existing traffic control methods. The results show that the traffic condition can be significantly improved by our algorithm.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 1; 183-200
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm based optimized convolutional neural network for face recognition
Autorzy:
Karlupia, Namrata
Mahajan, Palak
Abrol, Pawanesh
Lehana, Parveen K.
Powiązania:
https://bibliotekanauki.pl/articles/2201023.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
convolutional neural network
genetic algorithm
deep learning
evolutionary technique
sieć neuronowa konwolucyjna
algorytm genetyczny
uczenie głębokie
technika ewolucyjna
Opis:
Face recognition (FR) is one of the most active research areas in the field of computer vision. Convolutional neural networks (CNNs) have been extensively used in this field due to their good efficiency. Thus, it is important to find the best CNN parameters for its best performance. Hyperparameter optimization is one of the various techniques for increasing the performance of CNN models. Since manual tuning of hyperparameters is a tedious and time-consuming task, population based metaheuristic techniques can be used for the automatic hyperparameter optimization of CNNs. Automatic tuning of parameters reduces manual efforts and improves the efficiency of the CNN model. In the proposed work, genetic algorithm (GA) based hyperparameter optimization of CNNs is applied for face recognition. GAs are used for the optimization of various hyperparameters like filter size as well as the number of filters and of hidden layers. For analysis, a benchmark dataset for FR with ninety subjects is used. The experimental results indicate that the proposed GA-CNN model generates an improved model accuracy in comparison with existing CNN models. In each iteration, the GA minimizes the objective function by selecting the best combination set of CNN hyperparameters. An improved accuracy of 94.5% is obtained for FR.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 21--31
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A learning algorithm combining functional discriminant coordinates and functional principal components
Autorzy:
Górecki, Tomasz
Krzyśko, Mirosław
Powiązania:
https://bibliotekanauki.pl/articles/729818.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
functional principal components
functional discriminant coordinates
Opis:
A new type of discriminant space for functional data is presented, combining the advantages of a functional discriminant coordinate space and a functional principal component space. In order to provide a comprehensive comparison, we conducted a set of experiments, testing effectiveness on 35 functional data sets (time series). Experiments show that constructed combined space provides a higher quality of classification of LDA method compared with component spaces.
Źródło:
Discussiones Mathematicae Probability and Statistics; 2014, 34, 1-2; 127-141
1509-9423
Pojawia się w:
Discussiones Mathematicae Probability and Statistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A distributed algorithm for protein identification from tandem mass spectrometry data
Autorzy:
Orzechowska, Katarzyna
Rubel, Tymon
Kurjata, Robert
Zaremba, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/2097435.pdf
Data publikacji:
2022
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
proteomics
mass spectrometry
distributed computing
Apache Spark
Opis:
Tandem mass spectrometry is an analytical technique widely used in proteomics for the high-throughput characterization of proteins in biological samples. Modern in-depth proteomic studies require the collection of even millions of mass spectra representing short protein fragments (peptides). In order to identify the peptides, the measured spectra are most often scored against a database of amino acid sequences of known proteins. Due to the volume of input data and the sizes of proteomic databases, this is a resource-intensive task, which requires an efficient and scalable computational strategy. Here, we present SparkMS, an algorithm for peptide and protein identification from mass spectrometry data explicitly designed to work in a distributed computational environment. To achieve the required performance and scalability, we use Apache Spark, a modern framework that is becoming increasingly popular not only in the field of “big data” analysis but also in bioinformatics. This paper describes the algorithm in detail and demonstrates its performance on a large proteomic dataset. Experimental results indicate that SparkMS scales with the number of worker nodes and the increas-ing complexity of the search task. Furthermore, it exhibits a protein identification efficiency comparable to X!Tandem, a widely-used proteomic search engine.
Źródło:
Applied Computer Science; 2022, 18, 2; 16--27
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic Key Generation During a Communication Instance Over GSM
Autorzy:
Zalaket, J.
Challita, K.
Powiązania:
https://bibliotekanauki.pl/articles/108666.pdf
Data publikacji:
2013
Wydawca:
Społeczna Akademia Nauk w Łodzi
Tematy:
mobile communication
encryption
GSM
A5 algorithm
Opis:
Mobile phone may become the protagonist of the new electronic technology. If we compare it with that of other technologies, the infiltration rate of mobile phones in the world is extremely high, both in cities than rural communities of the most of the countries. According to estimates made by the International Telecommunication Union the access to mobile networks is growing much faster than the access to Internet. This emergence has led many companies to allow new activities which were previously running strictly over the Internet to run over the mobile network such as the electronic payment. These circumstances make the security of mobile communication a priority to preserve the authentication, confidentiality and integrity of data sent between subscribers and mobile network. In this paper, we propose a dynamic key generation for the A5 GSM encryption algorithm to enforce the security and protect the transferred data. Our algorithm can be implemented over any GSM generation GSM/3G/4G.
Źródło:
Journal of Applied Computer Science Methods; 2013, 5 No. 1; 47-57
1689-9636
Pojawia się w:
Journal of Applied Computer Science Methods
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sensor Network Deployment Optimization for Improved Area Coverage Using a Genetic Algorithm
Autorzy:
Szklarski, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/1861643.pdf
Data publikacji:
2016
Wydawca:
Wyższa Szkoła Bezpieczeństwa Publicznego i Indywidualnego Apeiron w Krakowie
Tematy:
network of sensors
genetic algorithm
sensors deployment
area coverage
Opis:
Ensuring optimal coverage is a central objective of every sensor deployment plan. Effective monitoring of the environment helps to minimize manpower and time, while enhancing surveillance capability. In this paper, a solution for improved area coverage was presented. A lattice of a pre-defined parameter has been used as an input for the algorithm. For the purpose of the research the blanket deployment strategy has been adopted. Then, a genetic algorithm has been proposed and implemented to find an optimal solution. The proposed approach has been tested and the conclusions have been drawn. The results proved that the proposed genetic algorithm could already provide satisfactory results, usually finding only suboptimal solutions.
Źródło:
Security Dimensions; 2016, 19(19); 150-181
2353-7000
Pojawia się w:
Security Dimensions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of fractal compression of 3d images using a genetic algorithm
Autorzy:
Khanmirza, Z
Ramezani, F
Motameni, H
Powiązania:
https://bibliotekanauki.pl/articles/102068.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
stereo system
fractal compression
genetic algorithm
Opis:
3D image technologies are widely recognized as the next generation of visual presentation considering the achievement of more natural experiences. To produce such images, two cameras are placed in a bit different position. When we seek to compress such images, we need a procedure to compress two images synchronously. In this paper, a procedure is presented for a suitable compression based on fractal compression which shows that we obtain high compression rate with an appropriate image quality; however, since the proposed procedure has a low search speed, we used genetic algorithm to remove the case.
Źródło:
Advances in Science and Technology. Research Journal; 2015, 9, 26; 124-128
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A static calibration of mems 3-axis accelerometer using a genetic algorithm
Autorzy:
Marinov, Marin
Petrov, Zhivo
Powiązania:
https://bibliotekanauki.pl/articles/198726.pdf
Data publikacji:
2019
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
MEMS accelerometers
calibration
bias
genetic algorithm
akcelerometr MEMS
kalibracja
obciążenie
algorytm genetyczny
Opis:
In this paper, a procedure for MEMS accelerometer static calibration using a genetic algorithm, considering non-orthogonality was presented. The results of simulations and real accelerometer calibration are obtained showing high accuracy of parameters estimation.
Źródło:
Zeszyty Naukowe. Transport / Politechnika Śląska; 2019, 105; 157-168
0209-3324
2450-1549
Pojawia się w:
Zeszyty Naukowe. Transport / Politechnika Śląska
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ł:
Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems
Autorzy:
Mahmood, A.
Powiązania:
https://bibliotekanauki.pl/articles/205582.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
heurystyka
niezawodność
obliczenie zdecentralizowane
przetwarzanie rozproszone
A* algorithm
branch-and-bound
distributed computing
heuristics
reliability
task allocation
Opis:
The rapid progress of microprocessor and communication technologies has made the distributed computing system economically attractive for many computer applications. One of the first problems encountered in the operation of a distributed system is the problem of allocating the tasks among the processing nodes. The task allocation problem is known to be computationally intractable for large task sets. In this paper, we consider the task allocation problem with the goal of maximizing reliability of heterogeneous distributed systems. After presenting a quantitative task allocation model, we present a least-cost branch-and-bound algorithm to find optimal task allocations. We also present two heuristic algorithms to obtain suboptimal allocations for realistic size large problems in a reasonable amount of computational time. Simulation was used to study the performance of the proposed algorithms for a large number of problems. Also, performance of the proposed algorithms has been compared with a well-known heuristics available in the literature.
Źródło:
Control and Cybernetics; 2001, 30, 1; 115-130
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A fast algorithm for the construction of recurrence relations for modified moments
Autorzy:
Lewanowicz, Stanisław
Powiązania:
https://bibliotekanauki.pl/articles/1340584.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Gegenbauer polynomials
recurrence relations
modified moments
Opis:
A new approach is presented for constructing recurrence relations for the modified moments of a function with respect to the Gegenbauer polynomials.
Źródło:
Applicationes Mathematicae; 1993-1995, 22, 3; 359-372
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A computation algorithm for Strassens matrix multiplication
Algorytm obliczania iloczynu macierzowego Strassena
Autorzy:
Tariov, A.
Gliszczyński, M.
Powiązania:
https://bibliotekanauki.pl/articles/154595.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
iloczyn macierzowy Strassena
szybkie algorytmy
Strassen's matrix multiplication
fast algorithms
Opis:
In the work the vectorized algorithm for Strassen's matrix product calculating is presented. Unlike the proposed in other works "some recommendations" relating to the Strassen's matrix multiplication implementation, we offer specific computational procedures that allow correctly describe the entire sequence of transformations needed to obtain the final result. The proposed algorithm can be successfully applied to accelerate calculations in the FPGA-based platforms.
W pracy został przedstawiony wektoryzowany algorytm wyznaczenia iloczynu macierzowego Strassena. W odróżnieniu od poruszanych w innych publikacjach wybranych uwag dotyczących realizacji metody Strassena w niniejszej pracy zaproponowane są konkretne procedury, opisujące cały proces obliczeniowy i pozwalające na podstawie wykonania skończonej liczby etapów przetwarzania danych wejściowych otrzymać wynik końcowy. Została roztrząśnięta synteza proponowanego algorytmu oraz pokazana postać stosownego grafu przepływowego dla przykładu mnożenia macierzy drugiego rzędu. Zaproponowany algorytm może być sukcesywnie zastosowany do przyspieszonej realizacji obliczeń w platformach FPGA oraz zaimplementowany w wybranym środowisku sprzętowym. Niewątpliwym atutem odróżniającym przedstawione rozwiązanie od tradycyjnego algorytmu jest również brak rekurencji obliczeń, co daje dodatkowy zysk przy zrównolegleniu procesu wyznaczenia iloczynu.
Źródło:
Pomiary Automatyka Kontrola; 2010, R. 56, nr 7, 7; 691-693
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A numerical algorithm for computing the inverse of a Toeplitz pentadiagonal matrix
Autorzy:
Talibi, B.
Hadj, D. A.
Sarsri, D.
Powiązania:
https://bibliotekanauki.pl/articles/122953.pdf
Data publikacji:
2018
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
pentadiagonal matrix
Toeplitz matrix
K-Hessenberg matrix
inverse
system algebry komputerowej
macierz K-Hessenberga
odwrotność
inwersja
algorytm numeryczny
macierz Toeplitza
Opis:
In the current paper, we present a computationally efficient algorithm for obtaining the inverse of a pentadiogonal toeplitz matrix. Few conditions are required, and the algorithm is suited for implementation using computer algebra systems.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 3; 83-95
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new heuristic algorithm of fuzzy clustering
Autorzy:
Viattchenin, D. A.
Powiązania:
https://bibliotekanauki.pl/articles/970349.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
grupowanie rozmyte
przydział
punkt typowy
fuzzy clustering
fuzzy tolerance
fuzzy cluster
membership degree
allotment
typical point
Opis:
This paper deals with a new method of fuzzy clustering. The basic concepts of the method are introduced as resulting from the consideration of the fundamental fuzzy clustering problem. The paper provides the description of the general plan of the algorithm and an illustrative example. An analysis of the experimental results of the method's application to the Anderson's Iris data is carried out. Some preliminary conclusions and the ways of prospective investigations are given.
Źródło:
Control and Cybernetics; 2004, 33, 2; 323-340
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/375952.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
resource-constrained project scheduling
discounted cash flows
milestones
heuristics
Opis:
This paper presents a Resource-Constrained Project Scheduling Problem (RCPSP) settled by contractual milestones. The criterion analysed here is the maximisation of aggregate discounted cash flows from the contractor´s perspective, known as an RCPSP problem with Discounted Cash Flows (RCPSPDCF). The cash flows analysed here cover the contractor´s cash outflows (negative cash flows), related to the commencement of individual activities, and cash inflows (positive cash flows) after the fulfilment of individual milestones. The authors propose a two-phase algorithm for solving the problem defined. In the first phase, the simulated annealing metaheuristics is used, designed to identify a forward schedule with as high total DCF as possible. In the second phase, the best first-phase schedule is improved by right shifts of activities. To this end, the procedure which iteratively shifts tasks by one unit is applied, with a view to maximising the objective function. Activity shifts take into consideration precedence and resource constraints, and they are performed for a specified resource allocation to activities. This paper also includes an analysis of the problem for a sample project. The results of computational experiments are then analysed. The experiments were run with the use of standard test problems from the Project Scheduling Problem LIBrary (PSPLIB), with additionally defined cash flows and contractual milestones.
Źródło:
Decision Making in Manufacturing and Services; 2013, 7, 1-2; 51-68
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of a genetic algorithm for design optimisation of a passive magnetic gear
Autorzy:
Kowol, M.
Kołodziej, J.
Łukaniszyn, M.
Powiązania:
https://bibliotekanauki.pl/articles/97369.pdf
Data publikacji:
2016
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
magnetic gear
finite element method
evolutionary algorithm
Opis:
This paper analyzes an influence of selected design parameters of a passive magnetic gear on the transmitted torque density. This constitutes the basis for determination of a number of design parameters and their ranges in the optimisation process. Calculations are carried out using the two–dimensional finite element method implemented in the Matlab environment. As a result of the optimisation process, the design parameters of the magnetic gear with a much higher value of the transmitted torque are obtained.
Źródło:
Computer Applications in Electrical Engineering; 2016, 14; 220-230
1508-4248
Pojawia się w:
Computer Applications in Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Acoustical Assessment of Automotive Mufflers Using FEM, Neural Networks, and a Genetic Algorithm
Autorzy:
Chang, Y.-C.
Chiu, M.-C.
Wu, M.-R.
Powiązania:
https://bibliotekanauki.pl/articles/177901.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
acoustics
finite element method
genetic algorithm
muffler optimization
polynomial neural network model
Opis:
In order to enhance the acoustical performance of a traditional straight-path automobile muffler, a multi-chamber muffler having reverse paths is presented. Here, the muffler is composed of two internally parallel/extended tubes and one internally extended outlet. In addition, to prevent noise transmission from the muffler’s casing, the muffler’s shell is also lined with sound absorbing material. Because the geometry of an automotive muffler is complicated, using an analytic method to predict a muffler’s acoustical performance is difficult; therefore, COMSOL, a finite element analysis software, is adopted to estimate the automotive muffler’s sound transmission loss. However, optimizing the shape of a complicated muffler using an optimizer linked to the Finite Element Method (FEM) is time-consuming. Therefore, in order to facilitate the muffler’s optimization, a simplified mathematical model used as an objective function (or fitness function) during the optimization process is presented. Here, the objective function can be established by using Artificial Neural Networks (ANNs) in conjunction with the muffler’s design parameters and related TLs (simulated by FEM). With this, the muffler’s optimization can proceed by linking the objective function to an optimizer, a Genetic Algorithm (GA). Consequently, the discharged muffler which is optimally shaped will improve the automotive exhaust noise.
Źródło:
Archives of Acoustics; 2018, 43, 3; 517-529
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Bayes algorithm for model compatibility and comparison of ARMA( p; q) models
Autorzy:
Tripathi, Praveen Kumar
Sen, Rijji
Upadhyay, S. K.
Powiązania:
https://bibliotekanauki.pl/articles/1054568.pdf
Data publikacji:
2021-06-04
Wydawca:
Główny Urząd Statystyczny
Tematy:
ARMA model
exact likelihood
Gibbs sampler
Metropolis algorithm
posterior predictive loss
model compatibility
Ljung-Box-Pierce statistic
GDP growth rate
Opis:
The paper presents a Bayes analysis of an autoregressive-moving average model and its components based on exact likelihood and weak priors for the parameters where the priors are defined so that they incorporate stationarity and invertibility restrictions naturally. A Gibbs- Metropolis hybrid scheme is used to draw posterior-based inferences for the models under consideration. The compatibility of the models with the data is examined using the Ljung- Box-Pierce chi-square-based statistic. The paper also compares different compatible models through the posterior predictive loss criterion in order to recommend the most appropriate one. For a numerical illustration of the above, data on the Indian gross domestic product growth rate at constant prices are considered. Differencing the data once prior to conducting the analysis ensured their stationarity. Retrospective short-term predictions of the data are provided based on the final recommended model. The considered methodology is expected to offer an easy and precise method for economic data analysis.
Źródło:
Statistics in Transition new series; 2021, 22, 2; 95-123
1234-7655
Pojawia się w:
Statistics in Transition new series
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-50 z 2863

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