An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling

Authors:
Elena Marchiori;Adri Steenbeek
Affiliations:
-;-
Venue:
Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
Year:
2000

Citing 3
Cited 12

A Lagrangian-based heuristic for large-scale set covering problems

Mathematical Programming: Series A and B - Special issue on computational integer programming
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Heuristic Algorithm for the Set Covering Problem

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization

Exploiting Fitness Distance Correlation of Set Covering Problems

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Crew Pairing Optimization with Genetic Algorithms

SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
Parallel Ant System for the Set Covering Problem

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Clustering Metagenome Short Reads Using Weighted Proteins

EvoBIO '09 Proceedings of the 7th European Conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
Evidence-Based Clustering of Reads and Taxonomic Analysis of Metagenomic Data

PRIB '09 Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics
Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates

Computers and Operations Research
Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm

Journal of Systems and Software
Iterated ants: an experimental study for the quadratic assignment problem

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
A probabilistic learning approach for counterexample guided abstraction refinement

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times

Expert Systems with Applications: An International Journal
Set covering with almost consecutive ones property

Discrete Optimization
An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The set covering problem is a paradigmatic NP-hard combinatorial optimization problem which is used as model in relevant applications, in particular crew scheduling in airline and mass-transit companies. This paper is concerned with the approximated solution of large scale set covering problems arising from crew scheduling in airline companies. We propose an adaptive heuristic-based evolutionary algorithm whose main ingredient is amechanism for selecting a small core subproblem which is dynamically updated during the execution. This mechanism allows the algorithm to find covers of good quality in rather short time. Experiments conducted on real-world benchmark instances from crew scheduling in airline companies yield results which are competitive with those obtained by other commercial/academic systems, indicating the effectiveness of our approach for dealing with large scale set covering problems.