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ę "Search Algorithm" wg kryterium: Wszystkie pola

  Lista filtrów

Dostawca treści

Wyrównaj
    Wyświetlanie 1-88 z 88
    Tytuł:
    Context search algorithm for lexical knowledge acquisition
    Autorzy:
    Szymański, J.
    Duch, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/206264.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    semantic memory
    knowledge representation
    international retrieval
    knowledge acquisition
    Opis:
    A Context Search algorithm used for lexical knowledge acquisition is presented. Knowledge representation based on psycholinguistic theories of cognitive processes allows for implementation of a computational model of semantic memory in the form of semantic network. Knowledge acquisition using supervised dialog templates have been performed in a word game designed to guess the concept a human user is thinking about. The game that has been implemented on a web server, demonstrates elementary linguistic competencies based on lexical knowledge stored in semantic memory, enabling at the same time acquisition and validation of knowledge. Possible applications of the algorithm in domains of medical diagnosis and information retrieval are sketched.
    Źródło:
    Control and Cybernetics; 2012, 41, 1; 81-96
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Scheduling of multiunit projects using tabu search algorithm
    Autorzy:
    Podolski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/347178.pdf
    Data publikacji:
    2015
    Wydawca:
    Akademia Wojsk Lądowych imienia generała Tadeusza Kościuszki
    Tematy:
    construction works scheduling
    optimization
    job scheduling
    tabu search algorithm
    Opis:
    The paper describes problems of discrete optimization in scheduling of multiunit projects. A model of this kind of project with possibility of using many workgroups by the contractor has been presented. It leads to reduction of project duration. For solving NP-hard optimization problem, a tabu search algorithm has been applied in the model. The example of mod-el and application of the algorithm are also included in the paper.
    Źródło:
    Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki; 2015, 1; 110-122
    1731-8157
    Pojawia się w:
    Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of Circular Antenna Arrays Using a Differential Search Algorithm
    Autorzy:
    Recioui, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/1402537.pdf
    Data publikacji:
    2015-08
    Wydawca:
    Polska Akademia Nauk. Instytut Fizyki PAN
    Tematy:
    84.40.Ba
    52.40.Fd
    Opis:
    Circular and concentric circular antenna array patterns are synthesized to generate array factors with minimum side-lobe level and high directivity. The comprehensive learning differential search algorithm is used for synthesizing a one-and a three-ring circular and concentric circular antenna array with thirty elements. This synthesis is done by finding the optimum inter-element spacing of rings, phases and/or positions that give optimum side lobe level. The computational results show that side lobe level is reduced significantly in non-uniform case for concentric in comparison with a single ring.
    Źródło:
    Acta Physica Polonica A; 2015, 128, 2B; B-7-B-8
    0587-4246
    1898-794X
    Pojawia się w:
    Acta Physica Polonica A
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of convolutional neural networks using the fuzzy gravitational search algorithm
    Autorzy:
    Poma, Yutzil
    Melin, Patricia
    González, Claudia I.
    Martínez, Gabriela E.
    Powiązania:
    https://bibliotekanauki.pl/articles/384794.pdf
    Data publikacji:
    2020
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    neural networks
    convolutional neural network
    fuzzy gravitational search algorithm
    deep learning
    Opis:
    This paper presents an approach to optimize a Convolutional Neural Network using the Fuzzy Gravitational Search Algorithm. The optimized parameters are the number of images per block that are used in the training phase, the number of filters and the filter size of the convolutional layer. The reason for optimizing these parameters is because they have a great impact on performance of the Convolutional Neural Networks. The neural network model presented in this work can be applied for any image recognition or classification applications; nevertheless, in this paper, the experiments are performed in the ORL and Cropped Yale databases. The results are compared with other neural networks, such as modular and monolithic neural networks. In addition, the experiments were performed manually, and the results were obtained (when the neural network is not optimized), and comparison was made with the optimized results to validate the advantage of using the Fuzzy Gravitational Search Algorithm.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2020, 14, 1; 109-120
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
    Autorzy:
    Bereta, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/308683.pdf
    Data publikacji:
    2017
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    Euclidean Steiner tree problem
    MCTS
    Monte Carlo Tree Search
    UCT algorithm
    Opis:
    This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points (terminals) on a plane, the goal is to find a connection between all the points, so that the total sum of the lengths of edges is as low as possible, while an addition of extra points (Steiner points) is allowed. Finding the minimum Steiner tree is known to be np-hard. While exact algorithms exist for this problem in 2D, their efficiency decreases when the number of terminals grows. A novel algorithm based on Upper Confidence Bound for Trees is proposed. It is adapted to the specific characteristics of Steiner trees. A simple heuristic for fast generation of feasible solutions based on Fermat points is proposed together with a correction procedure. By combing Monte Carlo Tree Search and the proposed heuristics, the proposed algorithm is shown to work better than both the greedy heuristic and pure Monte Carlo simulations. Results of numerical experiments for randomly generated and benchmark library problems (from OR-Lib) are presented and discussed.
    Źródło:
    Journal of Telecommunications and Information Technology; 2017, 4; 71-81
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Flexible job shop problem - parallel tabu search algorithm for multi-GPU
    Autorzy:
    Bożejko, W.
    Uchroński, M.
    Wodecki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/229502.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    jobs scheduling
    flexible manufacturing
    parallel algorithm
    discrete optimization
    Opis:
    In the paper we propose a new framework for the distributed tabu search algorithm designed to be executed with the use of a multi-GPU cluster, in which cluster of nodes are equipped with multicore GPU computing units. The proposed methodology is designed specially to solve difficult discrete optimization problems, such as a flexible job shop scheduling problem, which we introduce as a case study used to analyze the efficiency of the designed synchronous algorithm.
    Źródło:
    Archives of Control Sciences; 2012, 22, 4; 389-397
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Real-Time Cloud-based Game Management System via Cuckoo Search Algorithm
    Autorzy:
    Połap, D.
    Woźniak, M.
    Napoli, C.
    Tramontana, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/226816.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    computational intelligence
    heuristic algorithm
    Opis:
    This paper analyses the idea of applying Swarm Intelligence in the process of managing the entire 2D board game in a real-time environment. For the proposed solution Game Management System is used as a cloud resource with a dedicated intelligent control agent. The described approach has been analysed on the basis of board games like mazes. The model and the control algorithm of the system is described and examined. The results of the experiments are presented and discussed to show possible advantages and isadvantages of the proposed method.
    Źródło:
    International Journal of Electronics and Telecommunications; 2015, 61, 4; 333-338
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Real time search algorithm for observation outliers during monitoring engineering constructions
    Autorzy:
    Latos, D.
    Kolanowski, B.
    Pachelski, W.
    Sołoducha, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/106801.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Warszawska. Wydział Geodezji i Kartografii
    Tematy:
    time series analysis
    construction monitoring
    automation of data analysis
    analiza szeregów czasowych
    monitorowanie budowy
    automatyzacja analizy danych
    Opis:
    Real time monitoring of engineering structures in case of an emergency of disaster requires collection of a large amount of data to be processed by specific analytical techniques. A quick and accurate assessment of the state of the object is crucial for a probable rescue action. One of the more significant evaluation methods of large sets of data, either collected during a specified interval of time or permanently, is the time series analysis. In this paper presented is a search algorithm for those time series elements which deviate from their values expected during monitoring. Quick and proper detection of observations indicating anomalous behavior of the structure allows to take a variety of preventive actions. In the algorithm, the mathematical formulae used provide maximal sensitivity to detect even minimal changes in the object’s behavior. The sensitivity analyses were conducted for the algorithm of moving average as well as for the Douglas-Peucker algorithm used in generalization of linear objects in GIS. In addition to determining the size of deviations from the average it was used the so-called Hausdorff distance. The carried out simulation and verification of laboratory survey data showed that the approach provides sufficient sensitivity for automatic real time analysis of large amount of data obtained from different and various sensors (total stations, leveling, camera, radar).
    Źródło:
    Reports on Geodesy and Geoinformatics; 2017, 104; 103-114
    2391-8365
    2391-8152
    Pojawia się w:
    Reports on Geodesy and Geoinformatics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Minimized Group Delay FIR Low Pass Filter Design Using Modified Differential Search Algorithm
    Autorzy:
    Prajapati, Sonelal
    Rai, Sanjeev
    Tiwari, Manish
    Dwivedi, Atul Kumar
    Powiązania:
    https://bibliotekanauki.pl/articles/24200750.pdf
    Data publikacji:
    2023
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    differential search optimization algorithm
    FIR filter
    optimization
    small group delay
    Opis:
    Designing a finite impulse response (FIR) filter with minimal group delay has proven to be a difficult task. Many research studies have focused on reducing pass band and stop band ripples in FIR filter design, often overlooking the optimization of group delay. While some works have considered group delay reduction, their approaches were not optimal. Consequently, the achievement of an optimal design for a filter with a low group delay value still remains a challenge. In this work, a modified differential search optimization algorithm has been used for the purpose of designing a minimal group delay FIR filter. The results obtained have been compared with the classical techniques and they turned out to be promising.
    Źródło:
    Journal of Telecommunications and Information Technology; 2023, 3; 78--84
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A support vector machine with the tabu search algorithm for freeway incident detection
    Autorzy:
    Yao, B.
    Hu, P.
    Zhang, M.
    Jin, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/329943.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    automated incident detection
    support vector machine (SVM)
    tabu search
    freeway
    maszyna wektorów wspierających
    odcinek swobodny trasy
    algorytm tabu search
    Opis:
    Automated Incident Detection (AID) is an important part of Advanced Traffic Management and Information Systems (ATMISs). An automated incident detection system can effectively provide information on an incident, which can help initiate the required measure to reduce the influence of the incident. To accurately detect incidents in expressways, a Support Vector Machine (SVM) is used in this paper. Since the selection of optimal parameters for the SVM can improve prediction accuracy, the tabu search algorithm is employed to optimize the SVM parameters. The proposed model is evaluated with data for two freeways in China. The results show that the tabu search algorithm can effectively provide better parameter values for the SVM, and SVM models outperform Artificial Neural Networks (ANNs) in freeway incident detection.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 2; 397-404
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Noise effects in the quantum search algorithm from the viewpoint of computational complexity
    Autorzy:
    Gawron, P.
    Klamka, J.
    Winiarczyk, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/331292.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    algorytm kwantowy
    szum kwantowy
    złożoność algorytmu
    quantum algorithms
    quantum noise
    algorithm complexity
    Opis:
    We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on the computational complexity of the quantum search algorithm. We show that it is only for small amounts of noise that the quantum search algorithm is still more efficient than any classical algorithm.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2012, 22, 2; 493-499
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Single-objective optimal power flow for electric power systems based on crow search algorithm
    Autorzy:
    Fathy, A.
    Abdelaziz, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/140618.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    crow search algorithm
    distribution network
    optimal power flow
    Opis:
    This paper presents the application of a recent meta-heuristic optimization technique named a crow search algorithm (CSA) in solving the problem of an optimal power flow (OPF) for electric power systems. Various constrained objective functions, total fuel cost, active power loss and pollutant emission are proposed. The generators’ output powers, generators’ terminal voltages, transmission lines’ taps and the shunt capacitors’ reactive powers are considered as variables to be designed. The proposed methodology based on the CSA is applied on an IEEE 30-bus system and IEEE 118-bus system. The obtained results via the CSA are compared to others and they ensure the superiority of the CSA in solving the OPF problem in electric power systems.
    Źródło:
    Archives of Electrical Engineering; 2018, 67, 1; 123-138
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows
    Autorzy:
    Gładysz, J.
    Walkowiak, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/226174.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    anycast
    network design
    tabu search
    survivability
    Opis:
    In this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.
    Źródło:
    International Journal of Electronics and Telecommunications; 2010, 56, 1; 41-47
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Ship Collision Avoidance by Distributed Tabu Search
    Autorzy:
    Kim, D.
    Hirayama, K.
    Okimoto, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/116919.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Safety of Navigation
    Collision Avoidance
    Distributed Tabu Search Algorithm (DTSA)
    Distributed Local Search Algorithm (DLSA)
    Quasi-Local Minimum (QLM)
    Tabu Search Algorithm
    Local Search Algorithm
    Distributed Tabu Search
    Opis:
    More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical. It is very difficult for officers to ascertain routes that will avoid collisions, especially when multiple ships travel the same waters. There are several ways to prevent ship collisions, such as lookouts, radar, and VHF radio. More advanced methodologies, such as ship domain, fuzzy theory, and genetic algorithm, have been proposed. These methods work well in one-on-one situations, but are more difficult to apply in multiple-ship situations. Therefore, we proposed the Distributed Local Search Algorithm (DLSA) to avoid ship collisions as a precedent study. DLSA is a distributed algorithm in which multiple ships communicate with each other within a certain area. DLSA computes collision risk based on the information received from neighboring ships. However, DLSA suffers from Quasi-Local Minimum (QLM), which prevents a ship from changing course even when a collision risk arises. In our study, we developed the Distributed Tabu Search Algorithm (DTSA). DTSA uses a tabu list to escape from QLM that also exploits a modified cost function and enlarged domain of next-intended courses to increase its efficiency. We conducted experiments to compare the performance of DLSA and DTSA. The results showed that DTSA outperformed DLSA.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 1; 23-29
    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ł:
    Loadability maximisation in bilateral network for real-time forecasting system using cuckoo search algorithm
    Autorzy:
    Venkatasivanagaraju, S.
    Rao, M. Venkateswara
    Powiązania:
    https://bibliotekanauki.pl/articles/38699704.pdf
    Data publikacji:
    2023
    Wydawca:
    Instytut Podstawowych Problemów Techniki PAN
    Tematy:
    optimal power flow
    NR method
    short-term load forecasting
    long-term load forecasting
    cuckoo search algorithm
    optimisation
    loss minimisation
    optymalny przepływ mocy
    metoda NR
    krótkoterminowe prognozowanie obciążeń
    długoterminowe prognozowanie obciążeń
    algorytm kukułki
    optymalizacja
    minimalizacja strat
    Opis:
    This manuscript proposes an optimal power flow (OPF) solution in a coordinated bilateralpower network. The primary goal of this project is to maximise the benefits of the powermarket using Newton–Raphson (NR) and cuckoo search algorithm CSA methodologies.The global solution is found using a CSA-based optimisation approach. The study isconducted on real-time bus system. To avoid this, creative techniques have lately beenused to handle the OPF problem, such as loadability maximisation for real-time predictionsystems employing the CSA. In this work, cuckoo search (CS) is used to optimise theobtained parameters that help to minimise parameters in the predecessor and consequentunits of each sub-model. The proposed approach is used to estimate the power load in thelocal area. The constructed models show excellent predicting performance based on derivedperformance. The results confirm the method’s validity. The outcomes are compared withthose obtained by using the NR method. CSA outperformed the other methods in thisinvestigation and gave more accurate predictions. The OPF problem is solved via CSAin this study. Implementing a real-time data case bus system is recommended to test theperformance of the established method in the MATLAB programme.
    Źródło:
    Computer Assisted Methods in Engineering and Science; 2023, 30, 1; 73-88
    2299-3649
    Pojawia się w:
    Computer Assisted Methods in Engineering and Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A novel hybrid cuckoo search algorithm for optimization of a line-start PM synchronous motor
    Autorzy:
    Knypiński, Łukasz
    Powiązania:
    https://bibliotekanauki.pl/articles/2204509.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    hybrid cuckoo search algorithm
    heuristic algorithms
    multi-objective optimization
    permanent magnet synchronous motor
    PMSM
    algorytm kukułki hybrydowy
    algorytm Cuckoo
    algorytm heurystyczny
    optymalizacja wielocelowa
    silnik synchroniczny z magnesem trwałym
    Opis:
    The paper presents a novel hybrid cuckoo search (CS) algorithm for the optimization of the line-start permanent magnet synchronous motor (LSPMSM). The hybrid optimization algorithm developed is a merger of the heuristic algorithm with the deterministic Hooke–Jeeves method. The hybrid optimization procedure developed was tested on analytical benchmark functions and the results were compared with the classical cuckoo search algorithm, genetic algorithm, particle swarm algorithm and bat algorithm. The optimization script containing a hybrid algorithm was developed in Delphi Tiburón. The results presented show that the modified method is characterized by better accuracy. The optimization procedure developed is related to a mathematical model of the LSPMSM. The multi-objective compromise function was applied as an optimality criterion. Selected results were presented and discussed.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 1; art. no. e144586
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimizing the harmony search algorithm for combined heat and power economic dispatch in american english
    Autorzy:
    Benayed, F.Z.
    Abdelhakem-Koridak, L.
    Bouadi, A.
    Rahli, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/41184379.pdf
    Data publikacji:
    2023
    Wydawca:
    Politechnika Warszawska, Instytut Techniki Cieplnej
    Tematy:
    combined heat and power system
    harmony search algorithm
    optimization of power systems
    połączony system ciepłowniczy i elektroenergetyczny
    algorytm poszukiwania harmonii
    optymalizacja systemów energetycznych
    Opis:
    Achieving optimal utilization of multiple combined heat and power (CHP) systems is a complex problem that requires powerful methods for resolution. This paper presents a harmony search (HS) algorithm to address the economic dispatch issue in CHP (CHPED ). The recently developed metaheuristic HS algorithm has been successfully employed in a wide range of optimization problems. The method is demonstrated through a test case from existing literature and a new one proposed by the authors. Numerical results indicate that the proposed algorithm can identify superior solutions compared to traditional methods, and that the Harmony Search algorithm can be effectively applied to CHPED-related problems.
    Źródło:
    Journal of Power Technologies; 2023, 103, 1; 14-20
    1425-1353
    Pojawia się w:
    Journal of Power Technologies
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Fault Current Limiter optimal sizing considering different Microgrid operational modes using Bat and Cuckoo Search Algorithm
    Autorzy:
    Arani, A. A. K.
    Bayati, N.
    Mohammadi, R.
    Gharehpetian, G. B.
    Sadeghi, S. H.
    Powiązania:
    https://bibliotekanauki.pl/articles/140644.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    fault current limiter (FCL)
    Bat Algorithm (BA)
    Cuckoo Search Algorithm (CSA)
    microgrid (MG)
    Opis:
    Nowadays, the development of smart grids has been the focus of attention due to its advantages for power systems. One of the aspects of smart grids defined by using distributed generation (DG) in a low voltage network is a microgrid (MG). Based on its operational states, MG can operate in different configurations such as grid-connected mode or off-grid mode. The switching between these states is one of the challenging issues in this technical area. The fault currents in different buses have higher value compared to islanded mode of MG when the MG is connected to the main grid, which influences the protection equipment. In this situation, some electrical devices may be damaged due to the fault currents. Application of a fault current limiter (FCL) is considered as an effective way to overcome this challenge. The optimal size of these FCLs can optimize the performance of an MG. In this paper, an index for FCL size optimization has been used. In addition, two optimization algorithms (Bat Algorithm and Cuckoo Search Algorithm) have been applied to the problem. The application of an FCL has been studied in grid-connected and islanded-mode. In addition, the application of the capacitor bank in both modes has been investigated. The results of simulations carried out by MATLAB have been presented and compared.
    Źródło:
    Archives of Electrical Engineering; 2018, 67, 2; 321--332
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi-Layer Perceptron Neural Network Utilizing Adaptive Best-Mass Gravitational Search Algorithm to Classify Sonar Dataset
    Autorzy:
    Mosavi, Mohammad Reza
    Khishe, Mohammad
    Naseri, Mohammad Jafar
    Parvizi, Gholam Reza
    Ayat, Mehdi
    Powiązania:
    https://bibliotekanauki.pl/articles/176971.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    MLP NN
    Multi-Layer Perceptron Neural Network
    ABGSA
    Adaptive Best Mass Gravitational Search Algorithm
    sonar
    classification
    Opis:
    In this paper, a new Multi-Layer Perceptron Neural Network (MLP NN) classifier is proposed for classifying sonar targets and non-targets from the acoustic backscattered signals. Besides the capabilities of MLP NNs, it uses Back Propagation (BP) and Gradient Descent (GD) for training; therefore, MLP NNs face with not only impertinent classification accuracy but also getting stuck in local minima as well as lowconvergence speed. To lift defections, this study uses Adaptive Best Mass Gravitational Search Algorithm (ABGSA) to train MLP NN. This algorithm develops marginal disadvantage of the GSA using the bestcollected masses within iterations and expediting exploitation phase. To test the proposed classifier, this algorithm along with the GSA, GD, GA, PSO and compound method (PSOGSA) via three datasets in various dimensions will be assessed. Assessed metrics include convergence speed, fail probability in local minimum and classification accuracy. Finally, as a practical application assumed network classifies sonar dataset. This dataset consists of the backscattered echoes from six different objects: four targets and two non-targets. Results indicate that the new classifier proposes better output in terms of aforementioned criteria than whole proposed benchmarks.
    Źródło:
    Archives of Acoustics; 2019, 44, 1; 137-151
    0137-5075
    Pojawia się w:
    Archives of Acoustics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Efektywna implementacja algorytmu wyszukiwania wzorców genetycznych
    On efficient implementation of the search algorithm for genome patterns
    Autorzy:
    Milik, A.
    Pułka, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/156619.pdf
    Data publikacji:
    2011
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    programowanie dynamiczne
    identyfikacja wzorców
    rozpoznawanie wzorców
    przetwarzanie równoległe
    przetwarzanie potokowe
    dynamic programming
    computational methods
    pattern identification
    pattern recognition
    parallel processing
    pipeline processing
    Opis:
    W artykule zaprezentowano implementację algorytmu obliczającego stopień podobieństwa sekwencji znaków (genów) do zadanego wzorca. Algorytm wywodzi się z biologii obliczeniowej. Rozwiązania programowe wymagają znacznych zasobów sprzętowych oraz czasu. W badaniach nad algorytmem główny nacisk położono na poznanie jego własności i ich wykorzystanie przy implementacji. Pozwoliło to stworzyć bardzo oryginalna implementację zapewniającą niezwykle oszczędne gospodarowanie zasobami w układzie programowalnym jak i uzyskanie bardzo wysokich częstotliwości pracy.
    The paper describes implementation of the computation algorithm in modern, complex programmable hardware devices. The presented algorithm originates from computation biology and works on very long chains of symbols which come from reference patterns of the genome. The software solutions in this field are very limited and need large time and space resources. The main research efforts were aimed at investigating the properties of the searching algorithm. Especially, the influence of the penalty values assigned to the mismatch, insertion and deletion on the algorithm was analysed. This allowed obtaining a completely new algorithm offering extremely efficient implementation and exhibiting the outstanding performance. The Virtex 5 FPGA family was considered to be a target family for the searching algorithm based on the dynamic programming idea. The obtained results are very promising and show the dominance of the dedicated platform over the general purpose PC-based systems.
    Źródło:
    Pomiary Automatyka Kontrola; 2011, R. 57, nr 1, 1; 15-18
    0032-4140
    Pojawia się w:
    Pomiary Automatyka Kontrola
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Cuckoo search algorithm for optimal placement and sizing of static var compensator in large-scale power systems
    Autorzy:
    Nguyen, K. P.
    Fujita, G.
    Dieu, V. N.
    Powiązania:
    https://bibliotekanauki.pl/articles/91782.pdf
    Data publikacji:
    2016
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    Cuckoo search algorithm
    optimal placement and sizing
    shunt VAR compensator
    optimal power flow
    FACTS
    Opis:
    This paper presents an application of Cuckoo search algorithm to determine optimal location and sizing of Static VAR Compensator. Cuckoo search algorithm is a modern heuristic technique basing Cuckoo species’ parasitic strategy. The L´evy flight has been employed to generate random Cuckoo eggs. Moreover, the objective function is a multiobjective problem, which minimizes loss power, voltage deviation and investment cost of Static VAR Compensator while satisfying other operating constraints in power system. Cuckoo search algorithm is evaluated on three case studies and compared with the Teaching-learning-based optimization, Particle Swarm optimization and Improved Harmony search algorithm. The results show that Cuckoo search algorithm is better than other optimization techniques and its performance is also better.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 2; 59-68
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Fault diagnosis model of rolling bearing based on parameter adaptive VMD algorithm and Sparrow Search Algorithm-Based PNN
    Autorzy:
    Li, Junxing
    Liu, Zhiwei
    Qiu, Ming
    Niu, Kaicen
    Powiązania:
    https://bibliotekanauki.pl/articles/24200836.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
    Tematy:
    rolling bearing
    failure diagnosis
    adaptive variational mode decomposition
    sparrow probabilistic neural network
    Opis:
    Fault diagnosis of rolling bearings is essential to ensure the proper functioning of the entire machinery and equipment. Variational mode decomposition (VMD) and neural networks have gained widespread attention in the field of bearing fault diagnosis due to their powerful feature extraction and feature learning capacity. However, past methods usually utilize experiential knowledge to determine the key parameters in the VMD and neural networks, such as the penalty factor, the smooth factor, and so on, so that generates a poor diagnostic result. To address this problem, an Adaptive Variational Mode Decomposition (AVMD) is proposed to obtain better features to construct the fault feature matrix and Sparrow probabilistic neural network (SPNN) is constructed for rolling bearing fault diagnosis. Firstly, the unknown parameters of VMD are estimated by using the genetic algorithm (GA), then the suitable features such as kurtosis and singular value entropy are extracted by automatically adjusting the parameters of VMD. Furthermore, a probabilistic neural network (PNN) is used for bearing fault diagnosis. Meanwhile, embedding the sparrow search algorithm (SSA) into PNN to obtain the optimal smoothing factor. Finally, the proposed method is tested and evaluated on a public bearing dataset and bearing tests. The results demonstrate that the proposed method can extract suitable features and achieve high diagnostic accuracy.
    Źródło:
    Eksploatacja i Niezawodność; 2023, 25, 2; art. no. 163547
    1507-2711
    Pojawia się w:
    Eksploatacja i Niezawodność
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Harmonogramowanie robót budowlanych w systemie potokowym z niepewnymi danymi
    Construction scheduling with tabu search algorithm and uncertain data
    Autorzy:
    Bożejko, W.
    Hejducki, Z.
    Rogalska, M.
    Rajba, P.
    Wodecki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/347653.pdf
    Data publikacji:
    2012
    Wydawca:
    Akademia Wojsk Lądowych imienia generała Tadeusza Kościuszki
    Tematy:
    niepewne dane
    stabilność
    harmonogramowanie
    przeszukiwanie z tabu
    roboty budowlane
    uncertain data
    stability
    scheduling
    tabu search
    construction works
    Opis:
    W pracy rozpatrujemy problem harmonogramowania przedsięwzięć budowlanych realizowanych w systemie potokowym. Są to bardzo ważne zagadnienia praktyki budowlanej, mające znaczący i bezpośredni wpływ na ostateczne koszty realizacji. Przedstawiamy założenia do harmonogramowania robót, algorytm jego rozwiązywania opartego na metodzie przeszukiwania z tabu (ang. tabu search) oraz jego modyfikację dla przypadku, gdy niepewne są czasy wykonywania prac. Porównujemy stabilność rozwiązań w przypadku, gdy niepewne dane są reprezentowane przez zmienne losowe o rozkładzie normalnym lub liczby rozmyte w trzypunktowej reprezentacji.
    This paper deals with some problems of synchronizing construction activities differing in their execution times. The methodology of calculating the times of execution of the activities, ensuring that there will be no collisions between them, is presented. The methodology is illustrated with numerical examples showing the successive steps of the algorithm and it is applied to complex works modelled as the flow shop problem. The tabu search algorithm is adapted to solve the problem.
    Źródło:
    Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki; 2012, 4; 80-95
    1731-8157
    Pojawia się w:
    Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Genetic algorithm combined with a local search method for identifying susceptibility genes
    Autorzy:
    Yang, C -H.
    Moi, S. -H.
    Lin, Y. -D.
    Chuang, L. -Y.
    Powiązania:
    https://bibliotekanauki.pl/articles/91586.pdf
    Data publikacji:
    2016
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    genetic algorithms
    identifying susceptibility genes
    local search algorithm
    Opis:
    Detecting genetic association models between single nucleotide polymorphisms (SNPs) in various disease-related genes can help to understand susceptibility to disease. Statistical tools have been widely used to detect significant genetic association models, according to their related statistical values, including odds ratio (OR), chi-square test (χ2), p-value, etc. However, the high number of computations entailed in such operations may limit the capacity of such statistical tools to detect high-order genetic associations. In this study, we propose lsGA algorithm, a genetic algorithm based on local search method, to detect significant genetic association models amongst large numbers of SNP combinations. We used two disease models to simulate the large data sets considering the minor allele frequency (MAF), number of SNPs, and number of samples. The three-order epistasis models were evaluated by chi-square test (χ2) to evaluate the significance (P-value < 0.05). Analysis results showed that lsGA provided higher chi-square test values than that of GA. Simple linear regression indicated that lsGA provides a significant advantage over GA, providing the highest β values and significant p-value.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 3; 203-212
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of the Morphological Parameters of a Metal Foam for the Highest Sound Absorption Coefficient Using Local Search Algorithm
    Autorzy:
    Jafari, Mohammad Javad
    Khavanin, Ali
    Ebadzadeh, Touraj
    Fazlali, Mahmood
    Sharak, Mohsen Niknam
    Madvari, Rohollah Fallah
    Powiązania:
    https://bibliotekanauki.pl/articles/176536.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    SAC
    Sound Absorption Coefficient
    LSA
    Local Search Algorithm
    metal foam
    optimization
    Opis:
    Due to its unique features, the metal foam is considered as one of the newest acoustic absorbents. It is a navel approach determining the structural properties of sound absorbent to predict its acoustical behavior. Unfortunately, direct measurements of these parameters are often difficult. Currently, there have been acoustic models showing the relationship between absorbent morphology and sound absorption coefficient (SAC). By optimizing the effective parameters on the SAC, the maximum SAC at each frequency can be obtained. In this study, using the Benchmarking method, the model presented by Lu was validated in MATLAB coding software. Then, the local search algorithm (LSA) method was used to optimize the metal foam morphology parameters. The optimized parameters had three factors, including porosity, pore size, and metal foam pore opening size. The optimization was applied to a broad band of frequency ranging from 500 to 8000 Hz. The predicted values were in accordance with benchmark data resulted from Lu model. The optimal range of the parameters including porosity of 50 to 95%, pore size of 0.09 to 4.55 mm, and pore opening size of 0.06 to 0.4 mm were applied to obtain the highest SAC for the frequency range of 500 to 800 Hz. The optimal amount of pore opening size was 0.1 mm in most frequencies to have the highest SAC. It was concluded that the proposed method of the LSA could optimize the parameters affecting the SAC according to the Lu model. The presented method can be a reliable guide for optimizing microstructure parameters of metal foam to increase the SAC at any frequency and can be used to make optimized metal foam.
    Źródło:
    Archives of Acoustics; 2020, 45, 3; 487-497
    0137-5075
    Pojawia się w:
    Archives of Acoustics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Cryptographically Strong Elliptic Curves of Prime Order
    Autorzy:
    Barański, Marcin
    Gliwa, Rafał
    Szmidt, Janusz
    Powiązania:
    https://bibliotekanauki.pl/articles/1844627.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Mersenne primes
    elliptic curves
    security requirements
    search algorithm
    Magma
    Opis:
    The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields Fp, where p is a Mersenne prime, one of the special primes or a random prime. We search for elliptic curves which orders are also prime numbers. The cryptographically strong elliptic curves are those for which the discrete logarithm problem is computationally hard. The required mathematical conditions are formulated in terms of parameters characterizing the elliptic curves. We present an algorithm to generate such curves. Examples of elliptic curves of prime order are generated with Magma.
    Źródło:
    International Journal of Electronics and Telecommunications; 2021, 67, 2; 207-212
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Use of Fuzzy Evaluation and Radical Cut-Off Strategy to Improve Apictorial Puzzle Assembly with Exhaustive Search Algorithm Performance
    Autorzy:
    Skulimowski, Stanisław
    Montusiewicz, Jerzy
    Badurowicz, Marcin
    Powiązania:
    https://bibliotekanauki.pl/articles/2180605.pdf
    Data publikacji:
    2022
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    fuzzy logic
    exhaustive search
    reassembling
    linguistic methods
    puzzle
    contour description
    fail-fast design
    cut-off strategy
    Opis:
    The paper presents an approach to solving the problem of assembling broken, flat elements using a letter notation of the elements’ contours and checking their matching using linguistic methods. Previous studies with the use of exhaustive search have shown effectiveness in finding possible connections, but they are burdened with a large number of calculations and the time needed to carry them out. In order to accelerate the process of searching for solutions, the possibility of using a fail-fast method of fuzzy assessment of potential combinations of elements was checked, as well as the method of cutting off potential, but not effective connections. The numerical experiment carried out showed a significant reduction in the number of trials and total computation time while maintaining the quality of the potential solutions found.
    Źródło:
    Advances in Science and Technology. Research Journal; 2022, 16, 2; 179--187
    2299-8624
    Pojawia się w:
    Advances in Science and Technology. Research Journal
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Real-time validation of an automatic generation control system considering HPA-ISE with crow search algorithm optimized cascade FOPDN-FOPIDN controller
    Autorzy:
    Babu, Naladi Ram
    Chiranjeevi, Tirumalasetty
    Devarapalli, Ramesh
    Knypiński, Łukasz
    Garcìa Màrquez, Fausto Pedro
    Powiązania:
    https://bibliotekanauki.pl/articles/27312009.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    crow search algorithm
    dish-stirling solar system
    AGC
    RT Lab
    FOPDN-FOPIDN controller
    Opis:
    This article validates the application of RT-Lab for the AGC studies of three-area systems. All the areas are employed with thermal-DSTS systems. A new controller named cascade FOPDN-FOPPIDN is employed. Its parameters are optimized using a CSA, subjecting to a new PI named HPA-ISE. The responses of the FOPDN-FOPIDN controller are related and are superior over PIDN and TIDN controllers. Moreover, the dominance of HPA-ISE is verified with ISE, and it performs better in terms of system dynamics. Further, the system performance reliability is analyzed with the AC-HVDC and is better than the AC system. Besides, sensitivity analysis recommends that the proposed FOPDN-FOPIDN at diverse conditions is robust and more reliability.
    Źródło:
    Archives of Control Sciences; 2023, 33, 2; 371--390
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Development of rapid and reliable cuckoo search algorithm for global maximum power point tracking of solar PV systems in partial shading condition
    Autorzy:
    Bentata, Khadidja
    Mohammedi, Ahmed
    Benslimane, Tarak
    Powiązania:
    https://bibliotekanauki.pl/articles/1845531.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    photovoltaic system
    maximum power point tracking
    partial shading
    cuckoo search algorithm
    Opis:
    The solar photovoltaic output power fluctuates according to solar irradiation, temperature, and load impedance variations. Due to the operating point fluctuations, extracting maximum power from the PV generator, already having a low power conversion ratio, becomes very complicated. To reach a maximum power operating point, a maximum power point tracking technique (MPPT) should be used. Under partial shading condition, the nonlinear PV output power curve contains multiple maximum power points with only one global maximum power point (GMPP). Consequently, identifying this global maximum power point is a difficult task and one of the biggest challenges of partially shaded PV systems. The conventional MPPT techniques can easily be trapped in a local maximum instead of detecting the global one. The artificial neural network techniques used to track the GMPP have a major drawback of using huge amount of data covering all operating points of PV system, including different uniform and non-uniform irradiance cases, different temperatures and load impedances. The biological intelligence techniques used to track GMPP, such as grey wolf algorithm and cuckoo search algorithm (CSA), have two main drawbacks; to be trapped in a local MPP if they have not been well tuned and the precision-transient tracking time complex paradox. To deal with these drawbacks, a Distributive Cuckoo Search Algorithm (DCSA) is developed, in this paper, as GMPP tracking technique. Simulation results of the system for different partial shading patterns demonstrated the high precision and rapidity, besides the good reliability of the proposed DCSA- GMPPT technique, compared to the conventional CSA-GMPPT.
    Źródło:
    Archives of Control Sciences; 2021, 31, 3; 495-526
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Development of rapid and reliable cuckoo search algorithm for global maximum power point tracking of solar PV systems in partial shading condition
    Autorzy:
    Bentata, Khadidja
    Mohammedi, Ahmed
    Benslimane, Tarak
    Powiązania:
    https://bibliotekanauki.pl/articles/1845518.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    photovoltaic system
    maximum power point tracking
    partial shading
    cuckoo search algorithm
    Opis:
    The solar photovoltaic output power fluctuates according to solar irradiation, temperature, and load impedance variations. Due to the operating point fluctuations, extracting maximum power from the PV generator, already having a low power conversion ratio, becomes very complicated. To reach a maximum power operating point, a maximum power point tracking technique (MPPT) should be used. Under partial shading condition, the nonlinear PV output power curve contains multiple maximum power points with only one global maximum power point (GMPP). Consequently, identifying this global maximum power point is a difficult task and one of the biggest challenges of partially shaded PV systems. The conventional MPPT techniques can easily be trapped in a local maximum instead of detecting the global one. The artificial neural network techniques used to track the GMPP have a major drawback of using huge amount of data covering all operating points of PV system, including different uniform and non-uniform irradiance cases, different temperatures and load impedances. The biological intelligence techniques used to track GMPP, such as grey wolf algorithm and cuckoo search algorithm (CSA), have two main drawbacks; to be trapped in a local MPP if they have not been well tuned and the precision-transient tracking time complex paradox. To deal with these drawbacks, a Distributive Cuckoo Search Algorithm (DCSA) is developed, in this paper, as GMPP tracking technique. Simulation results of the system for different partial shading patterns demonstrated the high precision and rapidity, besides the good reliability of the proposed DCSA-GMPPT technique, compared to the conventional CSA-GMPPT.
    Źródło:
    Archives of Control Sciences; 2021, 31, 3; 495-526
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A random search algorithm for cyclic delivery synchronization problem
    Wykorzystanie algorytmu heurystycznego do rozwiązania problemu synchronizacji dostaw cyklicznych do centrów przeładunkowych
    Autorzy:
    Gdowska, K.
    Książek, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/361679.pdf
    Data publikacji:
    2017
    Wydawca:
    Wyższa Szkoła Logistyki
    Tematy:
    cyclic delivery synchronization n problem
    mixed-integer programming
    optimization
    heuristic algorithms
    random search
    harmonogramowanie dostaw cyklicznych
    programowanie całkowitoliczbowe mieszane
    optymalizacja
    synchronizacja
    algorytmy heurystyczne
    Opis:
    Background: The paper is devoted to the cyclic delivery synchronization problem with vehicles serving fixed routes. Each vehicle is assigned to a fixed route: the series of supplier’s and logistic centers to be visited one after another. For each route the service frequency is fixed and known in advance. A vehicle loads at a supplier’s, then it delivers goods to a logistic center and either loads other goods there and delivers them to the next logistic center along the route or goes to another logistic center. Each logistic center can belong to several routes, so goods are delivered there with one vehicle and then they departure for the further journey with another truck. The objective of this cyclic delivery synchronization problem is to maximize the total number of synchronizations of vehicles arrivals in logistic centers and their load times, so that it is possible to organize their arrivals in repeatable blocks. Methods: Basing on the previously developed mathematical model for the cyclic delivery synchronization problem we built a random search algorithm for cyclic delivery synchronization problem. The random heuristic search utilizes objective-oriented randomizing. In the paper the newly-developed random search algorithm for cyclic delivery synchronization problem is presented. Results: A computational experiment consisted of employing the newly-developed random search algorithm for solving a series of cyclic delivery synchronization problems. Results obtained with the algorithm were compared with solutions computed with the exact method. Conclusions: The newly-developed random search algorithm for cyclic delivery synchronization problem gives results which are considerably close to the ones obtained with mixed-integer programming. The main advantage of the algorithm is reduction of computing time; it is relevant for utilization of this method in practice, especially for large-sized problems.
    Wstęp: W pracy przedstawiono problem synchronizowania dostaw cyklicznych do centrów przeładunkowych. Dostawy realizowane są na stałych trasach: pojazd, obsługujący daną trasę ma dostarczyć towar do centrum przeładunkowego, załadować tam inny towar i przewieźć go do kolejnego punktu trasy lub wykonać pusty przejazd do punktu załadunku. Punktami synchronizacji obsługi tras są centra logistyczne, w których niejednokrotnie towar przywieziony przez jeden pojazd, wyrusza w dalszą drogę innym. Dostawy na każdej trasie realizowane są ze stałą częstotliwością. Trasy dostaw oraz ilości przewożonego towaru są znane. Celem w zadaniu synchronizacji dostaw cyklicznych jest maksymalizacja liczby synchronizacji przyjazdów i pobytu pojazdów w centrach logistycznych tak, aby możliwe było grupowanie ich obsługi w bloki rozładunkowo-załadunkowe. Metody: Na podstawie opracowanego wcześniej modelu matematycznego dla problemu synchronizowania dostaw cyklicznych do centrów przeładunkowych został zbudowany algorytm heurystyczny poszukujący rozwiązań poprzez ukierunkowane losowanie. W artykule przedstawiono opracowany algorytm losowego przeszukiwania. Wyniki: Eksperyment obliczeniowy polegał na rozwiązaniu zestawu zadań synchronizowania dostaw cyklicznych przy pomocy opracowanego algorytmu i porównaniu uzyskanych wyników ze znanymi rozwiązaniami dokładnymi. Wnioski: Przedstawiony algorytm heurystyczny dla zadania synchronizowania dostaw cyklicznych pozwala na uzyskanie rozwiązań zbliżonych do wyników otrzymanych przy zastosowaniu modelu programowania matematycznego. Zaletą zastosowanego algorytmu jest znaczne skrócenie czasu poszukiwania rozwiązania, co może mieć znaczenie dla praktycznego wykorzystania zaproponowanej metody.
    Źródło:
    LogForum; 2017, 13, 3; 263-272
    1734-459X
    Pojawia się w:
    LogForum
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Failure Correction of a Linear Array of Coupled Parallel Vertical Dipole Antennas
    Autorzy:
    Patidar, Hemant
    Mahanti, Gautam Kumar
    Muralidharan, R.
    Singh, Prasanna Kumar
    Powiązania:
    https://bibliotekanauki.pl/articles/308045.pdf
    Data publikacji:
    2020
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    array failure correction
    cuckoo search algorithm
    wide null depth
    mutual coupling
    Opis:
    In this paper, a cuckoo search algorithm based on the combined characteristics of the brood parasite behavior and Levy flights is applied to correct the radiation pattern of a linear antenna array composed of parallel dipoles with faulty elements. An effort is made to restore the radiation pattern similar to one without any faulty elements, and the difference in the values of side lobe level and wide null depth of both patterns, as well as the voltage standing wave ratio obtained from the new voltage excitations become diminished. The examples presented in this paper show the effectiveness of this algorithm in correcting the radiation pattern of a linear array of 36 and 120 dipole antennas with four and ten failed elements, respectively. The results show that the matching condition and the wide null control produced by Cuckoo Search algorithm are more efficient in comparison with the benchmark failure correction algorithm. The approach adopted herein may be applied to other array configurations as well.
    Źródło:
    Journal of Telecommunications and Information Technology; 2020, 1; 62-69
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Application of the Harmony Search algorithm in solving the inverse heat conduction problem
    Zastosowanie algorytmu "Harmony Search" do rozwiązania odwrotnego zagadnienia przewodnictwa ciepła
    Autorzy:
    Hetmaniok, E.
    Jama, D.
    Słota, D.
    Zielonka, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/87282.pdf
    Data publikacji:
    2011
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    algorytm optymalizacyjny
    Harmony Search
    dźwięk
    przewodnictwo cieplne
    harmonia
    zagadnienie odwrotne
    optimization algorithm
    harmony search
    sound
    heat conduction
    harmony
    inverse problem
    Opis:
    In this paper the inverse heat conduction problem with boundary condition of the third kind is solved by applying the recently invented Harmony Search algorithm belonging to the group of optimization algorithms inspired by the natural behaviors or processes. In this case the applied algorithm imitates the process of searching for the harmony in jazz music composition.In this paper the inverse heat conduction problem with boundary condition of the third kind is solved by applying the recently invented Harmony Search algorithm belonging to the group of optimization algorithms inspired by the natural behaviors or processes. In this case the applied algorithm imitates the process of searching for the harmony in jazz music composition.
    Celem niniejszego artykułu jest rozwiązanie odwrotnego zagadnienia przewodnictwa ciepła z warunkiem brzegowym trzeciego rodza- ju przy użyciu niedawno zaproponowanego algorytmu „Harmony Search” (poszukiwania harmonii). Zastosowany algorytm należy do grupy algoryt- mów optymalizacyjnych inspirowanych zachowaniami bądź procesami za- chodzącymi w rzeczywistym świecie, w szczególności imituje proces poszu- kiwania harmonii dźwięków podczas improwizacji jazzowej.
    Źródło:
    Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska; 2011, 1; 99-108
    2084-073X
    Pojawia się w:
    Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Adaptive ant-colony algorithm for semantic query routing
    Autorzy:
    Gómez Santillán, C.
    Cruz Reyes, L.
    Schaeffer, E.
    Meza, E.
    Rivera Zarate, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/384885.pdf
    Data publikacji:
    2011
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    parameter tuning
    search algorithm
    peer-to-peer
    adaptive algorithm
    local environment
    ant colony algorithms
    Opis:
    The most prevalent P2P application today is file sha ring, both among scientific users and the general public. Afundamental process in file sharing systems is the search mechanism. The unstructured nature of real-world largescale complex systems poses a challenge to the search me thods, because global routing and directory services are impractical to implement. This paper presents a new antcolony algorithm, Adaptive Neighboring-Ant Search (AdaNAS), for the semantic query routing problem (SQRP) in a P2P network. The proposed algorithm incor porates an adaptive control parameter tuning technique for runtime estimation of the time-to-live (TTL) of the ants. AdaNAS uses three strategies that take advantage of the local environment: learning, characterization, and explo ration. Two classical learning rules are used to gain ex perience on past performance using three new learning functions based on the distance traveled and the resources found by the ants. The experimental results show that the AdaNAS algorithm outperforms the NAS algorithm where the TTLvalue is not tuned at runtime.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 1; 85-94
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Learning Search Algorithms: An Educational View
    Autorzy:
    Janota, M.
    Šimák, V.
    Hrbček, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/116502.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Search Algorithm
    Learning Search Algorithms
    educational view
    Artificial Intelligence Method
    Search Method
    Labyrinth
    Dijkstra algorithm
    Opis:
    Artificial intelligence methods find their practical usage in many applications including maritime industry. The paper concentrates on the methods of uninformed and informed search, potentially usable in solving of complex problems based on the state space representation. The problem of introducing the search algorithms to newcomers has its technical and psychological dimensions. The authors show how it is possible to cope with both of them through design and use of specialized authoring systems. A typical example of searching a path through the maze is used to demonstrate how to test, observe and compare properties of various search strategies. Performance of search methods is evaluated based on the common criteria.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 565-570
    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ł:
    Weryfikacja poprawności działania algorytmu tabu search w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących
    Verification of correct operation of a tabu search algorithm for elastic task model scheduling in control and measurement systems
    Autorzy:
    Powroźnik, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/152993.pdf
    Data publikacji:
    2010
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    szeregowanie zadań
    elastyczny model
    algorytm tabu search
    task scheduling
    elastic task model
    tabu search algorithm
    Opis:
    W artykule przedstawiono ideę zastosowania algorytmu tabu search do wyznaczenia okresu zadań w elastycznym modelu szeregowania zadań. Wyniki przeprowadzonych symulacji dowodzą przydatność algorytmu w doborze parametrów czasowych w elastycznym modelu szeregowania zadań. Rozdział pierwszy zawiera tło zastosowania teorii szeregowania zadań w systemach pomiarowo - sterujących. Rozdział drugi wprowadza czytelnika do zastosowania elastycznego modelu szeregowania zadań w systemach pomiarowo - sterujących. Rozdział ten zawiera krótki przegląd literaturowy prezentowanej tematyki [1, 2, 3]. Rozdział trzeci przedstawia ideę zastosowania wybranego algorytmu heurystycznego tabu serach w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących. Rysunek pierwszy przedstawia schemat blokowy szeregowania zadań przy zastosowaniu algorytmu tabu search. Rozdział czwarty zawiera wyniki z przeprowadzonych symulacji zastosowania algorytmu tabu search w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących. Podsumowanie zawiera najważniejsze wnioski wynikające ze stosowania omawianego algorytmu w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących.
    In this paper use of a tabu search algorithm for elastic task model scheduling is presented. The results of simulations confirm usefulness of this method for assigning the time parameters in elastic task model scheduling. In the first section, the background of application of task model scheduling to control and measurement systems is outlined. The second section deals with introduction to using the elastic task model scheduling for control and measurement systems. This section provides a brief literature review of the presented subjects [1, 2, 3]. The third section presents an idea of applying the selected tabu search heuristic algorithm to the elastic task model scheduling in control and measurement systems. The block diagram of the elastic task model scheduling with use of the tabu search algorithm is shown in Fig. 1. The fourth section contains the results of simulations carried out for the elastic task model scheduling with use of the tabu search algorithm in control and measurement systems. At the end there are presented the main conclusions drawn from using the tabu search algorithm for assigning the task time parameters in the elastic task model scheduling in control and measurement systems.
    Źródło:
    Pomiary Automatyka Kontrola; 2010, R. 56, nr 11, 11; 1345-1347
    0032-4140
    Pojawia się w:
    Pomiary Automatyka Kontrola
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Balancing of a linear elastic rotor-bearing system with arbitrarily distributed unbalance using the Numerical Assembly Technique
    Autorzy:
    Quinz, Georg
    Prem, Marcel S.
    Klanner, Michael
    Ellermann, Katrin
    Powiązania:
    https://bibliotekanauki.pl/articles/2086883.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Numerical Assembly Technique
    rotor dynamics
    modal balancing
    recursive eigenvalue search algorithm
    dynamika wirnika
    wyważanie modalne
    Opis:
    In this paper, a new application of the Numerical Assembly Technique is presented for the balancing of linear elastic rotor-bearing systems with a stepped shaft and arbitrarily distributed mass unbalance. The method improves existing balancing techniques by combining the advantages of modal balancing with the fast calculation of an efficient numerical method. The rotating stepped circular shaft is modelled according to the Rayleigh beam theory. The Numerical Assembly Technique is used to calculate the steady-state harmonic response, eigenvalues and the associated mode shapes of the rotor. The displacements of a simulation are compared to measured displacements of the rotor-bearing system to calculate the generalized unbalance for each eigenvalue. The generalized unbalances are modified according to modal theory to calculate orthogonal correction masses. In this manner, a rotor-bearing system is balanced using a single measurement of the displacement at one position on the rotor for every critical speed. Three numerical examples are used to show the accuracy and the balancing success of the proposed method.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 6; e138237, 1--7
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Tabu Search approach in coherent co-synthesis of multiprocessors systems
    Autorzy:
    Drabowski, M.
    Czajkowski, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/92834.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
    Tematy:
    synthesis of system
    coherent
    identification resources
    task scheduling
    NP-complete problem
    heuristic algorithm
    tabu search algorithm
    Opis:
    This paper presents the use of Tabu Search algorithm for solving the problems of coherent synthesis of multiprocessor computer systems. The paper includes a coherent solution of both optimization of partition resources and optimization of tasks scheduling. This publication shows results of computational experiments for different instances of system synthesis problems.
    Źródło:
    Studia Informatica : systems and information technology; 2006, 1(7); 31-45
    1731-2264
    Pojawia się w:
    Studia Informatica : systems and information technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Wykorzystanie algorytmu Tabu Search do lokalizacji baterii kondensatorów w sieci elektroenergetycznej
    Application of the Tabu Search algorithm for localization of capacitor banks in a power system
    Autorzy:
    Wicher, P.
    Wilkosz, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/397304.pdf
    Data publikacji:
    2011
    Wydawca:
    ENERGA
    Tematy:
    sieć elektroenergetyczna
    kondensator
    electric power networks
    capacitor
    Opis:
    Artykuł traktuje o znajdowaniu najkorzystniejszej lokalizacji baterii kondensatorów w sieci elektroenergetycznej. Po ogólnym omówieniu rozwiązywania tego zadania autorzy skupili uwagę na wykorzystaniu algorytmu poszukiwania z tabu (Tabu Search). W dalszej części pracy znajdujemy zasady postępowania według algorytmu poszukiwania z tabu. Po tym zaprezentowano charakterystykę różnych metod znajdowania optymalnej lokalizacji baterii kondensatorów, których wspólną cechą jest stosowanie algorytmu poszukiwania z tabu. Na zakończenie artykułu dokonano porównania przedstawionych metod lokalizacji baterii kondensatorów.
    The paper discusses the process of finding the most optimal locations for capacitor banks within a power network. After general presenting the solution of this task, the authors focused on the application of the tabu search algorithm. A further part of the paper presents rules for applying the tabu search algorithm to the considered task, and various methods for finding the optimal capacitor bank locations using that algorithm are presented. Finally, the previously presented methods for finding the optimal capacitor bank locations are compared.
    Źródło:
    Acta Energetica; 2011, 2; 67-73
    2300-3022
    Pojawia się w:
    Acta Energetica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Embedded direct search of optimal designs for finite noise experiments
    Optymalne planowanie eksperymentów w przypadku dużego szumu metodą homotopii opartej na bezgradientowej minimalizacji
    Autorzy:
    Schulz, F.
    Frischmuth, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/224216.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    planowanie eksperymentu
    układ dynamiczny
    optymalizacja
    model nieliniowy
    parameter identification
    nonlinear regression
    embedding method
    direct search algorithm
    Opis:
    We study experimental designs for the identification of nonlinear model parameters. As optimality criterion we assume minimality of the error in a huge number of identifications run on simulated data, which are generated with known parameters and a given error distribution. The optimal design depends on the nonlinear parameters. We find the optimal solution set by combining a path following strategy and a direct search method.
    W pracy badane są optymalne plany eksperymentów wykonywanych do celów identyfikacji parametrów modelu nieliniowego układu dynamicznego. Jako kryterium optymalności przyjęto minimum błędów otrzymanych w dużej liczbie identyfikacji wykonanych na symulowanych danych, które zostały wygenerowane ze znanymi parametrami i przy założonym rozkładzie błędów. Optymalny plan zależy od parametrów modelu. Badano metody bezgradientowe połączone z homotopia, które okazują się bardzo efektywne w przypadku rozpatrywanego zagadnienia. Wyniki otrzymane w przypadku skończonych wartości błędów mogą się istotnie różnić od wyników otrzymanych z wykorzystaniem teorii asymptotycznej dla małego szumu.
    Źródło:
    Archives of Transport; 2010, 22, 1; 119-137
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Harmonogramowanie robót budowlanych z zastosowaniem algorytmu Tabu Search z rozmytymi czasami wykonania zadań
    Scheduling of construction works using a tabu search algorithm with fuzzy task completion times
    Autorzy:
    Rogalska, M.
    Bożejko, W.
    Hejducki, Z.
    Wodecki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/161714.pdf
    Data publikacji:
    2009
    Wydawca:
    Polski Związek Inżynierów i Techników Budownictwa
    Tematy:
    inwestycja budowlana
    proces budowlany
    harmonogram robót
    niepewność
    czas wykonania zadań
    czas rozmyty
    algorytm tabu search
    construction project
    construction process
    schedule of works
    uncertainty
    task execution time
    fuzzy time
    tabu search algorithm
    Opis:
    Praca ta stanowi kontynuację studiów różnych autorów nad zagadnieniami związanymi z uwzględnieniem niepewności w harmonogramowaniu robót budowlanych. Jednym ze sposobów reprezentowania niepewności jest zastosowanie elementów teorii zbiorów rozmytych, umożliwiających oszacowanie czasów wykonania prac oraz cyklu realizacji kompleksu robót.
    This paper continues the authors' work on issues relating to taking account of uncertainties in the scheduling of construction works. One way of representing uncertainty is to use elements of the theory of fuzzy sets, which make it possible to estimate work completion times and the execution cycle for a comprehensive series of works.
    Źródło:
    Przegląd Budowlany; 2009, R. 80, nr 7-8, 7-8; 76-80
    0033-2038
    Pojawia się w:
    Przegląd Budowlany
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Cancer growth treatment using immune linear quadratic regulator based on crow search optimization algorithm
    Autorzy:
    Hussein, Mohammed A.
    Karam, Ekhlas H.
    Habeeb, Rokaia S.
    Powiązania:
    https://bibliotekanauki.pl/articles/1837793.pdf
    Data publikacji:
    2021
    Wydawca:
    Polskie Towarzystwo Promocji Wiedzy
    Tematy:
    oncolytic virotherapy
    feedback mechanism
    crow search algorithm
    Immune-LQR
    wiroterapia onkolityczna
    mechanizm sprzężenia zwrotnego
    algorytm wyszukiwania w tłumie
    Opis:
    The rapid and uncontrollable cell division that spreads to surrounding tissues medically termed as malignant neoplasm, cancer is one of the most common diseases worldwide. The need for effective cancer treatment arises due to the increase in the number of cases and the anticipation of higher levels in the coming years. Oncolytic virotherapy is a promising technique that has shown encouraging results in several cases. Mathematical models of virotherapy have been widely developed, and one such model is the interaction between tumor cells and oncolytic virus. In this paper an artificially optimized Immune-Linear Quadratic Regulator (LQR) is introduced to improve the outcome of oncolytic virotherapy. The control strategy has been evaluated in silico on number of subjects. The crow search algorithm is used to tune immune and LQR parameters. The study is conducted on two subjects, S1 and S3, with LQR and Immune-LQR. The experimental results reveal a decrease in the number of tumor cells and remain in the treatment area from day ten onwards, this indicates the robustness of treatment strategies that can achieve tumor reduction regardless of the uncertainty in the biological parameters.
    Źródło:
    Applied Computer Science; 2021, 17, 2; 56-69
    1895-3735
    Pojawia się w:
    Applied Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new method of decision making in multi-objective optimal placement and sizing of distributed generators in the smart grid
    Autorzy:
    Khoshayand, Hossein Ali
    Wattanapongsakorn, Naruemon
    Mahdavian, Mehdi
    Ganji, Ehsan
    Powiązania:
    https://bibliotekanauki.pl/articles/2202555.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    backward-forward load distribution
    fuzzy logic
    iterative search algorithm
    multi-objective optimization
    shortest distance from the origin
    weighted sum
    Opis:
    One of the most important aims of the sizing and allocation of distributed generators (DGs) in power systems is to achieve the highest feasible efficiency and performance by using the least number of DGs. Considering the use of two DGs in comparison to a single DG significantly increases the degree of freedom in designing the power system. In this paper, the optimal placement and sizing of two DGs in the standard IEEE 33-bus network have been investigated with three objective functions which are the reduction of network losses, the improvement of voltage profiles, and cost reduction. In this way, by using the backward-forward load distribution, the load distribution is performed on the 33-bus network with the power summation method to obtain the total system losses and the average bus voltage. Then, using the iterative search algorithm and considering problem constraints, placement and sizing are done for two DGs to obtain all the possible answers and next, among these answers three answers are extracted as the best answers through three methods of fuzzy logic, the weighted sum, and the shortest distance from the origin. Also, using the multi-objective non-dominated sorting genetic algorithm II (NSGA-II) and setting the algorithm parameters, thirty-six Pareto fronts are obtained and from each Pareto front, with the help of three methods of fuzzy logic, weighted sum, and the shortest distance from the origin, three answers are extracted as the best answers. Finally, the answer which shows the least difference among the responses of the iterative search algorithm is selected as the best answer. The simulation results verify the performance and efficiency of the proposed method.
    Źródło:
    Archives of Electrical Engineering; 2023, 72, 1; 253--271
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Controlling the mean arterial pressure by modified model reference adaptive controller based on two optimization algorithms
    Autorzy:
    Haamed, Rawaa
    Hameed, Ekhlas
    Powiązania:
    https://bibliotekanauki.pl/articles/117814.pdf
    Data publikacji:
    2020
    Wydawca:
    Polskie Towarzystwo Promocji Wiedzy
    Tematy:
    Mean Arterial Pressure
    Squirrel Search Algorithm
    Model Reference Adaptive Controller
    średnie ciśnienie tętnicze
    algorytm wyszukiwania
    kontroler adaptacyjny odniesienia modelu
    Opis:
    This paper Presents Modified Model Reference Adaptive Controller (MRAC) to regulate the hight blood pressure. It is based on slate model that repre-sent the mathematical equation that clarifies relationship between blood pressure and vasoactive drug injection. In this work Squirrel Search Algo-rithm (SSA) and Grey Wolf Optimizer (GWO) algorithms are considered to optimize the controller parameters. the results showed that the suggested controller has good performance and stabilize the mean arterial pressure with small settling time (below than 400s) and small overshoot (below than 1 mmHg) with low amount of error.
    Źródło:
    Applied Computer Science; 2020, 16, 2; 53-67
    1895-3735
    Pojawia się w:
    Applied Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The application of dynamic bayesian network to reliability assessment of emu traction system
    Zastosowanie dynamicznych sieci bayesowskich do oceny niezawodności elektrycznego systemu trakcyjnego
    Autorzy:
    Wang, Y.
    Bi, L.
    Wang, S.
    Lin, S.
    Xiang, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/302105.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
    Tematy:
    dynamiczna sieć bayesowska
    system trakcyjny
    ocena niezawodności
    algorytm przeszukiwania wszerz
    DBN
    traction system
    reliability assessment
    breadth-first-search algorithm
    Opis:
    W artykule omówiono nowatorskie zastosowanie dynamicznej sieci bayesowskiej (DBN) do oceny niezawodności elektrycznego systemu trakcyjnego ze szczególnym uwzględnieniem metod modelowania DBN. W związku z rosnącą złożonością elektrycznych systemów trakcyjnych oraz wynikającą z niej coraz większą ilością współzależności między komponentami, systemy te narażone są coraz częściej na awarie części składowych. Chociaż istnieje wiele badań dotyczących oceny niezawodności systemów trakcyjnych, stosowane obecnie narzędzia nie mają odpowiedniej mocy modelowania koniecznej do opisu zależności funkcjonalnych i czasowych pomiędzy częściami składowymi. W niniejszej pracy zaproponowano nową metodę modelowania generowania DBN, którą można stosować w odniesieniu do systemów składających się z pewnych określonych komponentów oraz różnych typów rozchodzących się przez nie przepływów. Zależności funkcjonalne i czasowe opisano, odpowiednio, za pomocą tablicy komponentowych prawdopodobieństw warunkowych (Component-based Conditional Probability Table, CPT) oraz tablicy czasowo-zależnych prawdopodobieństw warunkowych. Ponieważ złożoność systemu nie pozwala na zamodelowanie go w prosty sposób jako DBN, do automatycznej budowy modelu DBN wykorzystano algorytm przeszukiwania wszerz (Breadth-First-Search). Oceny niezawodności systemu trakcyjnego z wykorzystaniem proponowanej metody opartej na DBN można dokonywać w dowolnym czasie, co ma ogromne znaczenie przy planowaniu konserwacji w celu zapewnienia bezpieczeństwa systemu.
    The article introduces a novel application of a Dynamic Bayesian Network (DBN) in the reliability assessment with regard to the traction system of Electric Multiple Units (EMU), which focus on modeling approach to DBN construction. As a result of high complexity and growing interdependencies, it is increasingly vulnerable to the failure of components. Although many studies on the use of BN for estimating the system reliability have been conducted, there is a lack of effective modeling power regarding current tools in depicting both functional and temporal dependencies between components. In this paper, a new modeling approach to DBN generation is submitted, which can be applied to the system made up of certain components and different types of flows propagating through them. The Component-based CPT (Conditional Probability Table) and Time-dependent CPT are used to describe functional dependencies and temporal dependencies respectively. As the complexity of the system cannot be modeled in a tractable way as a DBN, a Breadth-First-Search (BFS) algorithm is introduced for the construction of the DBN model in an automated manner. With the application of the proposed DBN-based approach, the reliability of the traction system can be evaluated at any given time, which is of great significance to determine the plan of maintenance in an effort to ensure the system safety.
    Źródło:
    Eksploatacja i Niezawodność; 2017, 19, 3; 349-357
    1507-2711
    Pojawia się w:
    Eksploatacja i Niezawodność
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Oprogramowanie do wyznaczania kształtu impulsu napięciowego zasilającego silnik BLDC wykorzystujące metodę poszukiwana kukułczego
    Computer Software for Determining the Shape of the Supply Voltage Waveform the BLDC Motor Using Cuckoo Search Algorithm
    Autorzy:
    Knypiński, Łukasz
    Kuroczycki, Sebastian
    Kurzawa, Milena
    Powiązania:
    https://bibliotekanauki.pl/articles/34655806.pdf
    Data publikacji:
    2021
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    optymalizacja
    metoda poszukiwania kukułczego
    bezszczotkowe silniki prądu stałego
    model o parametrach skupionych
    Opis:
    W pracy przedstawiono algorytm oraz oprogramowanie do wyznaczania kształtu impulsu napięciowego zasilającego pasma stojana bezszczotkowego silnika prądu stałego (BLDC). Aplikacja została napisana w języku Python 3.8. Składa się z dwóch niezależnych modułów: (a) procedury optymalizacyjnej oraz (b) modelu matematycznego silnika BLDC. Model matematyczny silnika wykorzystuje uproszczony model o parametrach skupionych. Efektywność metody poszukiwania kukułczego badano wyznaczając minimum globalne funkcji analitycznej. Porównano wyniki obliczeń symulacyjnych dla dwóch metod optymalizacji: (a) metody poszukiwania kukułczego oraz (b) metody wzorowanej na echolokacyjnym zachowaniu nietoperzy. Wyznaczono parametry impulsu napięciowego zapewniającego minimalizację współczynnika tętnień.
    In the paper an algorithm and computer software for determining the shape of the supply voltage waveform for a brushless DC motor (BLDC) was developed. The computer application was made in the Python 3.8. The software consists of two independent modules: (a) the optimization procedure and (b) the mathematical model of the BLDC motor. The mathematical model of device was based on lumped parameters. The optimization procedure contains the cuckoo search optimization algorithm. The performance of cuckoo search algorithm was compared with bat algorithm using Rosenbrock function. Finally the optimization procedure was applied to determining the supply waveform ensuring the minimization of torque ripple in BLDC motor.
    Źródło:
    Poznan University of Technology Academic Journals. Electrical Engineering; 2021, 106; 17-29
    1897-0737
    Pojawia się w:
    Poznan University of Technology Academic Journals. Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Global minimum search using DMC algorithm with continuous weights
    Autorzy:
    Kazimirski, J. K.
    Powiązania:
    https://bibliotekanauki.pl/articles/121973.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
    Tematy:
    DMC algorithm
    diffusion Monte Carlo
    continuous objective function
    minimum search
    algorytm DMC
    metoda Monte Carlo
    funkcja ciągłego celu
    wyszukiwanie minimalne
    Opis:
    In this study we presented an algorithm for an unconstrained optimization of a continuous objective function, inspired by the Diffusion Monte Carlo method using a weight-based implementation. In this algorithm a cloud of replicas explores the solution space. Replicas are moved and evaluated after each step. Each replica carries an additional parameter (weight) which reflects the quality of its local solution. This parameter is updated after each step. Most inefficient replicas, i.e. replicas with the lowest weights, are occasionally replaced with their highest weight counterparts. In our study we present the basic implementation of the algorithm and compare its performance with other approaches, including the previously used implementation of DMC algorithm with a fluctuating population.
    Źródło:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2011, 16; 117-122
    2450-9302
    Pojawia się w:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    DSSA+: distributed collision avoidance algorithm in an environment where both course and speed changes are allowed
    Autorzy:
    Hirayama, K.
    Miyake, K.
    Shiotani, T.
    Okimoto, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/116483.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    collision avoidance
    collision avoidance algorithm
    vessel course changes
    vessel speed changes
    Distributed Stochastic Search Algorithm (DSSA)
    colregs
    ARPA
    Distributed Constraint Optimization Problem (DCOP)
    Opis:
    Distributed Stochastic Search Algorithm (DSSA) is one of state-of-the-art distributed algorithms for the ship collision avoidance problem. In DSSA, whenever a ship encounters with any number of other ships (neighboring ships), she will select her course with a minimum cost after coordinating their decisions with her neighboring ships. The original DSSA assumes that ships can change only their courses while keeping their speed considering kinematic properties of ships in general. However, considering future possibilities to address more complex situations that may cause ship collision or to deal with collision of other vehicles (such as mobile robots or drones), the options of speed changes are necessary for DSSA to make itself more flexible and extensive. In this paper, we present DSSA+, as a generalization of DSSA, in which speed change are naturally incorporated as decision variables in the original DSSA. Experimental evaluations are provided to show how powerful this generalization is.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 1; 117-123
    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ł:
    Zastosowanie algorytmów przeszukiwania grafów do analizy obrazów medycznych
    Analysis of medical images based on graph search algorithms
    Autorzy:
    Dimitrova-Grekow, T.
    Dąbkowski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/156629.pdf
    Data publikacji:
    2012
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    analiza obrazów medycznych
    algorytmy przeszukiwania grafów
    uczenie maszynowe
    eksploracja danych
    rozpoznawanie choroby
    image analysis
    graph search algorithm
    machine learning
    data mining
    disease recognition
    Opis:
    W artykule przedstawiono wyniki testów niekonwencjonalnego zastosowania metod do przeszukiwania grafów w celu analizy obrazów powstałych z rezonansu magnetycznego głowy. Zaprezentowano GUI do automatycznej obróbki serii obrazów. Zbudowane klasyfikatory wykazały, że metoda BFS analizy plików DICOM, po odpowiednej selekcji cech, pozwala na 100% rozpoznawanie chorych na wodogłowie i ponad 90% zdrowych, co zachęca do dalszych badań i obserwacji, np. czy osoby sklasyfikowane błędnie jako chorzy, po czasie rzeczywiście nie rozwinęli tej choroby.
    There are many methods for image segmentation [1, 2]: threshold, area, edge and hybrid methods. Area methods indicate groups of similar pixels form local regions [3, 4]. Edge methods detect boundaries between homogeneous segments [5, 6, 7]. In this paper we present the results of tests of unconventional implementation of graph search methods for the analysis of images generated from magnetic resonance imaging [8]. We explored the effectiveness of different approaches for dividing areas within a similar gray scale, using adapted graph search algorithms (DFS, BFS) after appropriate modification (Fig. 1). For this purpose, the Weka package (a tool for pre-processing, classification, regression, clustering and data visualization) was used [9]. A training set was generated after analyzing all the series of images from the database. First, we evaluated models created using certain algorithms and compared their efficacy (Tab. 1). This was followed by a selection of attributes (Tab. 2) and a re-evaluation of the models (Tab. 3). Comparison of the results of both evaluations showed that after selection of the relevant product attributes, you can achieve up to 100% detection of patients with hydrocephalus and over 90% proper recognition of healthy persons. This encourages further research and observation, such as whether persons wrongly classified as sick actually developed the disease in time. We designed a web application for the study, written in Windows Azure, as well as a GUI for automatic processing of a series of images (Fig. 2).
    Źródło:
    Pomiary Automatyka Kontrola; 2012, R. 58, nr 7, 7; 578-580
    0032-4140
    Pojawia się w:
    Pomiary Automatyka Kontrola
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analiza wpływu obiektów przewodzących i magnetycznych na dokładność działania systemu elektromagnetycznej nawigacji medycznej oraz możliwości ograniczenia tego wpływu
    Analysis of the influence of conductive and magnetic objects on the accuracy of electro-magnetic medical navigation system operation and possibilities of reducing that influence
    Autorzy:
    Tewel, N.
    Moroń, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/157705.pdf
    Data publikacji:
    2013
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    elektromagnetyczna nawigacja medyczna
    deformacje rozkładu pola magnetycznego
    błąd określenia położenia w przestrzeni
    electromagnetic medical navigation
    distortion of magnetic field
    "pattern search" algorithm
    Opis:
    Przedmiotem artykułu są badania wpływu obiektów przewodzących i magnetycznych na dokładność działania systemu nawigacji elektromagnetycznej przeznaczonego do zastosowań medycznych oraz możliwości eliminacji lub ograniczenia tego wpływu. Stosując modelowanie i symulację metodą elementów skończonych (MES) dokonano liczbowego oszacowania wpływu typowych obiektów wymienionego rodzaju na błąd określenia położenia punktów w przestrzeni z użyciem takiego systemu. Wynikiem tych prac jest zbiór wskazówek i wytycznych umożliwiających ograniczenie tego wpływu.
    Medical navigation is used both in surgery and diagnostics to compute position of the distant end of medical tools immersed inside the patient’s body [1]. One of medical navigation methods is the electromagnetic navigation. Its main advantage is lack of requirement of providing a clean line of sight (LOS) between the tools and a source of the magnetic field (emitter). A real disadvantage of the electromagnetic method is its sensitivity to the influence of conductive and magnetic objects placed inside the operating space of the system [4, 5]. The main subject of this paper is an analysis of the influence of typical medical tools and other metal objects that can be used inside or close to the electromagnetic navigation system intended for laryngological applications. The objective set was obtained by using the finite element method of modeling and simulation. Description of the used models is given in Tables 1 and 2, and Fig. 1. Figs. 3 – 10 show the position determination error caused by the presence of conductive and magnetic objects, at different frequencies of the exciting field. According to the presented results, it is impossible to select the frequency range enabling simultaneous reduction of errors caused by both conductive non-magnetic and magnetic objects of different size and shape. However, for some selected objects used in the laryngological system, the most appropriate range of frequency seems to be hundreds of kilohertz. Bigger conductive or magnetic objects should be spaced at a distance no smaller than single meters from the operating space of the system.
    Źródło:
    Pomiary Automatyka Kontrola; 2013, R. 59, nr 5, 5; 473-476
    0032-4140
    Pojawia się w:
    Pomiary Automatyka Kontrola
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Verification of ships trajectory planning algorithms using real navigational data
    Autorzy:
    Lazarowska, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/117103.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Visibility Graph-search Algorithm (VGA)
    Discrete Artificial Potential Field (DAPF)
    real navigational data
    ARPA
    ship's trajectory planning
    ship's trajectory planning algorithms
    Ant Colony Optimization (ACO)
    Trajectory Base Algorithm (TBA)
    Opis:
    The paper presents results of ship's safe trajectory planning algorithms verification. Real navigational data registered from a radar with an Automatic Radar Plotting Aid on board the research and training ship Horyzont II were used as input data to the algorithms. The algorithms verified in the presented research include the Ant Colony Optimization algorithm (ACO), the Trajectory Base Algorithm (TBA), the Visibility Graph-search Algorithm (VGA) ant the Discrete Artificial Potential Field algorithm (DAPF). Details concerning data registration and exemplary results obtained with the use or real navigational data are introduced and summarized in the paper. Presented results prove the applicability of proposed algorithms for solving the ship's safe trajectory planning problem.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 3; 559-564
    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ł:
    Optimal design of RC frames using a modified hybrid PSOGSA algorithm
    Optymalny projekt ramy RC z wykorzystaniem zmodyfikowanego algorytmu hybrydowego PSOGSA
    Autorzy:
    Chutani, S.
    Singh, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/230376.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    projekt optymalny
    konstrukcja żelbetowa
    optymalizacja demokratyczna roju cząstek
    samoadaptacyjny algorytm
    grawitacyjnego wyszukiwania
    projektowanie
    Indie
    norma indyjska
    optimum design
    reinforced concrete structure
    democratic particle swarm optimization
    selfadaptive gravitational search algorithm
    design
    Indian standard
    Opis:
    The present study has been taken up to emphasize the role of the hybridization process for optimizing a given reinforced concrete (RC) frame. Although various primary techniques have been hybrid in the past with varying degree of success, the effect of hybridization of enhanced versions of standard optimization techniques has found little attention. The focus of the current study is to see if it is possible to maintain and carry the positive effects of enhanced versions of two different techniques while using their hybrid algorithms. For this purpose, enhanced versions of standard particle swarm optimization (PSO) and a standard gravitational search algorithm (GSA), were considered for optimizing an RC frame. The enhanced version of PSO involves its democratization by considering all good and bad experiences of the particles, whereas the enhanced version of the GSA is made self-adaptive by considering a specific range for certain parameters, like the gravitational constant and a set of agents with the best fitness values. The optimization process, being iterative in nature, has been coded in C++. The analysis and design procedure is based on the specifications of Indian codes. Two distinct advantages of enhanced versions of standard PSO and GSA, namely, better capability to escape from local optima and a faster convergence rate, have been tested for the hybrid algorithm. The entire formulation for optimal cost design of a frame includes the cost of beams and columns. The variables of each element of structural frame have been considered as continuous and rounded off appropriately to consider practical limitations. An example has also been considered to emphasize the validity of this optimum design procedure.
    W niniejszym artykule przedstawiono bardziej realistyczny i optymalny projekt żlbetowych ram konstrukcyjnych (RC) poprzez hybrydyzację ulepszonych wersji standardowej optymalizacji roju cząsteczek (PSO) oraz standardowy algorytm wyszukiwania grawitacyjnego (GSA). Podejście proponowane w niniejszej pracy koncentruje się na hybrydyzacji ulepszonych wersji standardowej optymalizacji roju cząsteczek (PSO) oraz standardowym algorytmie wyszukiwania grawitacyjnego (GSA). PSO została zdemokratyzowana poprzez uwzględnienie wszystkich dobrych i złych doświadczeń w zakresie cząsteczek, podczas gdy GSA został zmieniony na samodostosowujący, uwzględniając określony zakres dla niektórych parametrów, takich jak np. stała grawitacyjna i zestaw czynników o najlepszych wartościach sprawności. Optymalny rozmiar i wzmocnienie elementów zostały określone dzięki zastosowaniu techniki w środowisku komputerowym, w którym cały proces analizy, projektowania i optymalizacji został zakodowany w C++. Procedura analizy i projektowania przebiega zgodnie ze specyfikacjami kodów indyjskich. Okazało się, że zastosowanie samodostosowującego algorytmu wyszukiwania grawitacyjnego wraz z demokratyczną techniką optymalizacji roju cząsteczek zapewnia dwie wyraźne przewagi nad standardową PSO i GSA, a mianowicie lepszą zdolność do ucieczki od lokalnej optymalności i szybszy współczynnik konwergencji. Całe sformułowanie dla optymalnego projektu kosztów ramy obejmuje zarówno koszt belek i słupów. W tym podejściu, zmienne każdego elementu ramy konstrukcyjnej zostały uznane za funkcje ciągłe i zaokrąglone odpowiednio do zastosowania praktycznego znaczenia niniejszego badania. Rozważono kilka przykładów, które podkreślają ważność optymalnej procedury projektowania, a wyniki porównano z wcześniejszymi badaniami, w celu sprawdzenia ich skuteczności i efektywności. Proponowany algorytm pokonuje ograniczenia dwóch indywidualnych algorytmów, biorąc pod uwagę ich hybrydę, a tym samym poprawia ogólną wydajność. Wprowadzono niezbędne zmiany, aby badanie było zgodne z wcześniejszymi badaniami. Porównanie z innymi wcześniej stosowanymi technikami hybrydowymi pokazuje, że czas potrzebny na przeprowadzenie procesu optymalizacji w niniejszym badaniu – z wykorzystaniem techniki MPSOGSA – został znacznie zmniejszony. Ponadto, podczas projektowania ram RC obniżono całkowity koszt za pomocą techniki MPSOGSA. Obniżenie kosztów w obszarze stali odgrywa większą rolę w optymalizacji, w porównaniu do redukcji kosztów w przekroju poprzecznym elementów ramy, co zostało szczegółowo przeanalizowane na przykładzie.
    Źródło:
    Archives of Civil Engineering; 2017, 63, 4; 123-134
    1230-2945
    Pojawia się w:
    Archives of Civil Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An Adaptation of an Algorithm of Search and Rescue Operations to Ship Manoeuvrability
    Autorzy:
    Kasyk, L.
    Pleskacz, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/116946.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    search and rescue (SAR)
    Ship Manoeuvrability
    Algorithm
    Search and Rescue Operations
    Hydrometeorological Conditions
    IAMSAR
    SAR Action Algorithm
    ECDIS
    Opis:
    This article presents an overview of an algorithm to facilitate action when planning search and rescue operations, taking into account actual hydro-meteorological conditions and the maneuverability of ships involved in the search.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 2; 265-268
    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ł:
    Tabu Search and genetic algorithm for production process scheduling problem
    Tabu Search i algorytmy genetyczne w harmonogramowaniu procesów produkcyjnych
    Autorzy:
    Burduk, Anna
    Musiał, Kamil
    Kochańska, Joanna
    Górnicka, Dagmara
    Stetsenko, Anastasia
    Powiązania:
    https://bibliotekanauki.pl/articles/361796.pdf
    Data publikacji:
    2019
    Wydawca:
    Wyższa Szkoła Logistyki
    Tematy:
    production process scheduling
    Tabu Search
    genetic algorithm
    heuristic methods
    intelligent methods
    manufacturing
    harmonogramowanie procesów produkcyjnych
    algorytm genetyczny
    metody heurystyczne
    metody inteligentne
    wytwarzanie
    Opis:
    Background: The paper deals with production process scheduling problem. In large companies, the decision-making process about operators' work, machines availability and production flow is a very difficult task, which is often being done by employees. Thus, not always the decision made is optimal in terms of cost, production time, etc. Methods: As a solution, two intelligent methods: Tabu Search and the genetic algorithm have been analyzed in field of production scheduling. The aim of this work was to examine the possibility of improving presented decision-making process that is being performed when scheduling, using Tabu Search and genetic algorithms. As a result of experimental research, it has been confirmed that the use of appropriately selected and parameterized intelligent methods allows for the optimization of the analyzed production process due to its duration. The research was case of study performed in cooperation with company that produces components for automotive industry. Results: Basing on collected and analyzed data, considered methods can be more or less successfully used in production process scheduling. Comparing both used algorithms, Tabu Search twice proposed worse solutions, the average operational time was 1.63% shorter than the actual one. In this case, better results were reached by using genetic algorithm - potential operational time was always shorter than the actual one, and it was reduced by 6.3% in total on average. Conclusion: Using algorithms allowed to achieve lower workload of employees and to reduce of operational time, which were the evaluation criteria in performed research. Managers of the analyzed company were pleased with the proposed solution and declared interest in developing these methods for future. This shows that intelligent methods can find, in relatively short time, the solution that is close to the optimal and acceptable from the problem point of view.
    Wstęp: Artykuł opisuje problem harmonogramowania procesów produkcyjnych. W dużych przedsiębiorstwach proces podejmowania decyzji dotyczących pracy operatorów, maszyn, dostępności zasobów i przepływu produkcji jest bardzo złożonym zadaniem, często wykonywanym przez pracowników. W związku z tym podjęte decyzje nie zawsze są optymalne w kontekście kosztów, czasu produkcji itp. Metody: Jako rozwiązanie, przeanalizowane zostało użycie, w obszarze harmonogramowania produkcji, dwóch metod inteligentnych: Tabu Search i algorytmów genetycznych. Celem pracy było zbadanie możliwości doskonalenia procesu podejmowania decyzji, który jest wykonywany przy harmonogramowaniu produkcji, przy pomocy Tabu Search i algorytmów genetycznych. Jako wynik eksperymentu przeprowadzonego podczas badań, potwierdzono, że użycie odpowiednio wybranych oraz sparametryzowanych metod inteligentnych pozwala na optymalizację analizowanego procesu produkcji. Badania zostały wykonane we współpracy z przedsiębiorstwem zajmującym się produkcją komponentów dla branży motoryzacyjnej, jako studium przypadku. Wyniki: Zgodnie z zebranymi i przeanalizowanymi danymi, wybrane metody mogą być z mniejszym bądź większym powodzeniem stosowane w procesie harmonogramowania produkcji. Porównując zastosowane algorytmy, Tabu Search dwukrotnie zaproponował rozwiązanie gorsze od aktualnego podejścia przedsiębiorstwa, jednak czas produkcji został skrócony średnio o 1.63%. W tym przypadku, lepsze wyniki pozwoliło osiągnąć zastosowanie algorytmu genetycznego - potencjalny czas produkcji był zawsze krótszy od aktualnie stosowanego rozwiązania, a średni czas produkcji został zredukowany o 6.3%. Wnioski: Zastosowanie algorytmów pozwoliło na osiągnięcie niższego obciążenia pracą operatorów oraz zredukowanie czasu operacyjnego, co stanowiło kryteria oceny w przeprowadzonych badaniach. Kierownictwo analizowanego przedsiębiorstwa było zadowolone z zaproponowanych rozwiązań. Zdecydowali się na stosowanie omawianych metod w codziennym harmonogramowaniu produkcji oraz zadeklarowali zainteresowanie rozwojem stosowania metod w przyszłości. Metody inteligentne pozwalają znaleźć, w relatywnie krótkim czasie, rozwiązanie bliskie optymalnemu i akceptowalne z punktu widzenia analizowanego problemu.
    Źródło:
    LogForum; 2019, 15, 2; 181-189
    1734-459X
    Pojawia się w:
    LogForum
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Lung cancer detection using an integration of fuzzy K-Means clustering and deep learning techniques for CT lung images
    Autorzy:
    Prasad, J. Maruthi Nagendra
    Chakravarty, S.
    Krishna, M. Vamsi
    Powiązania:
    https://bibliotekanauki.pl/articles/2173683.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    fuzzy K-means
    artificial neural networks
    SVM
    support vector machine
    crow search optimization algorithm
    algorytm rozmytych k-średnich
    sztuczne sieci neuronowe
    maszyna wektorów wspierających
    algorytm optymalizacji wyszukiwania kruków
    Opis:
    Computer aided detection systems are used for the provision of second opinion during lung cancer diagnosis. For early-stage detection and treatment false positive reduction stage also plays a vital role. The main motive of this research is to propose a method for lung cancer segmentation. In recent years, lung cancer detection and segmentation of tumors is considered one of the most important steps in the surgical planning and medication preparations. It is very difficult for the researchers to detect the tumor area from the CT (computed tomography) images. The proposed system segments lungs and classify the images into normal and abnormal and consists of two phases, The first phase will be made up of various stages like pre-processing, feature extraction, feature selection, classification and finally, segmentation of the tumor. Input CT image is sent through the pre-processing phase where noise removal will be taken care of and then texture features are extracted from the pre-processed image, and in the next stage features will be selected by making use of crow search optimization algorithm, later artificial neural network is used for the classification of the normal lung images from abnormal images. Finally, abnormal images will be processed through the fuzzy K-means algorithm for segmenting the tumors separately. In the second phase, SVM classifier is used for the reduction of false positives. The proposed system delivers accuracy of 96%, 100% specificity and sensitivity of 99% and it reduces false positives. Experimental results shows that the system outperforms many other systems in the literature in terms of sensitivity, specificity, and accuracy. There is a great tradeoff between effectiveness and efficiency and the proposed system also saves computation time. The work shows that the proposed system which is formed by the integration of fuzzy K-means clustering and deep learning technique is simple yet powerful and was effective in reducing false positives and segments tumors and perform classification and delivers better performance when compared to other strategies in the literature, and this system is giving accurate decision when compared to human doctor’s decision.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 3; art. no. e139006
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Solving scheduling problems with integrated online sustainability observation using heuristic optimization
    Autorzy:
    Burduk, Anna
    Musiał, Kamil
    Balashov, Artem
    Batako, Andre
    Safonyk, Andrii
    Powiązania:
    https://bibliotekanauki.pl/articles/2173719.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    production scheduling
    sustainable development
    genetic algorithm
    meta-heuristics
    intelligent optimization methods of production systems
    tabu search
    harmonogramowanie produkcji
    zrównoważony rozwój
    algorytm genetyczny
    przeszukiwanie tabu
    metaheurystyki
    inteligentne metody optymalizacji systemów produkcyjnych
    Opis:
    The paper deals with the issue of production scheduling for various types of employees in a large manufacturing company where the decision-making process was based on a human factor and the foreman’s know-how, which was error-prone. Modern production processes are getting more and more complex. A company that wants to be competitive on the market must consider many factors. Relying only on human factors is not efficient at all. The presented work has the objective of developing a new employee scheduling system that might be considered a particular case of the job shop problem from the set of the employee scheduling problems. The Neuro-Tabu Search algorithm and the data gathered by manufacturing sensors and process controls are used to remotely inspect machine condition and sustainability as well as for preventive maintenance. They were used to build production schedules. The construction of the Neuro-Tabu Search algorithm combines the Tabu Search algorithm, one of the most effective methods of constructing heuristic algorithms for scheduling problems, and a self-organizing neural network that further improves the prohibition mechanism of the Tabu Search algorithm. Additionally, in the paper, sustainability with the use of Industry 4.0 is considered. That would make it possible to minimize the costs of employees’ work and the cost of the overall production process. Solving the optimization problem offered by Neuro-Tabu Search algorithm and real-time data shows a new way of production management.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 6; art. no. e143830
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Design of Grover’s Algorithm over 2, 3 and 4- Qubit Systems in Quantum Programming Studio
    Autorzy:
    Diana, Jingle
    Shylu, Sam
    Mano, Mano
    Ananth, Jude
    Selvaraj, Daniel
    Powiązania:
    https://bibliotekanauki.pl/articles/2055247.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    quantum search
    Oracle
    Qubit
    Hadamard
    transform
    phase shift
    Opis:
    In this paper, we design and analyse the Circuit for Grover’s Quantum Search Algorithm on 2, 3 and 4-qubit systems, in terms of number of gates, representation of state vectors and measurement probability for the state vectors. We designed, examined and simulated the quantum circuit on IBM Q platform using Quantum Programming Studio. We present the theoretical implementation of the search algorithm on different qubit systems. We observe that our circuit design for 2 and 4-qubit systems are precise and do not introduce any error while experiencing a small error to our design of 3-qubit quantum system.
    Źródło:
    International Journal of Electronics and Telecommunications; 2022, 68, 1; 77--82
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    B-TREE algorithm complexity analysis to evaluate the feasibility of its application in the university course timetabling problem
    Autorzy:
    Cruz Chávez, M. A.
    Martínez Oropeza, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/91757.pdf
    Data publikacji:
    2013
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    B-TREE
    algorithm
    Binary Search Algorithms
    complexity analysis
    University Course Timetabling Problem
    UCTP
    Opis:
    This paper presents a comparative analysis of complexity between the B-TREE and the Binary Search Algorithms, both theoretically and experimentally, to evaluate their efficiency in finding overlap of classes for students and teachers in the University Course Timetabling Problem (UCTP). According to the theory, B-TREE Search complexity is lower than Binary Search. The performed experimental tests showed the B-TREE Search Algorithm is more efficient than Binary Search, but only using a dataset larger than 75 students per classroom.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 4; 251-263
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Algorithm 40. Search for marginal means at given factor levels in an n-way table containing data scores and all marginal means
    Algorytm 40. Wyszukiwanie średnich marginesowych na danych poziomach czynników
    Autorzy:
    Bartkowiak, Anna
    Powiązania:
    https://bibliotekanauki.pl/articles/742721.pdf
    Data publikacji:
    1975
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Źródło:
    Applicationes Mathematicae; 1974-1975, 14, 4; 655-662
    1233-7234
    Pojawia się w:
    Applicationes Mathematicae
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Problem-Independent Approach to Multiprocessor Dependent Task Scheduling
    Autorzy:
    Król, D.
    Zydek, D.
    Koszałka, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/226364.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    tasks scheduling
    DAG
    genetic algorithm
    tabu search
    makespan
    Opis:
    This paper concerns Directed Acyclic Graph task scheduling on parallel executors. The problem is solved using two new implementations of Tabu Search and genetic algorithm presented in the paper. A new approach to solution coding is also introduced and implemented in both metaheuristics algorithms. Results given by the algorithms are compared to those generated by greedy LPT and SS-FF algorithms; and HAR algorithm. The analysis of the obtained results of multistage simulation experiments confirms the conclusion that the proposed and implemented algorithms are characterized by very good performance and characteristics.
    Źródło:
    International Journal of Electronics and Telecommunications; 2012, 58, 4; 369-379
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A performance analysis of a hybrid golden section search methodology and a nature-inspired algorithm for MPPT in a solar PV system
    Autorzy:
    Mostafa, Hazem H.
    Ibrahim, Amr M.
    Anis, Wagdi R.
    Powiązania:
    https://bibliotekanauki.pl/articles/141645.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    hybrid optimization
    golden sections search
    multi-verse optimization algorithm
    maximum power point tracking
    perturb and observe
    photovoltaic (PV)
    Opis:
    This research presents a comparative study for maximum power point tracking (MPPT) methodologies for a photovoltaic (PV) system. A novel hybrid algorithm golden section search assisted perturb and observe (GSS-PO) is proposed to solve the problems of the conventional PO (CPO). The aim of this new methodology is to boost the efficiency of the CPO. The new algorithm has a very low convergence time and a very high efficiency. GSS-PO is compared with the intelligent nature-inspired multi-verse optimization (MVO) algorithm by a simulation validation. The simulation study reveals that the novel GSS- PO outperforms MVO under uniform irradiance conditions and under a sudden change in irradiance.
    Źródło:
    Archives of Electrical Engineering; 2019, 68, 3; 611-627
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Two meta-heuristic algorithms for scheduling on unrelated machines with the late work criterion
    Autorzy:
    Wang, Wen
    Chen, Xin
    Musial, Jędrzej
    Blazewicz, Jacek
    Powiązania:
    https://bibliotekanauki.pl/articles/330022.pdf
    Data publikacji:
    2020
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    late work minimization
    unrelated machines
    tabu search
    genetic algorithm
    minimalizacja opóźnienia
    przeszukiwanie tabu
    algorytm genetyczny
    Opis:
    A scheduling problem in considered on unrelated machines with the goal of total late work minimization, in which the late work of a job means the late units executed after its due date. Due to the NP-hardness of the problem, we propose two meta-heuristic algorithms to solve it, namely, a tabu search (TS) and a genetic algorithm (GA), both of which are equipped with the techniques of initialization, iteration, as well as termination. The performances of the designed algorithms are verified through computational experiments, where we show that the GA can produce better solutions but with a higher time consumption. Moreover, we also analyze the influence of problem parameters on the performances of these metaheuristics.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2020, 30, 3; 573-584
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Applying Hunger Game Search (HGS) for selecting significant blood indicators for early prediction of ICU COVID-19 severity
    Autorzy:
    Sayed, Safynaz AbdEl-Fattah
    ElKorany, Abeer
    Sayed, Sabah
    Powiązania:
    https://bibliotekanauki.pl/articles/27312915.pdf
    Data publikacji:
    2023
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    ICU severity prediction
    COVID-19
    clinical blood tests
    Hunger Game search
    HGS
    optimization algorithm
    support vector machine
    SVM
    feature selection
    Opis:
    This paper introduces an early prognostic model for attempting to predict the severity of patients for ICU admission and detect the most significant features that affect the prediction process using clinical blood data. The proposed model predicts ICU admission for high-severity patients during the first two hours of hospital admission, which would help assist clinicians in decision-making and enable the efficient use of hospital resources. The Hunger Game search (HGS) meta-heuristic algorithm and a support vector machine (SVM) have been integrated to build the proposed prediction model. Furthermore, these have been used for selecting the most informative features from blood test data. Experiments have shown that using HGS for selecting features with the SVM classifier achieved excellent results as compared with four other meta-heuristic algorithms. The model that used the features that were selected by the HGS algorithm accomplished the topmost results (98.6 and 96.5%) for the best and mean accuracy, respectively, as compared to using all of the features that were selected by other popular optimization algorithms.
    Źródło:
    Computer Science; 2023, 24 (1); 113--136
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Application of RRAP reliability optimization as a test of nature-inspired algorithms
    Autorzy:
    Pieprzycki, Adam
    Filipowicz, Bogusław
    Powiązania:
    https://bibliotekanauki.pl/articles/35533466.pdf
    Data publikacji:
    2024-02-15
    Wydawca:
    Akademia Tarnowska
    Tematy:
    reliability optimization
    RRAP
    Firefly Algorithm (FA)
    Cuckoo Search (CS)
    ANOVA
    Lévy flight
    Opis:
    This paper presents a discussion on the application of two swarm intelligence algorithms, Cuckoo Search (CS) and Firey Algorithm (FA), to maximize the reliability of two complex systems with resource constraints, which have been well-known in the literature. The reliability of the systems is also evaluated using several classical methods. The results indicate that although the CS algorithm, which utilizes Lévy flight, is eective, the FA rey algorithm outperformed it in the presented optimization tasks, within the given parameter range. These ndings contribute to the ongoing discussion on using nature-inspired algorithms for solving Reliability Redundancy Allocation Problem (RRAP) problems, and the two test scenarios used in the study can be useful for validating other algorithms in RRAP problems. The paper introduces metrics and methods for analyzing and comparing the performance of algorithms in RRAP optimization, including the comparison of criterion function values and other parameters introduced in the paper. Additionally, the paper discusses statistical analyses of variance (ANOVA) with post-hoc RIR Tuckey tests.
    Źródło:
    Science, Technology and Innovation; 2023, 18, 3-4; 1-14
    2544-9125
    Pojawia się w:
    Science, Technology and Innovation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Problem komiwojażera z zyskami i oknami czasowymi dla sieci o wagach zmiennych w czasie i jego zastosowania w systemach typu e-tourism
    Time Dependent Orienteering Problem with Time Windows and its use in systems of e-tourism
    Autorzy:
    Zabielski, P.
    Koszelew, J.
    Zimnoch, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/404117.pdf
    Data publikacji:
    2012
    Wydawca:
    Polskie Towarzystwo Symulacji Komputerowej
    Tematy:
    problem komiwojażera z zyskami i oknami czasowymi
    iteracyjny algorytm lokalnego wyszukiwania
    planer podróży
    algorytm ewolucyjny
    salesman problem with profits and time windows
    iterated local search
    planner of travel
    evolutionary algorithm
    Opis:
    W pracy przedstawiono problem komiwojażera z zyskami i oknami czasowymi dla sieci o wagach zmiennych w czasie. Jest to rozszerzenie standardowego problemu komiwojażera z zyskami. Przyczynia się to do bardziej praktycznego zastosowania go na przykład w systemach typu e-tourism. Dzięki dodatkowym ograniczeniom może stanowić prawdziwą pomoc podczas planowania ciekawych wycieczek, spełniających wszelkie preferencje użytkownika. W artykule zaproponowano algorytm wykorzystujący iteracyjne poszukiwanie lokalnych rozwiązań. Wykonano testy na realnych danych i przeanalizowano je pod względem czasu wykonywania oraz jakości otrzymanych wyników.
    This paper presents the Time Dependent Orienteering Problem with Time Windows. It is an extension of the standard traveling salesman problem with profits. This contributes to a more practical application of it, for example in systems of e-tourism. It can be a really helpful during planning trips and meet all your preferences and additional restrictions. The article proposes an algorithm that uses an iterative search for local solutions. This algorithm was tested on real data. After that we analyzed it in terms of execution time and quality results.
    Źródło:
    Symulacja w Badaniach i Rozwoju; 2012, 3, 3; 175-182
    2081-6154
    Pojawia się w:
    Symulacja w Badaniach i Rozwoju
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Falcon optimization algorithm for bayesian network structure learning
    Autorzy:
    Kareem, Shahab Wahhab
    Okur, Mehmet Cudi
    Powiązania:
    https://bibliotekanauki.pl/articles/2097968.pdf
    Data publikacji:
    2021
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    Bayesian network
    global search
    falcon optimization algorithm
    structure learning
    search and score
    Opis:
    In machine-learning, some of the helpful scientific models during the production of a structure of knowledge are Bayesian networks. They can draw the relationships of probabilistic dependency among many variables. The score and search method is a tool that is used as a strategy for learning the structure of a Bayesian network. The authors apply the falcon optimization algorithm (FOA) to the learning structure of a Bayesian network. This paper has employed reversing, deleting, moving, and inserting to obtain the FOA for approaching the optimal solution of a structure. Essentially, the falcon prey search strategy is used in the FOA algorithm. The result of the proposed technique is associated with pigeon-inspired optimization, greedy search, and simulated annealing that apply the BDeu score function. The authors have also examined the performances of the confusion matrix of these techniques by utilizing several benchmark data sets. As shown by the experimental evaluations, the proposed method has a more reliable performance than other algorithms (including the production of excellent scores and accuracy values).
    Źródło:
    Computer Science; 2021, 22 (4); 553--569
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evaluation of the PageRank algorithm effectiveness
    Autorzy:
    Worwa, K.
    Konopacki, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/94755.pdf
    Data publikacji:
    2013
    Wydawca:
    Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
    Tematy:
    search engine
    crawling
    Page rank algorithm
    wyszukiwarka
    algorytm Pagerank
    efektywność
    Opis:
    In this paper the challenges in building good search engines are discussed. Many of the search engines use well-known information retrieval algorithms and techniques. They use Web crawlers to maintain their index databases amortizing the cost of crawling and indexing over the millions of queries received by them. Web crawlers are programs that exploit the graph structure of the Web to move from page to page. Paper analyses the PageRank algorithm one of these Web crawlers. The results of the impact of the PageRank parameter value on the effectiveness of determining the so-called PageRank vector are considered in the paper. Investigations are illustrated by means of the results of a some simulation experiments to analyze the PageRank algorithm efficiency for different density graph (representing analyzed part of www) coefficient values.
    Źródło:
    Information Systems in Management; 2013, 2, 1; 73-84
    2084-5537
    2544-1728
    Pojawia się w:
    Information Systems in Management
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Bi-directional search in route planning in navigation
    Autorzy:
    Dramski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/360091.pdf
    Data publikacji:
    2014
    Wydawca:
    Akademia Morska w Szczecinie. Wydawnictwo AMSz
    Tematy:
    shortest path
    safe route
    restricted area
    bi-directional search
    Dijkstra algorithm
    Opis:
    The shortest path problem is one of the most significant ones in the field of maritime navigation. One of the most efficient algorithms was proposed by E. Dijkstra in 1959. Taking into account the development of computer technology was offered another interesting approach to the issue. The main idea is to execute the shortest path algorithm simultaneously forward from the source and backward from the target. The results are presented and discussed.
    Źródło:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2014, 39 (111); 57-62
    1733-8670
    2392-0378
    Pojawia się w:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary algorithm with a configurable search mechanism
    Autorzy:
    Łapa, Krystian
    Cpałka, Krzysztof
    Laskowski, Łukasz
    Cader, Andrzej
    Zeng, Zhigang
    Powiązania:
    https://bibliotekanauki.pl/articles/1837536.pdf
    Data publikacji:
    2020
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    evolutionary algorithm
    population-based algorithm
    optimization
    operator pool
    operator selection
    individual selection
    Opis:
    In this paper, we propose a new population-based evolutionary algorithm that automatically configures the used search mechanism during its operation, which consists in choosing for each individual of the population a single evolutionary operator from the pool. The pool of operators comes from various evolutionary algorithms. With this idea, a flexible balance between exploration and exploitation of the problem domain can be achieved. The approach proposed in this paper might offer an inspirational alternative in creating evolutionary algorithms and their modifications. Moreover, different strategies for mutating those parts of individuals that encode the used search operators are also taken into account. The effectiveness of the proposed algorithm has been tested using typical benchmarks used to test evolutionary algorithms.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 3; 151-171
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A strategy in sports betting with the nearest neighbours search and genetic algorithms
    Autorzy:
    Borycki, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/106184.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    sports betting
    nearest neighbour search
    genetic algorithm
    English Premier League
    Opis:
    The point of sports betting is not merely to correctly predict the outcome of a game, but to actually win on a bet. We propose a model of sports betting that uses the nearest neighbours search and genetic algorithms to do the job. It uses data on the teams playing, their respective formations, individual players, results of previous games, as well as odds offered by bookmakers. The model has been trained using the data from the seasons 2002/03 until 2008/09 of the English Premier League and tested against the already played games of the seasons 2009/10 and 2010/11.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2011, 11, 1; 7-13
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Short Introduction to Stochastic Optimization
    Autorzy:
    Ombach, Jerzy
    Powiązania:
    https://bibliotekanauki.pl/articles/1373633.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
    Tematy:
    global optimization
    stochastic algorithm
    random search
    convergence of metaheuristics
    Opis:
    We present some typical algorithms used for finding global minimum/ maximum of a function defined on a compact finite dimensional set, discuss commonly observed procedures for assessing and comparing the algorithms’ performance and quote theoretical results on convergence of a broad class of stochastic algorithms.
    Źródło:
    Schedae Informaticae; 2014, 23; 9-20
    0860-0295
    2083-8476
    Pojawia się w:
    Schedae Informaticae
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Improving the TSAB algorithm through parallel computing
    Autorzy:
    Rudy, Jarosław
    Pempera, Jaroslaw
    Smutnicki, Czesław
    Powiązania:
    https://bibliotekanauki.pl/articles/229535.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    job shop scheduling
    parallel computing
    operations research
    taboo search
    TSAB algorithm
    coarse-grained parallelization
    Opis:
    In this paper, a parallel multi-path variant of the well-known TSAB algorithm for the job shop scheduling problem is proposed. Coarse-grained parallelization method is employed, which allows for great scalability of the algorithm with accordance to Gustafon’s law. The resulting P-TSAB algorithm is tested using 162 well-known literature benchmarks. Results indicate that P-TSAB algorithm with a running time of one minute on a modern PC provides solutions comparable to the ones provided by the newest literature approaches to the job shop scheduling problem. Moreover, on average P-TSAB achieves two times smaller percentage relative deviation from the best known solutions than the standard variant of TSAB. The use of parallelization also relieves the user from having to fine-tune the algorithm. The P-TSAB algorithm can thus beused as module in real-life production planning systems or as a local search procedure in other algorithms. It can also provide the upper bound of minimal cycle time for certain problems of cyclic scheduling.
    Źródło:
    Archives of Control Sciences; 2020, 30, 3; 411-435
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Derivative free optimal thrust allocation in ship dynamic positioning based on direct search algorithms
    Autorzy:
    Valčić, M.
    Prpić-Oršić, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/116991.pdf
    Data publikacji:
    2020
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    algorithm
    dynamic positioning
    direct search algorithms
    sequential quadratic programing (SQP)
    Singular Values Decomposition (SVD)
    Lagrangian Multiplier Method (LMM)
    Direct Search (DS)
    Mesh Adaptive Direct Search (MADS)
    Opis:
    In dynamic positioning systems, nonlinear cost functions, as well as nonlinear equality and inequality constraints within optimal thrust allocation procedures cannot be handled directly by means of the solvers like industry-standardized quadratic programing (QP), at least not without appropriate linearization technique applied, which can be computationally very expensive. Thus, if optimization requirements are strict, and problem should be solved for nonlinear objective function with nonlinear equality and inequality constraints, than one should use some appropriate nonlinear optimization technique. The current state-of-the-art in nonlinear optimization for gradient-based algorithms is surely the sequential quadratic programing (SQP), both for general applications and specific thrust allocation problems. On the other hand, in recent time, one can also notice the increased applications of gradient-free optimization methods in various engineering problems. In this context, the implementation of selected derivative free direct search algorithms in optimal thrust allocation is proposed and discussed in this paper, and avenues for future research are provided.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2020, 14, 2; 309-314
    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ł:
    Decision support systems in search, rescue and salvage operations at sea
    Autorzy:
    Małyszko, M.
    Wielgosz, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/135080.pdf
    Data publikacji:
    2016
    Wydawca:
    Akademia Morska w Szczecinie. Wydawnictwo AMSz
    Tematy:
    decision support
    search and rescue
    salvage operations
    environment protection
    working procedures
    simplified algorithm
    Opis:
    This article presents the concept of a decision support system for maritime search, rescue and salvage operations. It describes the main ideas for systems in three areas of maritime rescue – search and rescue (saving lives), salvage (saving property at sea), and environment protection operations. It contains an analysis of the factors influencing the decisions of both marine navigators and shore-based centres. The general ideas of the systems are presented in the form of flow charts. An analysis was made of input data, working procedures, and the decisions based on these data and procedures. The simplified algorithm of the system is described. The principles of system utilisation are explained, developmental trends are described, and conclusions are drawn.
    Źródło:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 45 (117); 191-195
    1733-8670
    2392-0378
    Pojawia się w:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Automatic search of rational self-equivalences
    Autorzy:
    Stępień, L.
    Stępień, M. R.
    Powiązania:
    https://bibliotekanauki.pl/articles/950276.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
    Tematy:
    rational self-equivalences
    automorphisms of Witt rings
    Witt rings
    algebra
    algorithm
    automatic search
    automorfizm
    pierścień Witta
    algorytm
    Opis:
    Two Witt rings that are not strongly isomorphic (i.e., two Witt rings over two fields that are not Witt equivalent) have different groups of strong automorphisms. Therefore, the description of a group of strong automorphisms is different for almost every Witt ring, which requires the use various tools in proofs. It is natural idea to use computers to generate strong automorphisms of the Witt rings, which is especially effective in the case of the finitely generated Witt rings, where a complete list of strong automorphisms can be created. In this paper we present the algorithm that was used to generate strong automorphisms from the infinite group of strong automorphisms of the Witt ring of rational numbers W(Q).
    Źródło:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2018, 23; 67-74
    2450-9302
    Pojawia się w:
    Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of linear functions on a cyclic permutation. Based on the random search
    Autorzy:
    Grebennik, I.
    Baranov, O.
    Chorna, A.
    Gorbacheva, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/411110.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Oddział w Lublinie PAN
    Tematy:
    combinatorial optimization
    linear function
    cyclic permutations
    random search
    branch and bound algorithm
    parallel computing
    Opis:
    For creating adequate mathematical models of combinatorial problems of constructing optimal cyclic routes, mathematical modeling and solving a number of planning and control tasks solutions of optimization problems on the set of cyclic permutations are required. Review of the publications on combinatorial optimization demonstrates that the optimization problem on the cyclic permutations have not been studied sufficiently. This paper is devoted to solving optimization problem of a linear function with linear constraints on the set of cyclic permutations. For solving problems of this class using of known methods, taking into account the properties of a combinatorial set of cyclic permutations, is proposed. For this purpose we propose a method based on the ideology of random search. Heuristic method based on the strategy of the branch and bound algorithm is proposed to solve auxiliary optimization problem of a linear function without constraints on the set of cyclic permutations. Since application of the branch and bound algorithm immediately leads to an exponential growth of the complexity with increasing the dimension of the problem a number of modifications are suggested. Modifications allow reducing computational expenses for solving higher dimension problems. The effectiveness of the proposed improvements is demonstrated by computational experiments.
    Źródło:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2016, 5, 3; 211-216
    2084-5715
    Pojawia się w:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Research on optimization of unrelated parallel machine scheduling based on IG-TS algorithm
    Autorzy:
    Chi, Xinfu
    Liu, Shijing
    Li, Ce
    Powiązania:
    https://bibliotekanauki.pl/articles/2173693.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    warp knitting machine
    parallel machine scheduling
    iterative greedy algorithm
    tabu search
    osnowarka
    planowanie maszyn równoległych
    algorytm zachłanny iteracyjny
    przeszukiwanie tabu
    Opis:
    This issue is a typical NP-hard problem for an unrelated parallel machine scheduling problem with makespan minimization as the goal and no sequence-related preparation time. Based on the idea of tabu search (TS), this paper improves the iterative greedy algorithm (IG) and proposes an IG-TS algorithm with deconstruction, reconstruction, and neighborhood search operations as the main optimization process. This algorithm has the characteristics of the strong capability of global search and fast speed of convergence. The warp knitting workshop scheduling problem in the textile industry, which has the complex characteristics of a large scale, nonlinearity, uncertainty, and strong coupling, is a typical unrelated parallel machine scheduling problem. The IG-TS algorithm is applied to solve it, and three commonly used scheduling algorithms are set as a comparison, namely the GA-TS algorithm, ABC-TS algorithm, and PSO-TS algorithm. The outcome shows that the scheduling results of the IG-TS algorithm have the shortest manufacturing time and good robustness. In addition, the production comparison between the IG-TS algorithm scheduling scheme and the artificial experience scheduling scheme for the small-scale example problem shows that the IG-TS algorithm scheduling is slightly superior to the artificial experience scheduling in both planning and actual production. Experiments show that the IG-TS algorithm is feasible in warp knitting workshop scheduling problems, effectively realizing the reduction of energy and the increase in efficiency of a digital workshop in the textile industry.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141724
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Heuristic algorithms for joint optimization of unicast and anycast traffic in elastic optical network-based large-scale computing systems
    Autorzy:
    Markowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/330713.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    elastic optical network
    joint optimization
    distributed data center
    metaheuristic algorithm
    tabu search
    elastyczna sieć optyczna
    optymalizacja wspólna
    baza danych rozproszona
    algorytm heurystyczny
    metoda tabu search
    Opis:
    In recent years elastic optical networks have been perceived as a prospective choice for future optical networks due to better adjustment and utilization of optical resources than is the case with traditional wavelength division multiplexing networks. In the paper we investigate the elastic architecture as the communication network for distributed data centers. We address the problems of optimization of routing and spectrum assignment for large-scale computing systems based on an elastic optical architecture; particularly, we concentrate on anycast user to data center traffic optimization. We assume that computational resources of data centers are limited. For this offline problems we formulate the integer linear programming model and propose a few heuristics, including a meta-heuristic algorithm based on a tabu search method. We report computational results, presenting the quality of approximate solutions and efficiency of the proposed heuristics, and we also analyze and compare some data center allocation scenarios.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 605-622
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Automatic parametric fault detection in complex analog systems based on a method of minimum node selection
    Autorzy:
    Bilski, A.
    Wojciechowski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/330761.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    complex analog system
    support vector machine (SVM)
    tabu search
    genetic algorithm
    parametric fault detection
    system analogowy
    maszyna wektorów wspierających
    metoda tabu search
    algorytm genetyczny
    detekcja uszkodzeń
    Opis:
    The aim of this paper is to introduce a strategy to find a minimal set of test nodes for diagnostics of complex analog systems with single parametric faults using the support vector machine (SVM) classifier as a fault locator. The results of diagnostics of a video amplifier and a low-pass filter using tabu search along with genetic algorithms (GAs) as node selectors in conjunction with the SVM fault classifier are presented. General principles of the diagnostic procedure are first introduced, and then the proposed approach is discussed in detail. Diagnostic results confirm the usefulness of the method and its computational requirements. Conclusions on its wider applicability are provided as well.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 655-668
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Hybrid MPPT algorithm for PV systems under partially shaded conditions using a stochastic evolutionary search and a deterministic hill climbing
    Autorzy:
    Basiński, K.
    Ufnalski, B.
    Grzesiak, L. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/1193446.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    maximum power point tracking
    photovoltaic system
    hybrid part-stochastic part-deterministic search rule
    particle swarm optimization (PSO)
    partial shading
    hill climbing
    Opis:
    A hybrid maximum power point tracking method has been proposed for the photovoltaic system using a stochastic evolutionary search and a deterministic hill climbing algorithm. The proposed approach employs the particle swarm optimizer (PSO) to solve a dynamic optimization problem related to the control task in a PV system. The position of the best particle is updated by the hill climbing algorithm, and the position of the rest of the particles by the classic PSO rule. The presented method uses the re-randomization mechanism, which places five consecutive particles randomly, but in specified intervals. This mechanism helps track the maximum power point under partially shaded conditions.
    Źródło:
    Power Electronics and Drives; 2017, 2, 37/2; 49-59
    2451-0262
    2543-4292
    Pojawia się w:
    Power Electronics and Drives
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Znajdowanie najkrótszej drogi z wykorzystaniem algorytmów mrówkowych
    The Shortest Route Search with Ant Algorithms
    Autorzy:
    Świątnicki, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/312339.pdf
    Data publikacji:
    2018
    Wydawca:
    Instytut Naukowo-Wydawniczy "SPATIUM"
    Tematy:
    optymalizacja długości drogi
    algorytm mrówkowy
    heurystyka
    logistyka
    transport
    road length optimization
    ant algorithm
    heuristics
    logistics
    Opis:
    Praca poświęcona jest problemowi znajdowania najkrótszej drogi w grafie poszukiwań. Zastosowano do tego celu algorytmy mrówkowe. Zbudowano model optymalizacyjny. Wybrano 8 różnych algorytmów mrówkowych. Przedstawiono i omówiono uzyskane wyniki optymalizacji długości drogi.
    The presented research results indicate the usefulness of ant algorithms in the optimization of the road length. Admittedly, ant algorithms do not guarantee an optimal solution, but they provide a suboptimal (rational) solution. In a situation where we have limited time to solve the optimization problem, the guarantee of terminating the algorithm and obtaining a rational, acceptable solution is an attractive alternative for conducting long-term calculations and finding a little better solution.
    Źródło:
    Autobusy : technika, eksploatacja, systemy transportowe; 2018, 19, 12; 998-1001
    1509-5878
    2450-7725
    Pojawia się w:
    Autobusy : technika, eksploatacja, systemy transportowe
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Minimizing the Makespan and Total Tardiness in Hybrid Flow Shop Scheduling with Sequence-Dependent Setup Times
    Autorzy:
    Mousavi, Seyyed Mostafa
    Shahnazari-Shahrezaei, Parisa
    Powiązania:
    https://bibliotekanauki.pl/articles/2201180.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    dispatching rule
    genetic algorithm
    hybrid flow shop
    neighborhood search structure
    Opis:
    The paper considers the production scheduling problem in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimizing both the makespan and the total tardiness. The multi-objective genetic algorithm is applied to solve this problem, which belongs to the non-deterministic polynomial-time (NP)-hard class. In the structure of the proposed algorithm, the initial population, neighborhood search structures and dispatching rules are studied to achieve more efficient solutions. The performance of the proposed algorithm compared to the efficient algorithm available in literature (known as NSGA-II) is expressed in terms of the data envelopment analysis method. The computational results confirm that the set of efficient solutions of the proposed algorithm is more efficient than the other algorithm.
    Źródło:
    Management and Production Engineering Review; 2023, 14, 1; 13--24
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Short-term load prediction model combining FEW and IHS algorithm
    Autorzy:
    Yu, Mingxing
    Zhu, Jiazheng
    Yang, Li
    Powiązania:
    https://bibliotekanauki.pl/articles/141740.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    evaluation criteria
    exponential fuzzy time series
    fitness function
    improved harmony search algorithms
    load forecasting
    optimal interval length
    Opis:
    :Accurate prediction of power load plays a crucial role in the power industry and provides economic operation decisions for the power operation department. Due to the unpredictability and periodicity of power load, an improved method to deal with complex nonlinear relation was adopted, and a short-term load forecasting model combining FEW (fuzzy exponential weighting) and IHS (improved harmonic search) algorithms was proposed. Firstly, the domain space was defined, the harmony memory base was initialized, and the fuzzy logic relation was identified. Then the optimal interval length was calculated using the training sample data, and local and global optimum were updated by optimization criteria and judging criteria. Finally, the optimized parameters obtained by an IHS algorithm were applied to the FEW model and the load data of the Huludao region (2013) in Northeast China in May. The accuracy of the proposed model was verified using an evaluation criterion as the fitness function. The results of error analysis show that the model can effectively predict short-term power load data and has high stability and accuracy, which provides a reference for application of short-term prediction in other industrial fields.
    Źródło:
    Archives of Electrical Engineering; 2019, 68, 4; 907-923
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A New Algorithm for Phased Array Radar Search Function Improvement in Overload Situations
    Autorzy:
    Fatemi Mofrad, R. F.
    Sadeghzadeh, R. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/226581.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    phased array radar
    radar resource allocation
    radar modeling
    radar simulation
    radar performance evaluation
    Opis:
    A new algorithm is proposed for phased array radar search function resource allocation. The proposed algorithm adaptively priorities radar search regions and in overload situations, based on available resources, radar characteristics, maximum range and search regions, optimally allocates radar resources in order to maximize probability of detection. The performance of new algorithm is evaluated by the multifunction phased array radar simulation test bed. This simulation test bed provides capability to design and evaluate the performance of different radar resource management, target tracking and beam forming algorithms. Some results are presented that show capabilities of this simulation software for multifunction radar algorithms design and performance evaluation.
    Źródło:
    International Journal of Electronics and Telecommunications; 2011, 57, 1; 55-63
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An algorithm for garbage truck routing in cities with a fixation on container filling level
    Autorzy:
    Oliskevych, Myroslav
    Danchuk, Victor
    Powiązania:
    https://bibliotekanauki.pl/articles/27314061.pdf
    Data publikacji:
    2023
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    routing
    lexical search
    garbage collection
    capacity limitation
    trasowanie
    wyszukiwanie leksykalne
    zbieranie śmieci
    ograniczenie pojemności
    Opis:
    An algorithm for optimizing the routes of a set of vehicles used for the collection and removal of municipal solid waste in a metropolis is proposed. The algorithm eliminates the problem of applying heuristic methods for multi-agent optimization, which is NP non-deterministic polynomial-time-hard. The application of the algorithm leads to a guaranteed exact solution. Through the application of restrictions on the carrying capacity of vehicles, the size of the input matrix representing the transport network can be reduced to an adequate size. This process uses statistical information about the filling levels of container waste bins. The algorithm is applied to an example of two megacities. The shortest routes are built for different numbers of points (from 12 to 72) on the route. The dependence of the total mileage on the number of involved vehicles is studied.
    Źródło:
    Transport Problems; 2023, 18, 1; 75--87
    1896-0596
    2300-861X
    Pojawia się w:
    Transport Problems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Poszukiwanie optymalnej struktury sieci transportowej przy wykorzystaniu równoległego algorytmu genetycznego
    Search for the optimal structure of transportation network using parallel genetic algorithm
    Autorzy:
    Król, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/270524.pdf
    Data publikacji:
    2011
    Wydawca:
    Centralny Ośrodek Badawczo-Rozwojowy Aparatury Badawczej i Dydaktycznej, COBRABiD
    Tematy:
    sieci transportowe
    transport
    optymalizacja
    algorytm genetyczny
    transportation system
    genetic algorithms
    Opis:
    Aktualna struktura sieci transportowej jest skutkiem długotrwałych procesów w przeszłości i jest bardzo prawdopodobne, że nie jest ona optymalna dla obecnych i przewidywanych potrzeb. Gdy wymagana jest modernizacja lub rozbudowa sieci transportowej z reguły rozpatruje się kilka konkurencyjnych projektów, natomiast struktura rozwiązania optymalnego nie jest znana. Wynika stąd potrzeba opracowania metody znajdującej optymalną sieć transportową przy danych założeniach. Dane wejściowe dla tego problemu nie mogą być zadane w postaci analitycznej, naturalne jest zatem zaproponowanie algorytmu genetycznego jako narzędzia optymalizacyjnego. Charakterystyczną właściwością algorytmu genetycznego jest niezależne wykonywanie obliczeń dla wielu podobnych do siebie obiektów, więc wprowadzenie przetwarzania równoległego istotnie zmniejsza czas potrzebny do otrzymania rozwiązania.
    The current transportation network structure is usually a result of historically long adaptation process and probably it is not optimal for present and future transportation needs. When a modernisation or expansion is required only a few competing designs are evaluated, but the structure of the optimal solution remains unknown. So, there is a need of introduction of a method searching for optimal transportation network structure. The input data for the optimisation problem cannot be entered in analytical form, so it is natural to propose a genetic algorithm for performing the task. A specific feature of genetic algorithm is independent executing of calculations for many similar objects, so introducing of parallel processing significantly reduces the time needed.
    Źródło:
    Aparatura Badawcza i Dydaktyczna; 2011, 16, 1; 49-56
    2392-1765
    Pojawia się w:
    Aparatura Badawcza i Dydaktyczna
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A metaheuristic for a numerical approximation to the mass transfer problem
    Autorzy:
    Avendaño-Garrido, M. L.
    Gabriel-Argüelles, J. R.
    Quintana-Torres, L.
    Mezura-Montes, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/329972.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    Monge–Kantorovich mass transfer problem
    finite dimensional linear programming
    transport problem
    metaheuristic algorithm
    scatter search
    programowanie skończenie wymiarowe
    zadanie transportowe
    algorytm metaheurystyczny
    Opis:
    This work presents an improvement of the approximation scheme for the Monge–Kantorovich (MK) mass transfer problem on compact spaces, which is studied by Gabriel et al. (2010), whose scheme discretizes the MK problem, reduced to solve a sequence of finite transport problems. The improvement presented in this work uses a metaheuristic algorithm inspired by scatter search in order to reduce the dimensionality of each transport problem. The new scheme solves a sequence of linear programming problems similar to the transport ones but with a lower dimension. The proposed metaheuristic is supported by a convergence theorem. Finally, examples with an exact solution are used to illustrate the performance of our proposal.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 757-766
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Obraz weganizmu i wegetarianizmu w serwisie YouTube z perspektywy nauk o mediach
    The image of veganism and vegetarianism on YouTube from the perspective of media studies
    Autorzy:
    Cyrek, Barbara
    Powiązania:
    https://bibliotekanauki.pl/articles/1835960.pdf
    Data publikacji:
    2021-06-16
    Wydawca:
    Uniwersytet Gdański. Wydawnictwo Uniwersytetu Gdańskiego
    Tematy:
    media społecznościowe
    serwisy społecznościowe
    wyszukiwarka
    analiza
    materiałów wideo
    algorytm YouTube
    social media
    social networking sites
    search engine
    video materials analysis
    YouTube algorithm
    Opis:
    Celem artykułu jest charakterystyka obrazu weganizmu i wegetarianizmu wyłaniającego się z najpopularniejszych filmów podejmujących te zagadnienia, opublikowanych w polskiej wersji serwisu YouTube, a także wskazanie roli wyszukiwarki w kreowaniu tego obrazu. Analizie poddano wielogodzinny materiał wideo, na który składa się kilkadziesiąt filmów proponowanych przez serwis YouTube w wynikach wyszukiwania dla haseł „weganizm”, „dieta wegańska”, „wegetarianizm” oraz „dieta wegetariańska”.
    The aim of the article is to characterize the image of veganism and vegetarianism emerging from the most popular videos dealing with these issues, published on the Polish version of YouTube, as well as to indicate the role of the search engine in creating this image. The analysis covered a multi-hour video material, which consists of several dozen films suggested by YouTube in the search results for the slogans “veganism”, “vegan diet”, “vegetarianism” and “vegetarian diet”.
    Źródło:
    Media Biznes Kultura; 2021, 1(10); 143-157
    2451-1986
    2544-2554
    Pojawia się w:
    Media Biznes Kultura
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-88 z 88

      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