Please use this identifier to cite or link to this item: http://dspace.ensta.edu.dz/jspui/handle/123456789/353
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDOUZI, Ilham-
dc.contributor.authorMESSOUS Romaissa, Romaissa-
dc.contributor.authorMOULAI, Ratiba (Directeur de thèse)-
dc.date.accessioned2025-04-15T08:49:07Z-
dc.date.available2025-04-15T08:49:07Z-
dc.date.issued2024-
dc.identifier.urihttp://dspace.ensta.edu.dz/jspui/handle/123456789/353-
dc.descriptionMémoire de fin d’étude Master : ingénierie de la chaine logistique- Alger : Ecole Nationale Supérieure des Technologie Avancées (ex ENST) :2024en_US
dc.description.abstractThis article aims to enhance the productivity of Numilog, a logistics and transportation service provider, through two main objectives. The first step involves using traditional forecasting methods to estimate goods flow. These forecasts form the basis for applying artificial intelligence techniques to predict the optimal number of logistics operators needed daily. The second step focuses on developing an algorithm dedicated to optimizing dock allocation within the warehouse. The goal is to select the nearest dock for each order preparation and stock placement operation. The results obtained show a significant improvement in the accuracy of flow forecasts, as well as in the prediction of the number of necessary operators. Additionally, the dock allocation algorithm has reduced the distance traveled, thereby improving logistical efficiencyen_US
dc.language.isoenen_US
dc.publisherENSTAen_US
dc.subjectArtificiel Intelligenceen_US
dc.subjectWarehouseen_US
dc.subjectForecastsen_US
dc.subjectDock Allocationen_US
dc.subjectProductivityen_US
dc.subjectPythonen_US
dc.subjectRen_US
dc.titleOptimization of logistics operator planning and dock allocation in a warehouseen_US
dc.typeArticleen_US
Appears in Collections:ART- Ingénierie de la Chaine Logistique

Files in This Item:
File Description SizeFormat 
MFE_DOUZI_MESSOUS - MOULAI Ratiba.pdfMémoire de Master246.89 kBAdobe PDFView/Open


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