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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 36
Tytuł:
An idea of using genetic algorithm for solving the problem of river ports location
Koncepcja wykorzystania algorytmu genetycznego w rozwiązywaniu problemu lokalizacji portów rzecznych
Autorzy:
Iwan, S.
Powiązania:
https://bibliotekanauki.pl/articles/906952.pdf
Data publikacji:
2005
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
Inland Shipping
algorytmy genetyczne
optymalizacja
problem lokalizacji
zagadnienie transportowe
genetic algorithms
optimization
localization problem
transportation problem
Opis:
Genetic algorithms are a very interesting optimization method, which use the natural selection idea for the decision taking. These methods are usable for the solution taking in non-deterministic problems and with incomplete knowledge of the desision situation. River ports localisation seems to be an interesting optimization problem of inland shipping organizing. It is necessary to find the places for ports with the lowest cost of goods distribution center localization problem and balanced or non-balanced transportation problem. This paper is focused on the idea of using genetic algorithm for solving it.
Algorytmy genetyczne są bardzo interesującą metodą poszukiwania rozwiązań, w której w celu wyboru decyzji optymalnej wykorzystywana jest koncepcja doboru naturalnego. metoda ta jest przydatna do rozwiązywania problemów niederministycznych oraz w sytuacjach decyzyjnych, w których dysponuje się wiedzą niepełną. Problem lokalizacji portów rzecznych wydaje się być ciekawym problemem optymalizacyjnym z zakresu organizacji śródlądowego transportu wodnego. W problemie tym konieczne jest znalezienie takiego położenia dla portów, aby całkowity koszt dystrybucji dóbr do poszczególnych odbiorców był jak najmniejszy. Zagadnienie to można potraktować jako połączenie problemu lokalizacji centrum dystrybucji oraz zagadnienia transportowego. Opracowanie niniejsze skoncentrowane jest na przedstawieniu idei zastosowania algorytmu genetycznego dp rpzwiązywania tegoż problemu.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2005, 9 (81); 45-55
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simultaneous pickup and delivery model suggestion for personnel transportation in COVID-19 pandemic conditions
Autorzy:
Köse, Erkan
Kokmazer, Ahsen
Vural, Danışment
Gökceoğlu, Gökçe Gül
Şavlı, Pınar
Powiązania:
https://bibliotekanauki.pl/articles/29127991.pdf
Data publikacji:
2023
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
optimization
mathematical modeling
vehicle routing
simultaneous pickup problem
delivery problem
Opis:
The impact of COVID-19 on the transportation costs of a large-scale company has been examined. Before the pandemic, shift personnel were transported to the factory by shuttles, and after a quick shift change, other shift personnel were transported back to their homes. However, with the implementation of laws mandating the reduction of shuttle seat capacities, transportation costs have risen significantly. To address this issue, a new simultaneous pickup and delivery model is proposed as an alternative to the separate transportation of shift workers. The results of this study indicate that the proposed model provides a substantial advantage in terms of both the number of vehicles used and the total distance traveled, leading to a significant reduction in costs. This research underscores the importance of effective operations research practices for the profitability of companies, particularly in extraordinary circumstances such as the COVID-19 pandemic.
Źródło:
Operations Research and Decisions; 2023, 33, 4; 119--131
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Effectiveness of hybrid optimization methods in solving test problems and practical issues
Autorzy:
Twardochleb, Michał
Król, Tomasz
Włoch, Paweł
Kuka, Bartosz
Powiązania:
https://bibliotekanauki.pl/articles/431905.pdf
Data publikacji:
2013
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
hybrid
optimization
decision problem
Opis:
This paper shows the results of analyzing the effectiveness and efficiency of a hybrid approach against a variety of optimization problems. An application with a serial-optimization structure, consisting of several methods with different characteristics, is presented. In order to evaluate the initial effectiveness of the hybrid optimization method, a number of test tasks, represented by complex functions with many variables, were examined. Additionally, a real-life case, determining an optimal product variety in a supermarket environment, regarding the highest rate of return for given conditions and limitations, is presented as an instance of the practical use of a hybrid algorithm. The research shows that the results achieved by the hybrid- -optimization method are highly satisfactory, both in terms of efficiency as well as effectiveness.
Źródło:
Informatyka Ekonomiczna; 2013, 4(30); 279-289
1507-3858
Pojawia się w:
Informatyka Ekonomiczna
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach
Autorzy:
Bougloula, Aimade Eddine
Powiązania:
https://bibliotekanauki.pl/articles/24200517.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
scheduling
optimization
scheduling problem
job shop
no-wait problem
Jaya algorithm
Opis:
This work is interested to optimize the job shop scheduling problem with a no wait constraint. This constraint occurs when two consecutive operations in a job must be processed without any waiting time either on or between machines. The no wait job shop scheduling problem is a combinatorial optimization problem. Therefore, the study presented here is focused on solving this problem by proposing strategy for making Jaya algorithm applicable for handling optimization of this type of problems and to find processing sequence that minimizes the makespan (Cmax). Several benchmarks are used to analyze the performance of this algorithm compared to the best-known solutions.
Źródło:
Management and Production Engineering Review; 2023, 14, 3; 148--155
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of the position of the local distribution centre of the regional post logistics network
Autorzy:
Droździel, P.
Wińska, A.
Madleňák, R.
Szumski, P.
Powiązania:
https://bibliotekanauki.pl/articles/375506.pdf
Data publikacji:
2017
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
vehicle routing problem
postal network
optimization
p-median problem
sieć pocztowa
optymalizacja
Opis:
The phenomenon of the present postal services is the fact that, customers expect the lowest price while maintaining the availability, security and on time delivery of mail items. We can find that, the costs associated with transport of the postal substrate is one of the most important factors affecting the total cost of the postal services. These transport costs depend on various factors such as the investment in vehicles purchase, operational costs of the postal vehicles (costs of maintenance, repairs, fuel costs of the vehicle, etc.) labour costs of the drivers and so on. For this reason, it is important to find such an operational - organizational solutions that can reduce the costs associated with the transportation of postal shipments, resulting in reducing the total cost of postal services. One option to do this is to minimize the length of postal transportation routes. This article presents the approach based on the application of graph theory to optimize existing connections of postal logistics network. Published results is oriented to revaluate existing position of local centre and find a location for the new local distribution centre potentially. New location of local distribution centre can to optimize (minimize) the total transport costs of the local postal transportation network in area of the Lublin Province.
Źródło:
Transport Problems; 2017, 12, 3; 43-50
1896-0596
2300-861X
Pojawia się w:
Transport Problems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analiza probabilistyczna algorytmu dla stochastycznego problemu pakowania prostokątów
Autorzy:
Kurpisz, A.
Powiązania:
https://bibliotekanauki.pl/articles/1190070.pdf
Data publikacji:
2013
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
inżynieria produkcji
optymalizacja
Problem Pakowania Bloków
algorytm
production engineering
optimization
Rectangle Packing Problem
Opis:
W tej pracy rozważamy Problem Pakowania Bloków, który występuje w wielu gałęziach przemysłu, np. w projektowaniu układów scalonych, cięciu bloków kamiennych, przemyśle tekstylnym. Rozważamy zmodyfikowany problem, w którym wysokości i szerokości bloków są zadane jednostajnym, ciągłym rozkładem prawdopodobieństwa U(0,1). W tej pracy prezentujemy analizę probabilistyczną skuteczności algorytmu Prezentujemy również wyniki symulacji komputerowych i porównujmy je z wynikami teoretycznymi
Źródło:
Interdisciplinary Journal of Engineering Sciences; 2013, 1, 1; 24--27
2300-5874
Pojawia się w:
Interdisciplinary Journal of Engineering Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Aspects of the Application of Genetic Algorithm for Solving the Assignment Problem of Tasks to Resources in a Transport Company
Autorzy:
Izdebski, Mariusz
Jacyna, Marianna
Powiązania:
https://bibliotekanauki.pl/articles/504281.pdf
Data publikacji:
2014
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
assignment problem
genetic algorithm
optimization
Opis:
The article defines the assignment problem of tasks to resources in a transport company. The paper describes mathematical model of a transport system taking into account the assignment of vehicles to the tasks. It also provides stages of creation of the genetic algorithm for solving the assignment problem in the transport company.
Źródło:
Logistics and Transport; 2014, 21, 1; 13-20
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant algorithm for AP-N aimed at optimization of complex systems
Autorzy:
Mikulik, J.
Zajdel, M.
Powiązania:
https://bibliotekanauki.pl/articles/375987.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
assignment problem
ant algorithm
optimization
Opis:
Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.
Źródło:
Decision Making in Manufacturing and Services; 2010, 4, 1-2; 29-36
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Model to calculate the optimal mode of train locomotives turnover
Autorzy:
Kozlov, P.
Vakulenko, S.
Tushin, U.
Timukhina, E.
Powiązania:
https://bibliotekanauki.pl/articles/374643.pdf
Data publikacji:
2017
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
model
locomotive
train flow
optimization
transportation problem
lokomotywa
natężenie ruchu kolejowego
optymalizacja
problem transportowy
Opis:
A model to calculate the optimal work modes of train locomotives while serving train flows is proposed. The model is a further development of the dynamic transportation problem. Parameters of train movement and locomotive utilization are published. Both locomotive turnover and train schedules are produced. Useful utilization of locomotives increases from 70% to 90–95%. This allows the reduction of several thousands of train locomotives.
Źródło:
Transport Problems; 2017, 12, 3; 125-133
1896-0596
2300-861X
Pojawia się w:
Transport Problems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Metody oraz narzędzia wspierające optymalizację dystrybucji wyrobów o ograniczonej trwałości
Methods and tools supporting distribution optimization of products with limited shelf life
Autorzy:
Ponikierska, Agnieszka
Powiązania:
https://bibliotekanauki.pl/articles/1385444.pdf
Data publikacji:
2019
Wydawca:
Polskie Wydawnictwo Ekonomiczne
Tematy:
reengineering
Just in Time
optymalizacja
cross dock
problem komiwojażera
Solver
optimization
traveling salesman problem
Opis:
Zaprezentowane w artykule rozwiązanie jest dedykowane przedsiębiorstwom dystrybucyjnym, dla których priorytet stanowi szybka i sprawna dostawa towaru o krótkim terminie przydatności, bez utraty czy obniżenia jego jakości. Ta determinująca cecha oferowanych produktów sprawia, że optymalizacja funkcjonowania łańcucha dostaw, a w szczególności procesów dystrybucyjnych, wymaga przede wszystkim skrócenia czasu realizacji dostaw od producenta do finalnego odbiorcy. W rozwiązaniu zastosowano proste, a zarazem skuteczne metody optymalizacyjne w celu podniesienia efektywności tego procesu, oparte na systemie klasy Just in Time, przeładunku kompletacyjnym cross dock i metodzie komiwojażera. Efektem wprowadzonego rozwiązania jest znaczne skrócenie czasu realizacji zamówień, a co za tym idzie — wzrost zadowolenia klientów. Uzyskano także zmniejszenie zapotrzebowania ma powierzchnię magazynową, wyeliminowanie konieczności utrzymywania zapasów, optymalizację tras przewozu, co doprowadziło do znacznego obniżenia kosztów prowadzonej działalności i zwiększenie jej efektywności.
Solution presented in this article is dedicated to distribution companies, that prioritize fast and efficient supply of products with limited shelf life without losing or lowering their quality. This determining feature of offered products, makes shortening of delivery time from producent to customer the key of supply chain optimization. This solution uses simple and effective optimization methods that are able to make the whole process more effective. These methods are based on class system ‘Just in Time’, cross docking and canvasser method. Implementation of presented solution results both in shortening the time of execution of the order and growth of customers satisfaction. Reduction of storage space demand, elimination of necessity to hold reserves and optimization of cargo routes were also the results of presented solution. All these changes lowered expenses of the company and made it more effective.
Źródło:
Gospodarka Materiałowa i Logistyka; 2019, 4; 21-28
1231-2037
Pojawia się w:
Gospodarka Materiałowa i Logistyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decision support system in freight transport based on vehicle routing problem with quality criterion
Autorzy:
Szczepański, E.
Jachimowski, R.
Żak, J.
Powiązania:
https://bibliotekanauki.pl/articles/393872.pdf
Data publikacji:
2018
Wydawca:
Polskie Stowarzyszenie Telematyki Transportu
Tematy:
decision support systems
vehicle routing problem
VRP
optimization
system wspomagania decyzji
problem trasowania pojazdów
optymalizacja
Opis:
Deliveries planning in transport systems is a complicated task and require taking into account a wide range of factors. Enterprises wanting to propose solutions that meet the clients’ needs and be competitive on the market must prepare their offer based on decision support systems including factors characteristic for the real process. The aim of the article is to present a concept of a decision support system based on a multi-criteria vehicle routing problem in real conditions (Real-World VRP). Taking into account the latest trends in the optimization of the delivery plan, the model includes three criteria - the cost, time and success rate of the delivery plan as a criterion relating to the quality of the delivery plan. Among other assumptions, it should be pointed out that the heterogeneous structure of the rolling stock has been taken into account, the number of which is not limited, the vehicles return to the place of origin. The travel time of the connection and the time of loading operations are random variables. The limited driver’s work time and driving time were also applied. The effect of the work presented in the article is the concept of the decision support system in the freight transport, taking into account the quality criterion of the delivery plan.
Źródło:
Archives of Transport System Telematics; 2018, 11, 3; 49-56
1899-8208
Pojawia się w:
Archives of Transport System Telematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Assessment of options to meet transport needs using the MAJA multi-criteria method
Autorzy:
Małachowski, Jerzy
Ziółkowski, Jarosław
Oszczypała, Mateusz
Szkutnik-Rogoż, Joanna
Lęgas, Aleksandra
Powiązania:
https://bibliotekanauki.pl/articles/1833620.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
transport
multi-criteria method
transport costs
optimization
decision problem
metoda wielokryterialna
koszty transportu
optymalizacja
problem decyzyjny
Opis:
The problem of choosing the way to move people is often encountered both in scientific research and in everyday life. The difficulty of this process depends on the availability of many variants and the pursuit of satisfying transport needs at the minimum cost, in the shortest possible time and in the most comfortable conditions. The publication presents a decision problem of choosing the best transport option using multi-criteria methods. At the beginning authors presented the widely used methods of solving decision problems in the literature. Subsequently, based on the example of the Warsaw-Wroclaw connection, the MAJA multi-criteria assessment method algorithm was analysed. Both road, rail and air transport options were considered. Six possible variants of solutions were indicated, which were assessed in three sub-criteria: cost, time and comfort of travel. Then, the results of the analysis were compared with the results obtained using other multi-criteria decision-making support methods, i.e. ELECTRE I, AHP, TOPSIS, PROMETHEE, SAW, PVM. The considered methods were divided according to the way the result was presented, as a result of which the methods based on the relation of superiority (which included the MAJA method) and methods using ranking were distinguished, and then an intra-group comparison was made. On the basis of the constructed compliance matrix of the relation of superiority, it was found that domination methods exhibited convergence of the obtained results. However, in order to compare the convergence of the results of the ranking methods, the Spearman's linear correlation coefficient was used. The applied MAJA multi-criteria method has made it possible to determine non-dominated solutions considered optimal taking into account the adopted weights of criteria and compliance and non-compliance thresholds. Its unquestionable advantage is the possibility of using many partial criteria expressed in different measurement units. In the presented example, the best options were the premium express rail transport and airplane. The summary defines the direction of further research and possibilities of modification of the presented method.
Źródło:
Archives of Transport; 2021, 57, 1; 25-41
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving IRP using location based heuristics
Autorzy:
Hanczar, P.
Powiązania:
https://bibliotekanauki.pl/articles/406343.pdf
Data publikacji:
2014
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
inventory routing problem
optimization
vendor managed inventory
Opis:
Inventory routing problems (IRPs) occur where vendor managed inventory replenishment strategies are implemented in supply chains. These problems are characterized by the presence of both transportation and inventory considerations, either as parameters or constraints. The research presented in this paper aims at extending IRP formulation developed on the basis of location based heuristics proposed by Bramel and Simchi-Levi and continued by Hanczar. In the first phase of proposed algorithms, mixed integer programming is used to determine the partitioning of customers as well as dates and quantities of deliveries. Then, using 2-opt algorithm for solving the traveling sales-person problem the optimal routes for each partition are determined. In the main part of research the classical formulation is extended by additional constraints (visit spacing, vehicle filling rate, driver (vehicle) consistency, and heterogeneous fleet of vehicles) as well as the additional criteria are discussed. Then the impact of using each of proposed extensions for solution possibilities is evaluated. The results of computational tests are presented and discussed. Obtained results allow to conclude that the location based heuristics should be considered when solving real life instances of IRP.
Źródło:
Operations Research and Decisions; 2014, 24, 2; 81-96
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The "Thirty-seven Percent Rule" and the secretary problem with relative ranks
Autorzy:
Bajnok, Béla
Semov, Svetoslav
Powiązania:
https://bibliotekanauki.pl/articles/729810.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
secretary problem
relative ranks
stopping rule
optimization
Opis:
We revisit the problem of selecting an item from n choices that appear before us in random sequential order so as to minimize the expected rank of the item selected. In particular, we examine the stopping rule where we reject the first k items and then select the first subsequent item that ranks lower than the l-th lowest-ranked item among the first k. We prove that the optimal rule has k ~ n/e, as in the classical secretary problem where our sole objective is to select the item of lowest rank; however, with the optimally chosen l, here we can get the expected rank of the item selected to be less than any positive power of n (as n approaches infinity). We also introduce a common generalization where our goal is to minimize the expected rank of the item selected, but this rank must be within the lowest d.
Źródło:
Discussiones Mathematicae Probability and Statistics; 2014, 34, 1-2; 5-21
1509-9423
Pojawia się w:
Discussiones Mathematicae Probability and Statistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A case study in school transportation logistics
Autorzy:
Worwa, K.
Powiązania:
https://bibliotekanauki.pl/articles/409077.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
School bus routing problem
Scheduling
Heuristic
optimization
Opis:
In the paper, a school bus routing problem, its mathematical models and solution methods are investigated. The aim of the study is to search for school bus routing problem and its solution method and to apply them for a sample case study. The case study concerns the routing and scheduling of school buses in an exemplary, well-recognized school located in one of Polish community. The problem is to find a series of school bus routes that ensure the service is provided equitably to all eligible students. Because of the NP-hardness of the school bus routing problem, it is solved using some heuristic optimization method using real data from the considered exemplary school. The aim is to increase bus utilization and to reduce transportation times for students, while maintaining on-time delivery of students to the school. Although the problem under consideration is one of the earliest logistics problems solved using methods of operations research, remains valid and is the subject of research, as evidenced by numerous contemporary publications, presenting new methods for the formal specification and solution of the problem.
Źródło:
Research in Logistics & Production; 2014, 4, 1; 45-54
2083-4942
2083-4950
Pojawia się w:
Research in Logistics & Production
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 36

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