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ę "planowanie pojazdów" wg kryterium: Temat


Wyświetlanie 1-2 z 2
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ł:
The optimization of trucks fleet schedule in view of their interaction and restrictions of the European agreement of work of crews
Autorzy:
Oliskevych, Myroslav
Kovalyshyn, Stepan
Magats, Myron
Shevchuk, Viktor
Sukach, Oleh
Powiązania:
https://bibliotekanauki.pl/articles/1841183.pdf
Data publikacji:
2020
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
scheduling
crew of vehicles
trucks fleet
disjunctive graph
planowanie
załoga pojazdów
flota ciężarówek
graf dysjunkcyjny
Opis:
The importance of compliance with the schedule of work of road trains on the highway transport network of the European Union is shown. The possible options for work and rest modes for truck drivers on international routes have been analyzed. A model for optimizing the truck fleet operation plan has been developed. This model has two levels, that is, the general graph contains subgraphs designed with incompatible vertices to determine the active and shortest schedule. Each of the subgraphs reflects alternative routes and schedules of a truck. The model also includes restrictions on the total cycle time and active period duration of available unloading points. To find the shortest schedule, integer programming with a guaranteed optimal solution was applied. Testing of the proposed algorithm was performed for the example of serving orders for international freight transportation between the cities of Ukraine, Poland, and the Czech Republic. The active schedule is based on the criterion of the minimum of the total duration of drivers’ work. The results obtained are valid, consistent with the rules of the European Agreement. They indicate that the choice of the best schedule for a single car on a unitary route is not the best solution for the entire truck fleet and the entire flow of orders.
Źródło:
Transport Problems; 2020, 15, 2; 157-170
1896-0596
2300-861X
Pojawia się w:
Transport Problems
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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