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ę "Worwa, K." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    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ł
    Tytuł:
    Comparison of Selected Strategies of Statistical Quality Control
    Autorzy:
    Worwa, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/409302.pdf
    Data publikacji:
    2015
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    Statistical Quality Control
    Control Strategy
    Control Effectiveness
    Opis:
    The paper presents the results of a comparative analysis of the two methods of statistical quality control of products. That two methods differ from each other mainly by a way of determining a subset of products subjected to inspection. The first of the two methods, hereinafter referred to as the completely random method, is to draw a certain number of products for control of the entire products population. The second method, called the method of drawing from partitions, is a pre-split across the specific products population into smaller parts, called partitions, and then create a representation (sample) of the products subject to control by drawing the products from each partition. The main result of this study is to determine the conditions for which the effectiveness of quality control methods with drawing from partitions is not less than the efficiency of the method with fully random drawing, whereby the efficiency criterion is the likelihood of the event, consisting in the fact that there is at least one incorrect product among the drawn products. The considerations were illustrated by numerical examples, designed to compare the effectiveness of the analyzed methods of quality control.
    Źródło:
    Research in Logistics & Production; 2015, 5, 4; 337-346
    2083-4942
    2083-4950
    Pojawia się w:
    Research in Logistics & Production
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Logistical Aspects of the Software Testing Process
    Autorzy:
    Worwa, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/1833816.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    software testing planning
    software testing organization
    Opis:
    The purpose of this article is characterization of the software testing process in terms of its logistical support. The software testing process is characterized as a complex, multistage project, with particular emphasis on its planning and organization. The role of logistical support and its importance for the efficiency of the testing process realization is highlighted. It was noted that proper software testing process planning and organization significantly affects the time and cost of that process.
    Źródło:
    Research in Logistics & Production; 2016, 6, 2; 155-164
    2083-4942
    2083-4950
    Pojawia się w:
    Research in Logistics & Production
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Minimalizacja liczby przystanków autobusowych w problemie zarządzania transportem szkolnym
    Minimization of the number of bus stops in the school bus routing problem
    Autorzy:
    Worwa, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/202688.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    marszrutyzacja floty autobusów szkolnych
    optymalizacja
    school bus routing problem
    bus route optimization
    Opis:
    W artykule przedstawiono opis i sformułowanie problemu określenia zbioru przystanków autobusowych o minimalnej liczności na potrzeby zarządzania transportem szkolnym. Rozpatrywany problem stanowi jeden z podproblemów składowych szerszego problemu, znanego w literaturze jako schoool bus routing problem (SBRP). Wychodząc z założenia, że mała liczba przystanków autobusowych obsługiwanych przez flotę autobusów szkolnych ułatwia efektywne prowadzenie procesu transportowego, w artykule sformułowano problem minimalizacji liczby wykorzystywanych przystanków autobusowych, z zapewnieniem transportu każdemu uprawnionemu do przewozu uczniowi. W artykule przedstawiono także metodę rozwiązania sformułowanego problemu. Aby zilustrować proponowaną metodę rozwiązania rozpatrywanego problemu optymalizacji, przedstawiono prosty przykład liczbowy.
    This paper contains a formal presentation and description of a method of solving the problem of both determining the set of bus stops and the assignment of students that are authorized to transport to these stops. This issue can be treated as a subproblem of the school bus routing problem (SBRP). Although the problems of the SBRP class are one of the earliest logistics problems solved using methods of operations research, they remain valid and are the subject of research, as evidenced by numerous contemporary publications. Unfortunately, in most of the problems of SBRP class described in the literature, the problem of determining the bus stops network and allocation of students to the particular stops is very often ignored. Basing on the assumption that a small number of bus stops, from which the students are taken or to which they are transported, facilitates the school transport process, the paper focuses on the problem of minimizing the number of active bus stops. The main result of this paper is a proposed greedy algorithm to solving the problem of determining the minimum number of school bus stops. To illustrate the functioning of the proposed algorithm, a simple numerical example has been presented.
    Źródło:
    Zeszyty Naukowe Politechniki Poznańskiej. Organizacja i Zarządzanie; 2017, 72; 229-243
    0239-9415
    Pojawia się w:
    Zeszyty Naukowe Politechniki Poznańskiej. Organizacja i Zarządzanie
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimizing the module structure of the program on the stage of its design
    Autorzy:
    Worwa, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/409395.pdf
    Data publikacji:
    2018
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    program design
    program modular structure
    program structure optimization
    Opis:
    The paper proposes a formal method of determining the modular structure of the computer program by formulating and solution of the corresponding two-criterion optimization problem. A module strength coefficient and a module coupling coefficients were established as modularization criteria of the program. For the illustration of the considerations that have been discussed, a simple numerical example will be presented.
    Źródło:
    Research in Logistics & Production; 2018, 8, 1; 91-102
    2083-4942
    2083-4950
    Pojawia się w:
    Research in Logistics & Production
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Minimization of number of buses in the school bus routing problem
    Autorzy:
    Worwa, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/409552.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    school bus routing problem
    bus route optimization
    Opis:
    In this paper a formal presentation and description of a method of solving the problem of both determining the set of bus stops and assignment of students that are authorized to transport to these stops is investigated. This problem can be treated as a sub problem of the bus school routing problem (SBRP). Although the problems of the SBRP class are one of the earliest logistics problems solved using methods of operations research, they remain valid and are the subject of research, as evidenced by numerous contemporary publications. Unfortunately, in most of the problems of SBRP class described in the literature the problem of determining the bus stops network and allocation of students to the particular stops is very often ignored. Based on the assumption that a small number of bus stops, from which the students are taken or to which they are set down, makes carrying out of school transport process easier, a problem of minimizing the number of active bus stops was considered. The main result of this paper is proposition of a greedy algorithm to solving the problem of determining the minimum set of school bus stops. To illustrate functioning the proposed algorithm a simple numerical example has been presented.
    Źródło:
    Research in Logistics & Production; 2017, 7, 2; 127-141
    2083-4942
    2083-4950
    Pojawia się w:
    Research in Logistics & Production
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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