Airline crew pairing problem and meta-heuristics

Graduate Thesis uoadl:1324459 611 Read counter

Unit:
Τομέας Υπολογιστικών Συστημάτων και Εφαρμογών
Library of the School of Science
Deposit date:
2016-07-12
Year:
2016
Author:
Καράλης Νικόλαος
Supervisors info:
Παναγιώτης Σταματόπουλος
Original Title:
Airline crew pairing problem and meta-heuristics
Languages:
English
Translated title:
Το πρόβλημα της δημιουργίας ανώνυμων συνδυασμών πτήσεων αεροπορικών εταιρειών και μετα-ευρετικοί αλγόριθμοι
Summary:
The airline crew pairing is a problem of great economical importance to the
airline companies. In this thesis the most common meta-heuristics that are used
to solve the problem are presented. Moreover, different genetic algorithms were
implemented in order to solve the problem. The implementations were tested on
the data sets of Beasley and Chu.
Keywords:
Airline Crew Pairing Problem, Genetic Algorithms, Meta-heuristics, Set Partitioning Problem, Set Covering Problem
Index:
Yes
Number of index pages:
9, 10, 11, 36
Contains images:
Yes
Number of references:
15
Number of pages:
37
document.pdf (389 KB) Open in new window