Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "optimization problem" wg kryterium: Temat


Wyświetlanie 1-6 z 6
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ł
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ł:
Multi-Criteria Optimization in Fuel Distribution
Autorzy:
Pempera, J.
Żelazny, D.
Powiązania:
https://bibliotekanauki.pl/articles/409566.pdf
Data publikacji:
2015
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
vehicle routing problem
multi-criteria
discrete optimization
fuel distribution
Opis:
This paper deals with some computational study of multi-criteria optimization in fuel distribution problem. We consider vehicle routing problem, e.g. routing of a fleet of tank trucks, for one of the famous polish petroleum companies. For the purpose of solving this problem, we developed the random search algorithm, which explores the broad range of feasible sets of routes and searches for non-dominated multi-criteria solutions. The problem is examined on real data, which contains distances between 50 petrol stations and one central warehouse (refinery). Obtained results indicate, that it is possible to obtain single solution and satisfy both optimization criteria. Based on the analysis of the collected data, we formulate a number of proposals useful in future for construction of algorithms for multi-criteria fuel distribution optimization.
Źródło:
Research in Logistics & Production; 2015, 5, 1; 77-84
2083-4942
2083-4950
Pojawia się w:
Research in Logistics & Production
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimization of empty truck runs. Formulation of problem
Autorzy:
Ambroziak, Tomasz
Pawłowski, Daniel
Powiązania:
https://bibliotekanauki.pl/articles/409210.pdf
Data publikacji:
2019
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
transportation problem
empty truck runs
graphs
optimization
routes and schedules
Opis:
The article formulates the issue of minimizing empty runs. Then, the interpretation of the issue of empty runs on numerical examples is presented. The formulation of the issue of minimizing empty runs requires the formulation of two optimization problems. The first one concerns distribution of commodities with minimal cost. The optimization problem formulated in this way is a well-known transport problem with the objective function being the costs of transport. The second one concerns commodity transport with distance minimization. After solving these two issues, the circulation problem of transport means is solved. Thanks to which we obtain the minimum number of empty runs expressed in distance units.
Źródło:
Research in Logistics & Production; 2019, 9, 2; 77-87
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ł:
Multi-Criteria 3-Dimension Bin Packing Problem
Autorzy:
Kacprzak, Ł.
Rudy, J.
Żelazny, D.
Powiązania:
https://bibliotekanauki.pl/articles/409522.pdf
Data publikacji:
2015
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
bin packing problem
multi-criteria
genetic algorithm
simulated annealing
discrete optimization
Pareto efficiency
Opis:
In this paper a multi-criteria approach to the 3-dimensions bin packing problem is considered. The chosen maximization criteria are the number and the total volume of the boxes loaded into the container. Existing solution representation and decoding method are applied to the problem. Next, two metaheuristic algorithms, namely simulated annealing and genetic algorithm are developed using the TOPSIS method for solution evaluation. Both algorithms are then used to obtain approximations of the Pareto front for a set of benchmarks from the literature. Despite the fact that both criteria work in favor of each other, we managed to obtain multiple solutions in many cases, proving that lesser number of boxes can lead to better utilization of the container volume and vice versa. We also observed, that the genetic algorithms performs slightly better in our test both in the terms of hyper-volume indicator and number of non-dominated solutions.
Źródło:
Research in Logistics & Production; 2015, 5, 1; 85-94
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