Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Bus driver scheduling problem"'
Publikováno v:
The Journal of the Operational Research Society, 2002 Mar 01. 53(3), 324-335.
Externí odkaz:
https://www.jstor.org/stable/822898
Publikováno v:
Repositório Institucional da Universidade Estadual de Maringá (RI-UEM)
Universidade Estadual de Maringá (UEM)
instacron:UEM
Universidade Estadual de Maringá (UEM)
instacron:UEM
For the public transport system being provided with quality, it is need to tackle numerous problems and one of them is the Bus Driver Schedule Problem (BDSP) which is NP-hard. This work presents four new algorithms of the VNS meta-heuristic for the B
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::3f5be116fa889e1ccec1a89313f0f943
http://repositorio.uem.br:8080/jspui/handle/1/2529
http://repositorio.uem.br:8080/jspui/handle/1/2529
The Bus Driver Scheduling Problem is an extremely complex part of the Transportation Planning System (e.g., [12]) that generally can be divided in different subproblems due to its complexity: Timetabling, Vehicle Scheduling, Crew Scheduling (Bus and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc3ded4da39ebb7af6da5e2ca5651db6
http://hdl.handle.net/11581/200260
http://hdl.handle.net/11581/200260
Publikováno v:
CISched
The bus driver scheduling problem (BDSP) is one of the most important planning decision problems that public transportation companies must solve and that appear as an extremely complex part of the general transportation planning system. It is formula
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::024fe85c1fc3086f0ca183ed4c8b37c4
https://doi.org/10.1109/scis.2007.367689
https://doi.org/10.1109/scis.2007.367689
The Bus Driver Scheduling Problem (BDSP) is a standard Crew Scheduling Problem arising in urban transportation. In this paper, we propose an innovative hybrid metaheuristic that combines GRASP (Greedy Randomized Adaptive Search Procedure) with Rollou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3730::f66b0a965c04d4188c9671d60f1e9e2d
http://hdl.handle.net/11588/347743
http://hdl.handle.net/11588/347743
The goal of this paper is to propose and experimentally compare a class of hybrid metaheuristics for the Bus Driver Scheduling Problem. To link our investigation to real world scenarios, we have cooperated with PluService Srl of Senigallia. We briefl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3730::ef33e86784fc370d4b4400bd9ef87a83
http://hdl.handle.net/11588/118626
http://hdl.handle.net/11588/118626
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
This paper addresses the problem of determining the best scheduling for Bus Drivers, i.e. the problem of finding the minimum number of drivers required to cover a set of Piece-Of-Works subject to a variety of rules and regulations that must be enforc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::706250902764c4b221d2d9d17fb87146
http://hdl.handle.net/11581/114342
http://hdl.handle.net/11581/114342
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.