Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems

Amar Oukil, Hatem Ben Amor, Jacques Desrosiers, Hicham El Gueddari

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances of the multiple-depot vehicle scheduling problem (MDVSP). However difficulties arise when the instances are highly degenerate. Recent research has been devoted to accelerate column generation while remaining within the linear programming framework. This paper presents an efficient approach to solve the linear relaxation of the MDVSP. It combines column generation, preprocessing variable fixing, and stabilization. The outcome shows the great potential of such an approach for degenerate instances.

Original languageEnglish
Pages (from-to)817-834
Number of pages18
JournalComputers and Operations Research
Volume34
Issue number3
DOIs
Publication statusPublished - Mar 2007

Fingerprint

Vehicle Scheduling
Column Generation
Linear programming
Scheduling Problem
Scheduling
Linear Relaxation
Linear Programming Relaxation
Stabilization
Accelerate
Preprocessing
Vehicle scheduling
Column generation

Keywords

  • Column generation
  • Degeneracy
  • Multiple-Depot Vehicle Scheduling Problem
  • Stabilization

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Cite this

Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems. / Oukil, Amar; Amor, Hatem Ben; Desrosiers, Jacques; El Gueddari, Hicham.

In: Computers and Operations Research, Vol. 34, No. 3, 03.2007, p. 817-834.

Research output: Contribution to journalArticle

Oukil, Amar ; Amor, Hatem Ben ; Desrosiers, Jacques ; El Gueddari, Hicham. / Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems. In: Computers and Operations Research. 2007 ; Vol. 34, No. 3. pp. 817-834.
@article{b024a93c50ab4b3ba1038e5984ed3439,
title = "Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems",
abstract = "Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances of the multiple-depot vehicle scheduling problem (MDVSP). However difficulties arise when the instances are highly degenerate. Recent research has been devoted to accelerate column generation while remaining within the linear programming framework. This paper presents an efficient approach to solve the linear relaxation of the MDVSP. It combines column generation, preprocessing variable fixing, and stabilization. The outcome shows the great potential of such an approach for degenerate instances.",
keywords = "Column generation, Degeneracy, Multiple-Depot Vehicle Scheduling Problem, Stabilization",
author = "Amar Oukil and Amor, {Hatem Ben} and Jacques Desrosiers and {El Gueddari}, Hicham",
year = "2007",
month = "3",
doi = "10.1016/j.cor.2005.05.011",
language = "English",
volume = "34",
pages = "817--834",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "3",

}

TY - JOUR

T1 - Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems

AU - Oukil, Amar

AU - Amor, Hatem Ben

AU - Desrosiers, Jacques

AU - El Gueddari, Hicham

PY - 2007/3

Y1 - 2007/3

N2 - Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances of the multiple-depot vehicle scheduling problem (MDVSP). However difficulties arise when the instances are highly degenerate. Recent research has been devoted to accelerate column generation while remaining within the linear programming framework. This paper presents an efficient approach to solve the linear relaxation of the MDVSP. It combines column generation, preprocessing variable fixing, and stabilization. The outcome shows the great potential of such an approach for degenerate instances.

AB - Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances of the multiple-depot vehicle scheduling problem (MDVSP). However difficulties arise when the instances are highly degenerate. Recent research has been devoted to accelerate column generation while remaining within the linear programming framework. This paper presents an efficient approach to solve the linear relaxation of the MDVSP. It combines column generation, preprocessing variable fixing, and stabilization. The outcome shows the great potential of such an approach for degenerate instances.

KW - Column generation

KW - Degeneracy

KW - Multiple-Depot Vehicle Scheduling Problem

KW - Stabilization

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

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

U2 - 10.1016/j.cor.2005.05.011

DO - 10.1016/j.cor.2005.05.011

M3 - Article

AN - SCOPUS:33748453338

VL - 34

SP - 817

EP - 834

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 3

ER -