Application of a Hybrid Genetic Algorithm to Airline Crew Scheduling (1996)
| Venue: | Computers & Operations Research |
| Citations: | 18 - 0 self |
BibTeX
@ARTICLE{Levine96applicationof,
author = {David Levine},
title = {Application of a Hybrid Genetic Algorithm to Airline Crew Scheduling},
journal = {Computers & Operations Research},
year = {1996},
volume = {23},
pages = {547--558}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper discusses the development and application of a hybrid genetic algorithm to airline crew scheduling problems. The hybrid algorithm consists of a steady-state genetic algorithm and a local search heuristic. The hybrid algorithm was tested on a set of forty real-world problems. It found the optimal solution for half the problems, and good solutions for nine others. The results were compared to those obtained with branch-and-cut and branchand -bound algorithms. The branch-and-cut algorithm was significantly more successful than the hybrid algorithm, and the branch-and-bound algorithm slightly better. 1 Introduction Genetic algorithms (GAs) are search algorithms that were developed by John Holland [17]. They are based on an analogy with natural selection and population genetics. One common application of GAs is for finding approximate solutions to difficult optimization problems. In this paper we describe the application of a hybrid GA (a genetic algorithm combined with a local s...
