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


Wyświetlanie 1-3 z 3
Tytuł:
Determining lower bound on number of vehicle blocks in multi-depot vehicle scheduling problem with mixed fleet covering electric buses
Autorzy:
Duda, Jerzy
Fierek, Szymon
Karkula, Marek
Kisielewski, Piotr
Puka, Radosław
Redmer, Adam
Skalna, Iwona
Powiązania:
https://bibliotekanauki.pl/articles/27311780.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
public transport
organization of public transport
vehicle scheduling
electric buses
mixed fleet
transport publiczny
organizacja transportu publicznego
planowanie pojazdów
autobusy elektryczne
Opis:
Scheduling buses in public transport systems consists in assigning trips to vehicle blocks. To minimize the cost of fuel and environmental impact of public transport, the number of vehicle blocks used should be as small as possible, but sufficient to cover all trips in a timetable. However, when solving real life transportation problems, it is difficult to decide whether the number of vehicle blocks obtained from an algorithm is minimal, unless the actual minimal number is already known, which is rare, or the theoretical lower bound on the number of vehicles has been determined. The lower bound on the number of vehicle blocks is even more important and useful since it can be used both as a parameter that controls the optimization process and as the minimum expected value of the respective optimization criterion. Therefore, methods for determining the lower bound in transportation optimization problems have been studied for decades. However, the existing methods for determining the lower bound on the number of vehicle blocks are very limited and do not take multiple depots or heterogeneous fleet of vehicles into account. In this research, we propose a new practical and effective method to assess the lower bound on the number of vehicle blocks in the Multi-Depot Vehicle Scheduling Problem (MDVSP) with a mixed fleet covering electric vehicles (MDVSP-EV). The considered MDVSP-EV reflects a problem of public transport planning encountered in medium-sized cities. The experimental results obtained for a real public transport system show the great potential of the proposed method in determining the fairly strong lower bound on the number of vehicle blocks. The method can generate an estimated distribution of the number of blocks during the day, which may be helpful, for example, in planning duties and crew scheduling. An important advantage of the proposed method is its low calculation time, which is very important when solving real life transportation problems.
Źródło:
Archives of Transport; 2023, 65, 1; 27--38
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ł
Tytuł:
Hydrotechnical conditions and inland transportation’s costs
Warunki hydrotechniczne a koszty transportu
Autorzy:
Skupień, E.
Powiązania:
https://bibliotekanauki.pl/articles/223573.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
rail and water transportation
transportation costs
waterway
organization of broken transportation
transport wodno-kolejowy
koszty transportu
droga wodna
organizacja transportu łamango
Opis:
The article contains a description of the method supporting the organization of broken cargo transportation. The program, which uses the presented method allows the planning of transport including rail and inland waterways. Description of the computer program shows how to calculate the direct costs for transport modes and external costs of inland transport and probability to achieve throughput of individual sections of the waterway. An essential part of the description is providing a method for calculating the probability of the desired depth of the waterway, the continuous number of days needed to complete the task. The reported results were referred to data from the past. The program is intended for use by shipowners and shippers operating the inland waterways.
Referat stanowi opis metody wspomagania organizacji transportu łamanego. Program, który wykorzystuje przedstawianą metodę pozwala na planowanie transportu wodno-kolejowego. Opis programu komputerowego wskazuje sposoby obliczania bezpośrednich. jak i zewnętrznych kosztów transportu oraz sposób obliczania prawdopodobieństwa wystąpienia określonej głębokości drogi wodnej na jej poszczególnych odcinkach. Najważniejszą częścią referatu jest przedstawienie metody obliczania prawdopodobieństwa wystąpienia pożądanej głębokości drogi wodnej, przez ilość dni umożliwiająca wykonanie określonego zadania przewozowego bez konieczności przerywania procesu. Uzyskane wyniki zostały odniesione do głębokości drogi wodnej zarejestrowanej w przeszłości. Program może służyć armatorom, spedytorom i innym osobom planującym przewozy na polskich drogach wodnych.
Źródło:
Archives of Transport; 2012, 24, 4; 571-578
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