Driver scheduling based on "driver-friendly" vehicle schedules

  title={Driver scheduling based on "driver-friendly" vehicle schedules},
  author={Viktor {\'A}rgil{\'a}n and J{\'a}nos Balogh and J{\'o}zsef B{\'e}k{\'e}si and Bal{\'a}zs D{\'a}vid and Mikl{\'o}s Kr{\'e}sz and Attila T{\'o}th},
In the area of optimization of public transportation there are several methods for modeling and solving vehicle and driver scheduling problems.We designed a sequential heuristic method for solving the combined (vehicle and driver scheduling) problem. Our model is based on a modification of the vehicle schedules to satisfy driver requirements.We introduced a driver friendly approach of the optimization of the scheduling, which is closer to the practice used by public transportation companies.We… 
Application Oriented Variable Fixing Methods for the Multiple Depot Vehicle Scheduling Problem
Heuristic methods for the vehicle scheduling problem that solve it by reducing the problem size using different variable fixing approaches are presented, constructed in a way that takes some basic driver requirements into consideration as well.
Ütemezési feladatok az autóbuszos közösségi közlekedés operatív tervezésében: Egy áttekintés
A közlekedési társaságok számára lényeges szempont költségeik racionalizálása szolgáló legfontosabb módszereket műveletek ütemezését három fázisra bontva tárgyaljuk.


Integrated and Dynamic Vehicle and Crew Scheduling
textabstractDue to increased competition in the public transport market and the pressure on governments to cut expenses, increasing attention has been paid to cost reductions in public
A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit
This article proposes a Lagrangean relaxation approach to solve integrated duty and vehicle scheduling problems arising in public transport. The approach is based on a version of the proximal bundle
A time-space network based exact optimization model for multi-depot bus scheduling
This paper discusses the multi-depot, multi-vehicle-type bus scheduling problem (MDVSP), involving multiple depots for vehicles and different vehicle types for timetabled trips, and uses time–space-based instead of connection-based networks for MDVSP modeling.
Multiple-Depot Integrated Vehicle and Crew Scheduling
This paper presents two different models and algorithms for integrated vehicle and crew scheduling in the multiple-depot case based on a combination of column generation and Lagrangian relaxation and proposes a new way of generating randomly data instances such that their properties are the same as for real-world instances.
On some matching problems arising in vehicle scheduling models
Two bipartite matching problems arising in Vehicle Scheduling are considered and a heuristic algorithm based on Lagrangean relaxation for the capacitated version of the multicommodity matching is presented together with experimental results.
A comparison of five heuristics for the multiple depot vehicle scheduling problem
Given a set of timetabled tasks, the multi-depot vehicle scheduling problem consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished ...
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
It is shown that the solutions of the linear relaxation of the MDVSP contain many odd cycles, and a class of valid inequalities are derived by extending the notion of odd cycle and described a lifting procedure for these inequalities.
An Additive Bounding Procedure for Combinatorial Optimization Problems
An additive approach for computing lower bounds that yields an increasing sequence of values and an application to the traveling salesman problem with precedence constraints is presented to exemplify the technique.