Zobrazeno 1 - 10
of 15
pro vyhledávání: '"E. MARCHITTO"'
Publikováno v:
Journal of heuristics 17 (2011): 441–466.
info:cnr-pdr/source/autori:Festa, P.; De Leone, R.; Marchitto, E./titolo:A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution/doi:/rivista:Journal of heuristics/anno:2011/pagina_da:441/pagina_a:466/intervallo_pagine:441–466/volume:17
info:cnr-pdr/source/autori:Festa, P.; De Leone, R.; Marchitto, E./titolo:A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution/doi:/rivista:Journal of heuristics/anno:2011/pagina_da:441/pagina_a:466/intervallo_pagine:441–466/volume:17
This paper addresses the problem of determining the best scheduling for Bus Drivers, a $\mathcal{NP}$ -hard problem consisting of finding the minimum number of drivers to cover a set of Pieces-Of-Work (POWs) subject to a variety of rules and regulati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86d1216cb10418103bf200f97e0a065e
http://hdl.handle.net/11581/202858
http://hdl.handle.net/11581/202858
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
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
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
Publikováno v:
Neural networks : the official journal of the International Neural Network Society. 20(5)
Support vector machines (SVMs) are a powerful technique developed in the last decade to effectively tackle classification and regression problems. In this paper we describe how support vector machines and artificial neural networks can be integrated
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.
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.