@article {BenRabia2022,
	title = {Simulation-based analytics: A systematic literature review},
	journal = {Simulation Modelling Practice and Theory},
	volume = {117},
	year = {2022},
	note = {cited By 1},
	abstract = {Over time, Decision Support Systems have helped decision makers solve complex problems through Operational Research and Simulation. Nowadays, data explosion is having a profound effect on the ways in which many sectors operate. This advent of massive data gives rise to new concepts and requires new methods and analysis tools. In this paper, we highlight the role of simulation in Business Analytics. In a framework-based analytics, simulation is a technique that can be incorporated into predictive or prescriptive stage. For that, we have posed research questions to limit results to what give a comprehensive description of models, techniques and architectures used in the hybridization between simulation and business analytics. The presented analyses confirm that simulation remains an indispensable mechanism for adding value to analytics project and the coupling between the two techniques is in its embryonic phase. A conclusion presented prospects and future improvements found during the writing of the research. {\textcopyright} 2022 Elsevier B.V.},
	keywords = {Artificial intelligence, Big data, Business analytics, Competitive intelligence, Data Analytics, Data driven decision, Data-driven decision making, Decision making, Decision support systems, Decisions makings, Model-driven, Model-driven decision making, Predictive analytics, Simulation \& analytic ops, Systematic literature review, What-if Analysis},
	doi = {10.1016/j.simpat.2022.102511},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85125647406\&doi=10.1016\%2fj.simpat.2022.102511\&partnerID=40\&md5=b8a2d6f53d7e2a53c6c1e7675770c74b},
	author = {Ben Rabia, M.A. and Bellabdaoui, A.}
}
@article {Annouch2021607,
	title = {An Adaptive Genetic Algorithm for a New Variant of the Gas Cylinders Open Split Delivery and Pickup with Two-dimensional Loading Constraints},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {12},
	number = {1},
	year = {2021},
	note = {cited By 1},
	pages = {607-619},
	abstract = {This paper studies a combination of two well-known problems in distribution logistics, which are the truck loading problem and the vehicle routing problem. In our context, a customer daily demand exceeds the truck capacity. As a result, the demand has to be split into several routes. In addition, it is required to assign customers to depots, which means that each customer is visited just once by any truck in the fleet. Moreover, we take into consideration a customer time windows. The studied problem can be defined as a Multi-depots open split delivery and pickup vehicle routing problem with two-dimensional loading constraints and time windows (2L-MD-OSPDTW). A mathematical formulation of the problem is proposed as a mixed-integer linear programming model. Then, a set of four class instances is used in a way that reflects the real-life case study. Furthermore, a genetic algorithm is proposed to solve a large scale dataset. Finally, preliminary results are reported and show that the MILP performs very well for small test instances while the genetic algorithm can be efficiently used to solve the problem for a widereaching test instances. {\textcopyright} 2021. All rights reserved.},
	keywords = {Adaptive genetic algorithms, Constraint programming, Fleet operations, Genetic algorithms, Integer programming, Large dataset, Loading constraints, Multi depots, Pickups, Routing algorithms, Sales, Split delivery, Split pickups, Test instances, Time windows, Trucks, Two-dimensional, Two-dimensional loading, Vehicle routing, Vehicle Routing Problems},
	doi = {10.14569/IJACSA.2021.0120170},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100379461\&doi=10.14569\%2fIJACSA.2021.0120170\&partnerID=40\&md5=7e2a6546b01de8c70b8cca5545b09a4e},
	author = {Annouch, A. and Bellabdaoui, A.}
}
@article {ElBouyahyiouy2021471,
	title = {A mixed-integer linear programming model for the selective full-truckload multi-depot vehicle routing problem with time windows},
	journal = {Decision Science Letters},
	volume = {10},
	number = {4},
	year = {2021},
	note = {cited By 0},
	pages = {471-486},
	abstract = {This article has studied a full truckload transportation problem in the context of an empty return scenario, particularly an order selection and vehicle routing problem with full truckload, multiple depots and time windows (SFTMDVRPTW). The aim is to develop a solution where a set of truck routes serves a subset of selected transportation demands from a number of full truckload orders to maximize the total profit obtained from those orders. Each truck route is a chain of selected demands to serve, originating at a departure point and terminating at an arriving point of trucks in a way that respects the constraints of availability and time windows. It is not mandatory to serve all orders, and only the profitable ones are selected. In this study, we have formulated the SFTMDVRPTW as a mixed-integer linear programming (MILP) model. Finally, Computational results are conducted on a new data set that contains thirty randomly generated problem instances ranging from 16 to 30 orders using the CPLEX software. The findings prove that our model has provided good solutions in a reasonable time. {\textcopyright} 2021 by the authors; licensee Growing Science, Canada.},
	doi = {10.5267/j.dsl.2021.7.002},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85112687868\&doi=10.5267\%2fj.dsl.2021.7.002\&partnerID=40\&md5=4d2359491776b4902b7e1f3c680db9fc},
	author = {El Bouyahyiouy, K. and Bellabdaoui, A.}
}
@conference {Mouncif2020,
	title = {Blood collection supply chain management: A critical review and future perspective},
	booktitle = {6th International Conference on Optimization and Applications, ICOA 2020 - Proceedings},
	year = {2020},
	note = {cited By 0},
	abstract = {Blood supply chain is an essential part of modern healthcare system, and an appropriate feeding of blood units and blood products is necessary for several care treatments and surgeries. Any improvement in the management of these chains will guarantee an adequate blood availability to meet the demand and save lives. The applications of operational research and management science techniques enable decision makers to come up with better and more efficient decisions for a wide range of problems in blood transfusion. Various papers on blood collection management, dealing with different problems and constraints, have been proposed in the literature. The purpose of this paper is to integrate the topic in recent research on blood collection management and try to create awareness for a deeper knowledge on blood collection and donation issues. In this paper, we systematically analyze and classify existing studies, addressing various cases, in order to highlight opportunities and to open practical future research directions for operational research and management science about optimization of blood collection. {\textcopyright} 2020 IEEE.},
	keywords = {Blood, Blood collection, Blood transfusion, Decision makers, Decision making, Future perspectives, Future research directions, Health-care system, Operational research, Recent researches, Supply chain management},
	doi = {10.1109/ICOA49421.2020.9094514},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085745137\&doi=10.1109\%2fICOA49421.2020.9094514\&partnerID=40\&md5=1d84b86d8dc5c94a6ed1a1437e4f86c3},
	author = {Mouncif, C. and Bellabdaoui, A.}
}
@conference {Rabia2020,
	title = {Simulation as a decision-making tool in a business analytics environment},
	booktitle = {Proceedings - 2020 5th International Conference on Logistics Operations Management, GOL 2020},
	year = {2020},
	note = {cited By 0},
	abstract = {Nowadays, Business Intelligence (BI) plays a key role in the decision-making chain because of what it offers in terms of data availability, structuring, analysis and presentation in the form of dashboards or Key Performance Indicators (KPI) to assist decision-making. Despite its advantages in terms of historicizing the company{\textquoteright}s activity, traditional BI tools do not allow us to project our business into the future and evaluate the impact of a decision on the entire activity of a company. Given this consideration, What-if analysis positions itself as a data-intensive simulation to examine the impact of a decision. In this article, we intend to highlight the role that simulation techniques can play in prescriptive analysis. Then, we present the different architectures that combine the use of simulation in an analytical environment. Finally, we also provide an idea of the future perspectives and challenges in simulation-based analytics. {\textcopyright} 2020 IEEE.},
	keywords = {Advanced Analytics, Benchmarking, Business analytics, Data availability, Data intensive, Decision making, Decision making tool, Future perspectives, Key performance indicators, Simulation technique, What-if Analysis},
	doi = {10.1109/GOL49479.2020.9314725},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100164050\&doi=10.1109\%2fGOL49479.2020.9314725\&partnerID=40\&md5=03afaf905e87539e719dc12b27acd09d},
	author = {Rabia, M.A.B. and Bellabdaoui, A.}
}
@conference {Saoud2018211,
	title = {DSS design for carrier collaboration using Big graph IOT},
	booktitle = {2018 International Colloquium on Logistics and Supply Chain Management, LOGISTIQUA 2018},
	year = {2018},
	pages = {211-215},
	doi = {10.1109/LOGISTIQUA.2018.8428266},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85052499129\&doi=10.1109\%2fLOGISTIQUA.2018.8428266\&partnerID=40\&md5=d4b142cb74b25e7b0dc1343eab03f24b},
	author = {Saoud, A. and Bellabdaoui, A.}
}
@conference {ElBouyahyiouy2017142,
	title = {An ant colony optimization algorithm for solving the full truckload vehicle routing problem with profit},
	booktitle = {2017 International Colloquium on Logistics and Supply Chain Management: Competitiveness and Innovation in Automobile and Aeronautics Industries, LOGISTIQUA 2017},
	year = {2017},
	note = {cited By 0},
	pages = {142-147},
	abstract = {This paper proposes an ant colony optimization (ACO) to solve the full-truckload selective multi-depot vehicle routing problem under time windows constraints (denoted by FT-SMDVRPTW). The objective is to construct a solution composed of a set of routes associated with the trucks, aiming at maximizing the total profit. Each order is a pickup and delivery order associated with an origin, a destination, two time windows, and a price for serving the order paid by its corresponding shipper. Each route is a sequence of selected orders to serve so that the operational constraints are respected. Our problem appears clearly when the vehicles return back. It is not obligatory to serve all orders. The motivation of this study is to solve this problem by using an ant colony optimization metaheuristic, called ant colony system, which was originally implemented for solving the basic vehicle routing problem (VRP). We modify the algorithm to incorporate a robust optimization methodology, so that the full truckload can be handled. Finally, we give a numerical example on a randomly generated instance to illustrate our approach. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/LOGISTIQUA.2017.7962888},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026628672\&doi=10.1109\%2fLOGISTIQUA.2017.7962888\&partnerID=40\&md5=88873263b0addef95537c20e4fe48482},
	author = {El Bouyahyiouy, K. and Bellabdaoui, A.}
}
@conference {Elkhyari201719,
	title = {Combining constraint programming and genetic algorithm for dynamic scheduling problems},
	booktitle = {2017 International Colloquium on Logistics and Supply Chain Management: Competitiveness and Innovation in Automobile and Aeronautics Industries, LOGISTIQUA 2017},
	year = {2017},
	note = {cited By 0},
	pages = {19-24},
	abstract = {This paper introduces a new method based on constraint programming (CP) and genetic algorithm (GA) for solving dynamic scheduling problems. The proposed approach allows us to handle scheduling problems with large sizes (i.e. search spaces are too large). Our idea is to break up the search space into disjoined sub-spaces by the genetic algorithm. To each individual of the population is associated a sub-space. Each sub-space is represented by a sub-CSP which is easier to solve than the original scheduling problem. Our first experimentations are addressed to the Endoscopy Unit scheduling in dynamic way. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/LOGISTIQUA.2017.7962867},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026635770\&doi=10.1109\%2fLOGISTIQUA.2017.7962867\&partnerID=40\&md5=4564dfc4f2b976af00a026b36127e625},
	author = {Elkhyari, A. and Bellabdaoui, A.}
}
@article {Abbassi2017210,
	title = {A hybrid algorithm for vehicle routing problem with time windows and target time},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {95},
	number = {1},
	year = {2017},
	note = {cited By 1},
	pages = {210-219},
	abstract = {The routing of a fleet of vehicles to service a set of customers is important in the field of goods distribution. Vehicle routing problem with time windows (VRPTW) is a well-known combinatorial problem. This article aims at studying the vehicle routing problem with time windows and target time (VRPTWTT). VRPTWTT involves the routing of a set of vehicles with limited capacity from a central depot to a set of geographically dispersed customers with known demands and predefined time windows as well as a target time. There are penalties associated with servicing either earlier or later than this target servicing time. The goal is to minimize the costs of transport and penalties of delay and ahead of time. Although VRPTWTT is a new variant of the VRP with time windows, the problem is not easy to solve, and it is also NP-hard. To solve the VRPTWTT, we propose a hybrid method combining Neighborhood search with Ant Colony Optimization Algorithm (ACO). Furthermore, when ACO is close to current optimal solution, neighborhood search is used to maintain the diversity of ACO and explore new solutions. First, we present a description of the hybrid method followed by computational results and the conclusion. {\textcopyright} 2005 - 2017 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010188946\&partnerID=40\&md5=ab0a6c69de17f1da6b246486211ec193},
	author = {Abbassi, A. and El Bouyahyiouy, K. and El Hilali Alaoui, A. and Bellabdaoui, A.}
}
@conference {Saoud2017160,
	title = {Model of distributed hierarchical framework for carrier collaboration},
	booktitle = {2017 International Colloquium on Logistics and Supply Chain Management: Competitiveness and Innovation in Automobile and Aeronautics Industries, LOGISTIQUA 2017},
	year = {2017},
	note = {cited By 0},
	pages = {160-165},
	abstract = {The supply chain is considered as a network composed of heterogeneous structures geographically distributed, that processes a large volume of data which change instantly; it makes the task of logistics deciders very complex, hence the need for distributed intelligent systems, which provide services capable of absorbing the complexity of such networks, and meet the expectations of logistics managers. In this paper, we will present the most recently used systems as intelligent transport systems or even collaborative systems between transport providers, such as multi-agent systems, the physical internet and the Internet of things. Our contribution in this paper concerns the proposal of a distributed hierarchical framework model, composed of four layers, and which will aim at the creation of a collaborative environment for the transport of goods. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/LOGISTIQUA.2017.7962891},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026681402\&doi=10.1109\%2fLOGISTIQUA.2017.7962891\&partnerID=40\&md5=10e3ee726c02ab8cee23cdc521d5ce26},
	author = {Saoud, A. and Bellabdaoui, A.}
}
@article {Benazzouz2017243,
	title = {Planning problems of nurses: Case of a Moroccan healthcare unit},
	journal = {International Journal of Healthcare Management},
	volume = {10},
	number = {4},
	year = {2017},
	note = {cited By 0},
	pages = {243-251},
	abstract = {Healthcare systems are facing the human resources planning{\textquoteright}s problem as a result of the budgets restrictions and the productivity improvement{\textquoteright}s need, while ensuring care services{\textquoteright} quality provided to patients. In this paper, we focus on the nurses{\textquoteright} schedule problem in a hospital center in Morocco. Different works in the last years indicate that this assignment to the different activities must comply with many constraints (professional rules, workload, individual preference, skills, etc.) while optimizing one or several objectives (equity in the work, the costs, etc.). We present a description of the studied service as well as professional rules adopted and a mathematical formulation with a mixed integer linear program (MILP). The problem is solved using the Ceplex software and the nurses{\textquoteright} schedule is presented which achieve the expected balancing of their workloads. {\textcopyright} 2016 Informa UK Limited, trading as Taylor \& Francis Group.},
	doi = {10.1080/20479700.2016.1268797},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006918745\&doi=10.1080\%2f20479700.2016.1268797\&partnerID=40\&md5=17aabb05b509e885f8483f43b518cf24},
	author = {Benazzouz, T. and Echchatbi, A. and Bellabdaoui, A.}
}
@conference {Bernatchou2017177,
	title = {Towards a simulation model of an outpatient chemotherapy unit},
	booktitle = {2017 International Colloquium on Logistics and Supply Chain Management: Competitiveness and Innovation in Automobile and Aeronautics Industries, LOGISTIQUA 2017},
	year = {2017},
	note = {cited By 0},
	pages = {177-182},
	abstract = {This paper presents a case study of a cancer center. A discrete event simulation model with ARENA software was developed to model and analyze the patient flow and evaluate performance through the outpatient chemotherapy unit. Simulation results determine where over-utilization of resources and long waiting times of patient per process. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/LOGISTIQUA.2017.7962894},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026682297\&doi=10.1109\%2fLOGISTIQUA.2017.7962894\&partnerID=40\&md5=a537f15fa482d1d24fe1c3a65dcc4707},
	author = {Bernatchou, M. and Ouzayd, F. and Bellabdaoui, A. and Hamdaoui, M.}
}
@conference {Annouch2017193,
	title = {Variable neighborhood search heuristic for the full truckload problem in liquefied petroleum gas supply},
	booktitle = {2017 International Colloquium on Logistics and Supply Chain Management: Competitiveness and Innovation in Automobile and Aeronautics Industries, LOGISTIQUA 2017},
	year = {2017},
	note = {cited By 0},
	pages = {193-198},
	abstract = {In this paper, we propose a generalized version of the full truckload vehicle routing problem FTVRP in the liquefied petroleum gas (LPG) supply chain. We focus on the supply component that is considered to be the main element of LPG supply chain. The objective consists of determining a schedule of weekly supply which minimizes as well the gas acquisition cost as that of its transport. In order to effectively solve this problem, the mathematical model is established and a neighboring search solution heuristics (VNS) is proposed. The initial solution is generated using a Greedy Algorithm by selecting the most beneficial nodes in terms of transportation cost and gas acquisition cost. In the experiment, different sizes{\textquoteright} problems are used and the numerical results getting with big instance are explored. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/LOGISTIQUA.2017.7962897},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026655256\&doi=10.1109\%2fLOGISTIQUA.2017.7962897\&partnerID=40\&md5=2b385b6056aad92e333bd54bb956201d},
	author = {Annouch, A. and Bellabdaoui, A.}
}
@conference {Sangai201782,
	title = {Workload balancing in nurse scheduling problem: Models and discussion},
	booktitle = {2017 International Colloquium on Logistics and Supply Chain Management: Competitiveness and Innovation in Automobile and Aeronautics Industries, LOGISTIQUA 2017},
	year = {2017},
	note = {cited By 0},
	pages = {82-87},
	abstract = {Nurses planning is a challenging and a complex task that arises daily within healthcare facilities. Establishing rosters that meet both hospital requirements and nurses{\textquoteright} preferences takes a considerable time and cannot be done manually. The equitable distribution of workload is one of the major factors contributing to nurses{\textquoteright} satisfaction and, eventually, the quality of care delivered. However, the authors have given it a limited attention. This paper is threefold, it aims, firstly, to provide a detailed analysis of all the models proposed in the literature and which deal with this issue, compare and evaluate their relevance and effectiveness according to several criteria in order to highlight, lastly, the lines of reflection and action for further contributions. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/LOGISTIQUA.2017.7962878},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026673790\&doi=10.1109\%2fLOGISTIQUA.2017.7962878\&partnerID=40\&md5=ef6863f769d71d67312fb080f1d00096},
	author = {Sangai, J. and Bellabdaoui, A.}
}
@conference {Annouch2016,
	title = {A literature review on the full trackload vehicle routing problems},
	booktitle = {Proceedings of the 3rd IEEE International Conference on Logistics Operations Management, GOL 2016},
	year = {2016},
	note = {cited By 0},
	abstract = {This article presents a literature review of the full truckload vehicle routing problem (FTVRP). In this problem, each vehicle can serve only one order at a time; thereafter, the delivery must be completed before the next request. Our review has considered some papers published between 1983 and 2015 and their classification was based on two main areas: First, the issue discussed with encountered business constraints and the obvious applications in industry. Second, the solution methods, both exact and approached (heuristics and metaheuristics). Some lines for further works are presented as well. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/GOL.2016.7731723},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85002412779\&doi=10.1109\%2fGOL.2016.7731723\&partnerID=40\&md5=9ebb4126ca35885c1a32d508e792ef9d},
	author = {Annouch, A. and Bouyahyaoui, K. and Bellabdaoui, A.}
}
@conference {ElBouyahyiouy2016,
	title = {A new crossover to solve the full truckload vehicle routing problem using genetic algorithm},
	booktitle = {Proceedings of the 3rd IEEE International Conference on Logistics Operations Management, GOL 2016},
	year = {2016},
	note = {cited By 0},
	abstract = {This paper considers the full-truckload selective multi-depot vehicle routing problem under time windows constraints (denoted by FT-SMDVRPTW), which is a generalization of the vehicle routing problem (VRP). Our objective function is to maximize the total profit that the vehicle generates during its trip. In this study, we{\textquoteright}ll present a review of literature about full truckload vehicle routing; we{\textquoteright}ll define the FT-SMDVRPTW that will be resolved via using genetic algorithm. A new complex two-part chromosome is used to represent the solution to our problem. Through a selection based on the elitist method and roulette method, an improved crossover operator called selected two-part chromosome crossover (S-TCX), and swap mutation operator new individuals are generated. Finally, we give a numerical example on a randomly generated instance to illustrate our approach. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/GOL.2016.7731675},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85002262313\&doi=10.1109\%2fGOL.2016.7731675\&partnerID=40\&md5=1920c06e1091fbb7d7c43bf67e4cd65b},
	author = {El Bouyahyiouy, K. and Bellabdaoui, A.}
}
@conference {Annouch2016,
	title = {Split delivery and pickup vehicle routing problem with two-dimensional loading constraints},
	booktitle = {SITA 2016 - 11th International Conference on Intelligent Systems: Theories and Applications},
	year = {2016},
	note = {cited By 0},
	abstract = {In this paper, we address the distribution problem of liquefied petroleum gas (LPG). In particular we are targeting the optimization of pickup and split delivery of gas bottles to a set of customers with loading constraints. The problem combines the loading of a heterogeneous fleet of vehicles through a set of different size racks and then the establishment of divisible deliveries (split delivery: SDVRP). The problem discussed in this paper can be presented as a Multi-depot Two-Loading Split Delivery and Pickup using Heterogeneous fleet of Vehicles with Time Windows vehicle Routing Problem and with Multi-Product (2L-SDP-HVRPTW-MP). After proposing a mathematical formulation for this problem (MILP), we tested our model firstly by a small instances using ILOG CPLEX solver following this by testing and discussing numerical results. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/SITA.2016.7772277},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010366293\&doi=10.1109\%2fSITA.2016.7772277\&partnerID=40\&md5=dcf8e30d18c805be9f705a1c130183cf},
	author = {Annouch, A. and Bellabdaoui, A. and Minkhar, J.}
}
@conference {Annouch2015,
	title = {Gas-filling stations procurement problem with time windows using a heterogeneous fleet of full tankers},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {In this paper, we address the problem of procurement related to the supply of liquefied petroleum gas (LPG). We are interested in the issue of shipping large quantities of bulk gas (butane and propane) from storage terminals to filling stations storage capacities using a fleet of tankers. The procurement goal is the assignment of quantities of gas to be transferred for each filling station; then, the shipping of these quantities with a heterogeneous fleet of tankers which respects the time schedule of those stations. After a review of literature for the classes of vehicle routing problem with backhauls in oil and gas procurement problems, we will present an integer linear programming formulation (ILP), then, we attempt to solve the problem using a solver, following this by testing and discussing results. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358387},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962464691\&doi=10.1109\%2fSITA.2015.7358387\&partnerID=40\&md5=cc982aff48cd7feee13855a979efa66d},
	author = {Annouch, A. and Bellabdaoui, A.}
}
@article { ISI:000335289300002,
	title = {Optimization of inventory levels in the blood transfusion centers in Morocco},
	journal = {TRANSFUSION CLINIQUE ET BIOLOGIQUE},
	volume = {21},
	number = {1},
	year = {2014},
	month = {MAR},
	pages = {15-22},
	abstract = {Purpose of the study. - Improve the flow of quantities of blood products between the different centers to restore the ideal quantities at low cost. Materials and methods. - The problem addressed in this work concerns the balancing inventory levels between blood transfusion centers in Morocco. This problem is characterized by a number of constraints to be taken into account: safety stock, stock ideal proportional balancing of stocks, etc. An integer linear model has been proposed to determine the optimal allocation between different centers. Two variants are examined; the first which aims to minimize the level of inventory loss, the second is to balance the different levels of stock, so that all centers have a level of surplus stock and/or loss proportional to the ideal stock. Results. - Two variants of an integer linear model that determine the optimal allocation between different centers has been proposed and their performance was evaluated by experimental results obtained using a solver commercial. Conclusion. - The results of this study allow us to meet the,goal of PSL availability of sufficient and subsequently the quality of service required blood transfusion. (C) 2013 Elsevier Masson SAS. All rights reserved.},
	issn = {1246-7820},
	doi = {10.1016/j.tracli.2013.10.004},
	author = {Bellabdaoui, A. and Bennis, I. and Saadi, J. and Benajiba, M.}
}
