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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    A method of loading unit formation taking into account mass, load-bearing strength and surfaces of packing units
    Autorzy:
    Popiela, K.
    Wasiak, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/198370.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    loading unit
    heuristic algorithm
    load-bearing strength
    packing unit
    jednostka ładunkowa
    algorytm heurystyczny
    wytrzymałość na obciążenie
    jednostka pakująca
    Opis:
    The problem of loading unit formation is computationally complex in nature. This article presents a heuristic algorithm of forming unit loads, which can be applied to unit load arrangement on unit load devices. This method accounts for dimensional, mass and load-bearing strength of loading units and loading devices. Moreover, the rotation of packages about a 90° vertical axis has been made possible. In this algorithm, the bearing surface of each packing unit is entirely supported. This guarantees the stability of additional unit load layers. A sample calculation of the arrangement of 30-unit loads is presented in this article.
    Źródło:
    Zeszyty Naukowe. Transport / Politechnika Śląska; 2017, 96; 151-160
    0209-3324
    2450-1549
    Pojawia się w:
    Zeszyty Naukowe. Transport / Politechnika Śląska
    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ł:
    Risk management in the allocation of vehicles to tasks in transport companies using a heuristic algorithm
    Autorzy:
    Izdebski, Mariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/27311808.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    transport companies
    allocation of vehicles
    organization of transport
    risk management
    heuristic algorithm
    ant algorithm
    optimization
    firmy transportowe
    przydział pojazdów
    organizacja transportu
    zarządzanie ryzykiem
    algorytm heurystyczny
    algorytm mrówkowy
    optymalizacja
    Opis:
    The work deals with the issue of assigning vehicles to tasks in transport companies, taking into account the minimization of the risk of dangerous events on the route of vehicles performing the assigned transport tasks. The proposed risk management procedure based on a heuristic algorithm reduces the risk to a minimum. The ant algorithm reduces it in the event of exceeding the limit, which differs from the classic methods of risk management, which are dedicated only to risk assessment. A decision model has been developed for risk management. The decision model considers the limitations typical of the classic model of assigning vehicles to tasks, e.g. window limits and additionally contains limitations on the acceptable risk on the route of vehicles' travel. The criterion function minimizes the probability of an accident occurring along the entire assignment route. The probability of the occurrence of dangerous events on the routes of vehicles was determined based on known theoretical distributions. The random variable of the distributions was defined as the moment of the vehicle's appearance at a given route point. Theoretical probability distributions were determined based on empirical data using the STATISTICA 13 package. The decision model takes into account such constraints as the time of task completion and limiting the acceptable risk. The criterion function minimizes the probability of dangerous events occurring in the routes of vehicles. The ant algorithm has been validated on accurate input data. The proposed ant algorithm was 95% effective in assessing the risk of adverse events in assigning vehicles to tasks. The algorithm was run 100 times. The designated routes were compared with the actual hours of the accident at the bottom of the measurement points. The graphical interpretation of the results is shown in the PTV Visum software. Verification of the algorithm confirmed its effectiveness. The work presents the process of building the algorithm along with its calibration.
    Źródło:
    Archives of Transport; 2023, 67, 3; 139--153
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
    Autorzy:
    Lopez-Loces, M. C.
    Musial, J.
    Pecero, J. E.
    Fraire-Huacuja, H. J.
    Blazewicz, J.
    Bouvry, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/330508.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    internet shopping optimization
    integer linear programming
    cellular processing algorithm
    heuristic algorithms
    optimization in e-commerce
    zakupy internetowe
    programowanie liniowe
    algorytm heurystyczny
    handel elektroniczny
    Opis:
    Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all the shops increases as well. In this paper we propose an integer linear programming (ILP) model and two heuristic solutions, the MinMin algorithm and the cellular processing algorithm, to tackle the Internet shopping optimization problem with delivery costs. The obtained results improve those achieved by the state-of-the-art heuristics, and for small real case scenarios ILP delivers exact solutions in a reasonable amount of time.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 391-406
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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ł
      Wyświetlanie 1-5 z 5

      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