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" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    Tytuł:
    Application of Genetic Algorithms in Design of Public Transport Network
    Autorzy:
    Lesiak, Piotr
    Bojarczak, Piotr
    Powiązania:
    https://bibliotekanauki.pl/articles/504669.pdf
    Data publikacji:
    2015
    Wydawca:
    Międzynarodowa Wyższa Szkoła Logistyki i Transportu
    Tematy:
    genetic algorithms
    search methods
    optimization
    transportation problems
    Opis:
    The paper presents possibilities of application of genetic algorithms in design of public transport network. Transportation tasks such as determination of optimal routes and timetable for means of transport belong to difficult complex optimization problems, therefore they cannot be solved using traditional search algorithms. It turns out that genetic algorithms can be very useful to solve these transportation problem.
    Źródło:
    Logistics and Transport; 2015, 26, 2; 75-82
    1734-2015
    Pojawia się w:
    Logistics and Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Fundamentals of scatter search and path relinking
    Autorzy:
    Glover, F.
    Laguna, M.
    Marti, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/205907.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    optymalizacja
    evolutionary methods
    metaheuristics
    optimization
    tabu search
    Opis:
    The evolutionary approach called Scatter Search, and its generalized form called Path Relinking, have proved unusually effective for solving a diverse array of optimization problems from both classical and real world settings. Scatter Search and Path Relinking differ from other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions (in both Euclidean and neighborhood spaces) and by utilizing strategic designs where other approaches resort to randomization. Scatter Search and Path Relinking are also intimately related to the Tabu Search metaheuristic, and derive additional advantages by making use of adaptive memory and associated memory-exploiting mechanisms that are capable of being adapted to particular contexts. We describe the features of Scatter Search and Path Relinking that set them apart from other evolutionary approaches, and that offer opportunities for creating increasingly more versatile and effective methods in the future.
    Źródło:
    Control and Cybernetics; 2000, 29, 3; 653-684
    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ł:
    Improving the intensification and diversification balance of the tabu solution for the Robust Capacitated International Sourcing problem (RoCIS)
    Autorzy:
    Huacuja, H. J. F.
    González-Velarde, J. R.
    Valdez, G. C.
    Powiązania:
    https://bibliotekanauki.pl/articles/385145.pdf
    Data publikacji:
    2010
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    RoCis
    heuristic approach
    optimization
    initial solution
    tabu search
    memory strategies
    Opis:
    This paper addresses the robust capacitated international sourcing problem (RoCIS), which consists of selecting a subset of suppliers with finite capacity, from an available set of potential suppliers internationally located. This problem was introduced by González-Velarde and Laguna in [1], where they propose a deterministic solution method based on tabu search memory strategies. The pro cess consists of three steps: build an initial solution, create a neighborhood of promising solutions and perform a local search in the neighborhood. In this work we propose improving the construction of the initial solution, the cons truction of the neighborhood, the local search, and the intensification and diversification balance. Experimental evidence shows that the improved tabu solution with diver sification outperforms the best solutions reported for six of the instances considered, increases by 18% the number of best solutions found and reduces by 44% the deviation of the best solution found, respect to the best algorithm reported.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2010, 4, 4; 64-73
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    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ł:
    The Impact of perturbation mechanisms on the operation of the swap heuristic
    Autorzy:
    Misztal, Wojciech
    Powiązania:
    https://bibliotekanauki.pl/articles/263175.pdf
    Data publikacji:
    2019
    Wydawca:
    Sieć Badawcza Łukasiewicz. Przemysłowy Instytut Motoryzacji
    Tematy:
    optimization
    vehicle routing problem
    local search
    Swap (2-1)
    perturbation mechanisms
    Opis:
    In this study, an attempt was made to assess the impact of the most popular perturbation movements (i.e. Multiple-Swap(2-2), Multiple-Shift(2-2) and Multiple-K-Shift(1)), as well as the number of their calls on the quality of solutions and the time in which Swap(2-1) heuristics returns them. For this purpose, the iterative local search algorithm (ILS) was triggered, in which Swap(2-1) heuristics has cooperated with a single perturbation mechanism. The number of perturbations was changed in the range from 1 to 30. Each time the time and the difference between the percentage improvement of the objective function value of the solution obtained utilizing the Swap(2-1) algorithm cooperating with the perturbation mechanism and this algorithm working alone was checked. Based on the results obtained, it was found that the overall level of improvement in the quality of the returned solution is similar when using all of the considered perturbation mechanisms (is in the range of 2.49% to 4.02%). It has been observed that increasing the number of initiated perturbations does not guarantee an improvement in the quality of the returned solution. Perturbation movements similar to the motion initiated by the local search algorithm do not significantly improve the solution (they only entail extending the duration of action). The structure of the study has the following form. The Introduction chapter provides information on the Vehicle Routing Problem. The chapter Research methods contain a description of ILS and Swap(2-1) approaches and perturbation mechanisms considered. The last two chapters include the results of tests and conclusions.
    Źródło:
    Archiwum Motoryzacji; 2019, 86, 4; 27-39
    1234-754X
    2084-476X
    Pojawia się w:
    Archiwum Motoryzacji
    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ł:
    Website optimisation for search engines – concept of website profiling
    Autorzy:
    Król, Karol
    Zdonek, Dariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/1882943.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    optimization
    profiling
    website
    Internet search engine
    SEO audit
    optymalizacja
    profilowanie
    strona internetowa
    wyszukiwarka internetowa
    Opis:
    Purpose: The article presents the concept of profiling a website. Profiling is focused on the quality of the SEO (search engine optimization) audit and the conclusions that flow from it, and its goal is to increase the effectiveness of the review. The primary purpose of the work was to assess the accuracy of the characteristics prepared in this way. Design/methodology/approach: Four websites related to the hotel industry have been profiled and compiled in pairs, whose addresses were obtained from an Internet search engine. The tests were performed using selected testing tools. Findings: It has been shown that based on an analysis of SEO attributes, one can create a technological profile of a site without browsing it first, and the relevance of profiling is determined by two factors: the auditor’s experience and audit scope, including the quality and number of testing tools used. Practical implications: The idea of profiling involves looking at a website only through the prism of an SEO audit, which changes the perspective and forces a more in-depth analysis of SEO tests. This can contribute to better use of information obtained during an inspection. Profiling is often treated as an activity supplementing an SEO audit in the case of a lack of access to testing tools when the test results are incomplete, insufficient, or inaccessible. Originality/value: By analyzing SEO attributes, one can create a technology profile and a specific site characteristic without browsing it first. Two factors determine the relevance of profiling: the auditor’s experience and the quality and scope of the audit performed by the testing application.
    Źródło:
    Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska; 2020, 144; 287-298
    1641-3466
    Pojawia się w:
    Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Development of a method for finding the optimal solution when upgrading a motorcycle engine
    Autorzy:
    Vrublevskyi, Oleksandr
    Wojnowski, Radomir
    Powiązania:
    https://bibliotekanauki.pl/articles/298245.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Warmińsko-Mazurski w Olsztynie
    Tematy:
    spark ignition engine
    thermodynamic cycle simulations
    optimization
    design of experiments
    DoE
    Monte Carlo method
    Nonlinear Programming Quadratic Line search
    NLPQL
    Opis:
    This paper describes a method for finding the optimal parameters of a spark-ignition engine gas exchange system for a motorcycle. The vectors of the initial data for filling the parameter space, in which the search for the optimal solution has been made, have been formed through methods of experiment planning and technique nonlinear programming quadratic line search. As the quality criteria, the engine power has been used at selected points of the external speed characteristic. The results of the work have shown how using the proposed optimization method allows modernization of a gas exchange systems in order to increase the engine power.
    Źródło:
    Technical Sciences / University of Warmia and Mazury in Olsztyn; 2019, 22(2); 135-149
    1505-4675
    2083-4527
    Pojawia się w:
    Technical Sciences / University of Warmia and Mazury in Olsztyn
    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ł
      Wyświetlanie 1-10 z 10

      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