Hybrid column generation approaches for urban transit crew management problems

Tallys Yunes, Arnaldo V. Moura, Cid C. de Souza

Research output: Contribution to journalArticle

35 Citations (Scopus)

Abstract

This article considers the overall crew management problem arising from the daily operation of an urban transit bus company that serves the metropolitan area of the city of Belo Horizonte, Brazil. Due to its intrinsic complexity, the problem is divided in two distinct subproblems: crew scheduling and crew rostering. We have investigated each of these problems using mathematical programming (MP) and constraint logic programming (CLP) approaches. In addition, we developed hybrid column generation algorithms for solving these problems, combining MP and CLP. The hybrid algorithms always performed better, when obtaining optimal solutions, than the two previous isolated approaches. In particular, they proved to be much faster for the scheduling problem. All the proposed algorithms have been implemented and tested over real-world data obtained from the aforementioned company. The coefficient matrix of the linear program associated with some instances of the scheduling problem contains tens of millions of columns; this number is even larger for the rostering problem. The analysis of our experiments indicates that it was possible to find high-quality, and many times optimal, solutions that were suitable for the company's needs. These solutions were obtained within reasonable computational times on a desktop PC.

Original languageEnglish (US)
Pages (from-to)273-288
Number of pages16
JournalTransportation Science
Volume39
Issue number2
DOIs
StatePublished - Jan 1 2005
Externally publishedYes

Fingerprint

Logic programming
Mathematical programming
Scheduling
programming
management
scheduling
Industry
logic
PC
agglomeration area
Brazil
Experiments
experiment

Keywords

  • Column generation
  • Constraint programming
  • Crew scheduling
  • Hybrid algorithms
  • Public transportation

ASJC Scopus subject areas

  • Transportation

Cite this

Hybrid column generation approaches for urban transit crew management problems. / Yunes, Tallys; Moura, Arnaldo V.; de Souza, Cid C.

In: Transportation Science, Vol. 39, No. 2, 01.01.2005, p. 273-288.

Research output: Contribution to journalArticle

Yunes, Tallys ; Moura, Arnaldo V. ; de Souza, Cid C. / Hybrid column generation approaches for urban transit crew management problems. In: Transportation Science. 2005 ; Vol. 39, No. 2. pp. 273-288.
@article{4aeebb69d935406e8ae25699e251db40,
title = "Hybrid column generation approaches for urban transit crew management problems",
abstract = "This article considers the overall crew management problem arising from the daily operation of an urban transit bus company that serves the metropolitan area of the city of Belo Horizonte, Brazil. Due to its intrinsic complexity, the problem is divided in two distinct subproblems: crew scheduling and crew rostering. We have investigated each of these problems using mathematical programming (MP) and constraint logic programming (CLP) approaches. In addition, we developed hybrid column generation algorithms for solving these problems, combining MP and CLP. The hybrid algorithms always performed better, when obtaining optimal solutions, than the two previous isolated approaches. In particular, they proved to be much faster for the scheduling problem. All the proposed algorithms have been implemented and tested over real-world data obtained from the aforementioned company. The coefficient matrix of the linear program associated with some instances of the scheduling problem contains tens of millions of columns; this number is even larger for the rostering problem. The analysis of our experiments indicates that it was possible to find high-quality, and many times optimal, solutions that were suitable for the company's needs. These solutions were obtained within reasonable computational times on a desktop PC.",
keywords = "Column generation, Constraint programming, Crew scheduling, Hybrid algorithms, Public transportation",
author = "Tallys Yunes and Moura, {Arnaldo V.} and {de Souza}, {Cid C.}",
year = "2005",
month = "1",
day = "1",
doi = "10.1287/trsc.1030.0078",
language = "English (US)",
volume = "39",
pages = "273--288",
journal = "Transportation Science",
issn = "0041-1655",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "2",

}

TY - JOUR

T1 - Hybrid column generation approaches for urban transit crew management problems

AU - Yunes, Tallys

AU - Moura, Arnaldo V.

AU - de Souza, Cid C.

PY - 2005/1/1

Y1 - 2005/1/1

N2 - This article considers the overall crew management problem arising from the daily operation of an urban transit bus company that serves the metropolitan area of the city of Belo Horizonte, Brazil. Due to its intrinsic complexity, the problem is divided in two distinct subproblems: crew scheduling and crew rostering. We have investigated each of these problems using mathematical programming (MP) and constraint logic programming (CLP) approaches. In addition, we developed hybrid column generation algorithms for solving these problems, combining MP and CLP. The hybrid algorithms always performed better, when obtaining optimal solutions, than the two previous isolated approaches. In particular, they proved to be much faster for the scheduling problem. All the proposed algorithms have been implemented and tested over real-world data obtained from the aforementioned company. The coefficient matrix of the linear program associated with some instances of the scheduling problem contains tens of millions of columns; this number is even larger for the rostering problem. The analysis of our experiments indicates that it was possible to find high-quality, and many times optimal, solutions that were suitable for the company's needs. These solutions were obtained within reasonable computational times on a desktop PC.

AB - This article considers the overall crew management problem arising from the daily operation of an urban transit bus company that serves the metropolitan area of the city of Belo Horizonte, Brazil. Due to its intrinsic complexity, the problem is divided in two distinct subproblems: crew scheduling and crew rostering. We have investigated each of these problems using mathematical programming (MP) and constraint logic programming (CLP) approaches. In addition, we developed hybrid column generation algorithms for solving these problems, combining MP and CLP. The hybrid algorithms always performed better, when obtaining optimal solutions, than the two previous isolated approaches. In particular, they proved to be much faster for the scheduling problem. All the proposed algorithms have been implemented and tested over real-world data obtained from the aforementioned company. The coefficient matrix of the linear program associated with some instances of the scheduling problem contains tens of millions of columns; this number is even larger for the rostering problem. The analysis of our experiments indicates that it was possible to find high-quality, and many times optimal, solutions that were suitable for the company's needs. These solutions were obtained within reasonable computational times on a desktop PC.

KW - Column generation

KW - Constraint programming

KW - Crew scheduling

KW - Hybrid algorithms

KW - Public transportation

UR - http://www.scopus.com/inward/record.url?scp=19944404260&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=19944404260&partnerID=8YFLogxK

U2 - 10.1287/trsc.1030.0078

DO - 10.1287/trsc.1030.0078

M3 - Article

VL - 39

SP - 273

EP - 288

JO - Transportation Science

JF - Transportation Science

SN - 0041-1655

IS - 2

ER -