Veuillez utiliser cette adresse pour citer ce document : https://di.univ-blida.dz/jspui/handle/123456789/27446
Affichage complet
Élément Dublin CoreValeurLangue
dc.contributor.authorOuldyahia, Kahina-
dc.contributor.authorBoudjemaa, Redoune (Promoteur)-
dc.date.accessioned2024-01-10T13:15:25Z-
dc.date.available2024-01-10T13:15:25Z-
dc.date.issued2023-07-
dc.identifier.urihttps://di.univ-blida.dz/jspui/handle/123456789/27446-
dc.descriptionill., Bibliogr. Cote:ma-510-171fr_FR
dc.description.abstractThe objective of this work is to use a NonLinear programming based optimization model for ATM cash replenishment that: 1. Minimizes the total cost of cash replenishment while ensuring that all ATMs have adequate cash levels. 2. Takes into account factors like ATM usage patterns, cash demand, cash storage capacity, and budget constraints. 3. Can be implemented in real-world ATM networks to reduce operational costs and improve cash management. This study focuses on establishing a conceptual frame work for optimizing the cost of cash replenishment for networks of ATMs and minimizing the cash-dry instances at individual ATM. The objective is to minimize the total cost of logistics, inventory, and improving customer service satisfaction. This approach considers the combination of following techniques: - Time series forecasting accounting for seasonality, trend and local calendar events - Inventory theory – determining frequency and quantity of cash to be replenished for each ATM .fr_FR
dc.language.isoenfr_FR
dc.publisherUniversité Blida 1fr_FR
dc.subjectNonlinear programmingfr_FR
dc.subjectATM Cash Replenishmentfr_FR
dc.subjectcash demandfr_FR
dc.subjectcash storage capacityfr_FR
dc.subjectcash replenishmentfr_FR
dc.titleOptimizing ATM Cash Replenishment using nonlinear programmingfr_FR
dc.typeThesisfr_FR
Collection(s) :Mémoires de Master

Fichier(s) constituant ce document :
Fichier Description TailleFormat 
Ouldyahia Kahina.pdf759,18 kBAdobe PDFVoir/Ouvrir


Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.