Please use this identifier to cite or link to this item: http://dspace.ensta.edu.dz/jspui/handle/123456789/368
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTAIBAOUI, Mohammed-
dc.contributor.authorTALMAT, Amin Mohamed-
dc.date.accessioned2025-04-15T10:56:29Z-
dc.date.available2025-04-15T10:56:29Z-
dc.date.issued2024-
dc.identifier.urihttp://dspace.ensta.edu.dz/jspui/handle/123456789/368-
dc.descriptionMémoire de fin d’étude Master : ingénierie des transport- Alger : Ecole Nationale Supérieure des Technologie Avancées (ex ENST) :2024en_US
dc.description.abstractThe problem of crew scheduling in airlines has received considerable attention in recent years. This problem is often broken down into two steps due to its large size and increasing complexity, first crew pairing, then crew assignment. This work focuses on the crew pairing problem, also known as "CPP ", which is an essential part in crew planning and consists of creating sequences (pairings) of flights, where the company Air Algeria encounters difficulties which require a lot of time to solve this problem in a feasible manner. The objective is to apply machine learning models in solving this problem in order to optimize the use of crews. At first, we tried some machine learning methods, but the results obtained weren't as good, so we used the Machine Learning methods to reduce the complexity of the problem instead by splitting the data, then suggested an algorithm that gave much better and feasible resultsen_US
dc.language.isoenen_US
dc.publisherENSTAen_US
dc.subjectMachine Learningen_US
dc.subjectcrew pairing problemen_US
dc.subjectclusteringen_US
dc.subjectoptimizationen_US
dc.titleSmart Staffing Machine Learning for optimizing crew schedulingen_US
dc.typeArticleen_US
Appears in Collections:ART-Ingénierie des Transports

Files in This Item:
File Description SizeFormat 
MFE_2024_IT_TAIBAOUI_Mohammed_TALMAT_Amin_Mohamed (1) - REZKI Nafissa.pdfMémoire de Master211.74 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.