Hybrid algorithm of tabu search and integer programming for the railway crew scheduling problem

Cabrera G. Guillermo, Miguel Rubio L. José

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

The Crew Scheduling Problem (CSP) is an important problem for the transportation enterprises, especially when crew's cost is increasing. This justifies the researcher's effort in order to create algorithms which obtain good solutions for this kind of problems. Particularly, hybrid algorithms appear as an efficient alternative in order to solve any combinatorial optimization problem. Tabu Search (TS) is a simple metaheuristic which has been applied in many combinatorial problems, obtaining very competitive solutions. Integer Programming (IP), in this case, allows to the TS algorithm to have a good level of diversification, avoiding that it's converge to local optimal solutions. In this article we presents an hybrid algorithm of Tabu Search and Integer Programming which is applied to the both CSP instances obtained from the literature and a real application case in Chile (MERVAL). The hybrid algorithm obtains good solutions in both cases, and obtains an important minimization in the execution time in the MERVAL case.

Original languageEnglish
Title of host publicationPACIIA 2009 - 2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications
Pages413-416
Number of pages4
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications, PACIIA 2009 - Wuhan, China
Duration: 28 Nov 200929 Nov 2009

Publication series

NamePACIIA 2009 - 2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications
Volume2

Conference

Conference2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications, PACIIA 2009
Country/TerritoryChina
CityWuhan
Period28/11/0929/11/09

Keywords

  • Crew scheduling problem
  • Hybrid algorithms
  • Integer programming
  • Tabu search

Fingerprint

Dive into the research topics of 'Hybrid algorithm of tabu search and integer programming for the railway crew scheduling problem'. Together they form a unique fingerprint.

Cite this