Solving a large-scaled crew pairing problem by using a genetic algorithm

Authors:
Taejin Park;Kwang Ryel Ryu
Affiliations:
Department of Computer Engineering, Pusan National University, Kumjeong-Ku, Busan, Korea;Department of Computer Engineering, Pusan National University, Kumjeong-Ku, Busan, Korea
Venue:
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Year:
2006

Citing 2
Cited 2

Genetic algorithms with sharing for multimodal function optimization

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research

Multiobjective genetic algorithm to solve the train crew scheduling problem

ISTASC'10 Proceedings of the 10th WSEAS international conference on Systems theory and scientific computation
Ant colony optimization-based algorithm for airline crew scheduling problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for a crew pairing optimization, which is an essential part of crew scheduling. The algorithm first generates many pairings and then finds their best subset by a genetic algorithm which incorporates unexpressed genes. The genetic algorithm used employs greedy crossover and mutation operators specially designed to work with chromosomes of set-oriented representation. As a means of overcoming the premature convergence problem caused by greedy genetic operators, the chromosome is made up of an expressed part and an unexpressed part. The presented method was tested on real crew scheduling data.