The dynamic vehicle rescheduling problem

Dávid, Balázs; Krész, Miklós

doi:10.1007/s10100-017-0478-7

Cited by 11 publications

(17 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The schedule given by the VSP is made up of blocks, a block being the sequence of tasks serviced by a single vehicle for that day. For the introduction of the VSP, we refer to our formalization in Dávid and Krész (2017).…”

Section: Scheduling Vehicle Tasks and Maintenance Activitiesmentioning

confidence: 99%

Multi-depot bus schedule assignment with parking and maintenance constraints for intercity transportation over a planning period

Dávid

Krész

2018

Transportation Letters

Self Cite

View full text Add to dashboard Cite

This article introduces the schedule assignment problem for public transit, which aims to assign vehicle blocks of a planning period to buses in the fleet of a transportation company. This assignment has to satisfy several constraints, the most important of which is compatibility, meaning that certain blocks can only be serviced by buses belonging to given types. Other constraints come from the fact that the problem considers a long-term plan for several days or weeks, which means that daily parking and periodic maintenance activities also have to be taken into account. We give a state-expanded multi-commodity flow network for the above problem. This model takes parking constraints into account, and also assigns preventive maintenance tasks to buses after serving blocks for a fixed amount of time. The solutions of this model are presented for real-life and randomly generated instances.

show abstract

Section: Scheduling Vehicle Tasks and Maintenance Activitiesmentioning

confidence: 99%

Multi-depot bus schedule assignment with parking and maintenance constraints for intercity transportation over a planning period

Dávid

Krész

2018

Transportation Letters

Self Cite

View full text Add to dashboard Cite

show abstract

“…For the introduction of the VSP, we will follow our terminology from [10]. The input of the VSP is a set V of vehicles and set T of timetabled trips.…”

Section: Vehicle Scheduling and Vehicle-specific Activitiesmentioning

confidence: 99%

Integrated Vehicle Scheduling and Vehicle Assignment

Békési¹,

Dávid²,

Krész³

2018

Acta Cybern

Self Cite

View full text Add to dashboard Cite

The vehicle scheduling problem has been extensively studied in the past decades. Yet, most models and methods given in the literature consider only a theoretical scenario where vehicles just have to service the timetabled trips of the input. However, schedules created this way cannot be used in real life, as they should also consider constraints such as refueling, parking, and maintenance, which are all connected to the vehicle servicing the trips. In this paper, we give a set partitioning model for the multi-depot integrated vehicle scheduling and vehicle assignment problem. This model can also be used as a general framework, which can integrate multiple activities based on the rules or regulation of the different possible input scenarios. We give a column generation-based solution method, and demonstrate its efficiency on randomly generated test instances, which treat the refueling of vehicles with two different fuel types as the vehicle-specific activity.

show abstract

“…A contribution by Berlinger et al (2017) considers a financial problem. The online algorithm related papers are those by Dávid and Krész (2017), Dunke and Nickel (2017) and Renault (2017). Application motivated optimization problems were analysed by Csehi and Farkas (2017), Fleiner et al (2017) and Kosztyán et al (2017).…”

mentioning

confidence: 99%