Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price

Markó Horváth, Tamás Kis

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In the problem of the title, vehicle and crew schedules are to be determined simultaneously in order to satisfy a given set of trips over time. The vehicles and the crew are assigned to depots, and a number of rules have to be observed in the course of constructing feasible schedules. The main contribution of the paper is a novel mathematical programming formulation which combines ideas from known models, and an exact solution procedure based on branch-and-price. The method is tested on benchmark instances from the literature and it provides suboptimal schedules using limited computational resources.

Original languageEnglish
Pages (from-to)39-67
Number of pages29
JournalCentral European Journal of Operations Research
Volume27
Issue number1
DOIs
Publication statusPublished - Mar 7 2019

Keywords

  • Branch-and-price
  • Exact methods
  • Integer programming
  • Vehicle and crew scheduling

ASJC Scopus subject areas

  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price'. Together they form a unique fingerprint.

  • Cite this