Application Oriented Variable Fixing Methods for the Multiple Depot Vehicle Scheduling Problem

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

doi:10.14232/actacyb.21.1.2013.5

Cited by 8 publications

(12 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We tested our method on random input generated based on [9]. Both single and multiple-depot test cases were created in different sizes; namely 50, 250, 500, 1000, 1500 and 2000 trips.…”

Section: Test Resultsmentioning

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

“…We tested our method on random input generated based on [9]. Both single and multiple-depot test cases were created in different sizes; namely 50, 250, 500, 1000, 1500 and 2000 trips.…”

Section: Test Resultsmentioning

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

show abstract

“…Our random input data was generated in two steps. First, random VSP inputs were created using the method in Dávid and Krész (2013). These instances had 100, 500, or 1000 trips, and used either 2 or 3 depots.…”

Section: Random Instancesmentioning

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

“…The resulting smaller problem is solved using the classical IP modeling approach, and solutions are obtained with a greatly reduced running time. This method is studied in our following publications: [32,34].…”

Section: Vehicle Schedulingmentioning

confidence: 99%

“…First, we give a series of variable fixing heuristics for creating vehicle schedules in a short time, then introduce an iterative algorithm that constructs schedules satisfying the basic rules of driver shifts as well. The list of our publications connected to this topic include [32,34,9].…”

Section: Chapter 1 Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Application-oriented scheduling problems in public bus transportation

Dávid

Self Cite

View full text Add to dashboard Cite

First and foremost, I would like to thank my supervisor Miklós for his support and guidance throughout all these years. Although I might have doubted some of his ideas about the direction of this research, I must confess: he has been right the whole time. I would also like to thank all my colleagues, co-authors and friends who contributed to the results presented in this dissertation. Studying the application-oriented concepts that provide the backbone of this dissertation would not have been possible without the support of an industrial partner. I would like to thank Tisza Volán Zrt., the public bus transportation company of Szeged, Hungary, for providing the real-life data for testing our methods, the professional feedback on the quality of our results, and especially for the several innovative ideas about the shortcomings of the current state of transportation-many of these are reflected in the different topics of our theses. Last, but not least, I would also like to thank my family. My girlfriend Edit for her love, support and most importantly her patience. My parents, who have always been there for me, especially my mother Tünde, whom I can always count on. And my brothers (all four of them), who are the best siblings one can wish for. inserted into the given blocks, b) and c) represent possible solutions. .. .. .. . .

show abstract

Application Oriented Variable Fixing Methods for the Multiple Depot Vehicle Scheduling Problem

Cited by 8 publications

References 12 publications

Integrated Vehicle Scheduling and Vehicle Assignment

Integrated Vehicle Scheduling and Vehicle Assignment

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

Application-oriented scheduling problems in public bus transportation

Contact Info

Product

Resources

About