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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Heuristic algorithms applied to the problems of servicing actors in supply chains
    Autorzy:
    Izdebski, M.
    Jacyna-Gołda, I.
    Markowska, K.
    Murawski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/224087.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    supply chain
    genetic algorithm
    ant algorithm
    łańcuchy dostaw
    algorytm genetyczny
    algorytm mrówkowy
    Opis:
    The paper discusses main decision problems analysed in the subject matter of servicing actors operating in the supply chains, i.e. the vehicle routing problem, vehicles-to-task assignment problem and the problem of entities’ localization in the supply chain. The input data used to describe supply chains is given as well as the basic constraints and the criterion functions used in the development of mathematical models describing the supply chains. Servicing actors in supply chains is the complex decision making problem. Operators in the supply chains are constrained by: production capacity of the suppliers, the demand of the customers in particular working days, storage capacities of warehouses, handling capacities of warehouses, suppliers’ and warehouses’ time windows and other. The efficiency of supply chain is described by cost of transport between operators, costs of passing cargoes through warehouses and delivery time to the recipient. The heuristic algorithms, like genetic and ant algorithms are detailed and used to identify issues related to the operation of actors operating in the supply chains are described. These algorithms are used for solving localization problems in supply chains, vehicle routing problems, and assignment problems. The complexity of presented issues (TSP is known as NP-hard problem) limits the use of precise algorithms and implies the need to use heuristic algorithms. It should be noted that solutions generated by these algorithms for complex decision instances are sub-optimal solutions, but nonetheless it is accepted from the practical point of view.
    Źródło:
    Archives of Transport; 2017, 44, 4; 25-34
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Use of Heuristic Algorithms to Optimize the Transport Issues on the Example of Municipal Services Companies
    Autorzy:
    Izdebski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/223579.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    municipal services companies
    transport
    optimization
    genetic algorithm
    ant algorithm
    usługi komunalne
    optymalizacja
    algorytm genetyczny
    Opis:
    In this article the main optimization problems in the municipal services companies were presented. These problems concern the issue of vehicle routing. The mathematical models of these problems were described. The function of criterion and the conditions on designating the vehicle routing were defined. In this paper the hybrid algorithm solving the presented problems was proposed. The hybrid algorithm consists of two heuristic algorithms: the ant and the genetic algorithm. In this paper the stages of constructing of the hybrid algorithm were presented. A structure of the data processed by the algorithm, a function of adaptation, a selection of chromosomes, a crossover, a mutation and an inversion were characterized. A structure of the data was presented as string of natural numbers. In selection process the roulette method was used and in the crossover process the operator PMX was presented. This algorithm was verified in programming language C #. The process of verification was divided into two stages. In the first stage the best parameters of the hybrid algorithm were designated. In the second stage the algorithm was started with these parameters and the result was compared with the random search algorithm. The random search algorithm generates 2000 routes and the best result is compared with the hybrid algorithm.
    Źródło:
    Archives of Transport; 2014, 29, 1; 27-36
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    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ł
      Wyświetlanie 1-3 z 3

      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