@conference { ISI:000392439200051,
	title = {Configuration of Daily Demand Predicting System Based on Neural Networks},
	booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)},
	year = {2016},
	note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016},
	publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	abstract = {Having a clear vision about future demand is a crucial key to enhance the commercial competitiveness to any efficient supply chain. However, demand forecasting is certainly not an easy task for a manager who had the choice between using traditional forecasting techniques encompassing time series methods, causal methods or simulation methods, or techniques based on artificial intelligence like artificial neural networks (ANNs), fuzzy logic or adaptive neuro fuzzy inference system (ANFIS). This paper focuses on the implementation and configuration of the artificial intelligence of neural networks, and more precisely the multi layer perceptron{\textquoteright}s structure, as a prediction system to produce daily demand forecasts based on historical demand information. The results indicate that adding new inputs to the neural network, in our case study, has a positive impact on the accuracy of the short term demand forecasting. In the numerical experimentation, the effectiveness of the proposed model is validated using is validated using a real-world data of a leader supermarket in Morocco.},
	isbn = {978-1-4673-8571-8},
	author = {Slimani, Ilham and El Farissi, Ilhame and Achchab, Said},
	editor = {Alaoui, AE and Benadada, Y and Boukachour, J}
}
@conference { ISI:000392439200016,
	title = {Generalization of capacitated p-median location problem: modeling and resolution},
	booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)},
	year = {2016},
	note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016},
	publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	abstract = {The capacitated p-median location problem (CPMP) is very famous in literature and widely used within industry scope. However, in some cases, this location problem variant has poor management of capacity resources. In fact, the capacity used by facilities is fixed and not dependent on customers{\textquoteright} demands. The budget constraint Multi-Capacitated Location Problem (MCLP), considered in that paper, is a generalization of the CPMP problem, it is characterized by allowing each facility to be open with different capacities. In this paper, we will discuss the mathematical modeling of the MCLP problem, then we suggest adapted solving methods. To do this, we propose to solve the MCLP problem using Branch and Cut method. This exact solving method well-known, will serve us to test and validate our new problem formulation. Then we will build one heuristic algorithm, well adapted to our problem, it will be called GCDF (Greatest Customer Demand First). For improving solution quality, the LNS method will complete the GCDF. Computational results are presented at the end using instances that we have created under some criteria of difficulties or adapted from those of p-median problems available in literature. The GCDF{*} (GCDF improved) algorithm is fast and provides good results for most degree of difficulty instances, but it is unreliable for very specific cases. To remedy this problem, the method must start with a basic feasible solution determined by one of the reliable method such as Branch and Bound.},
	isbn = {978-1-4673-8571-8},
	author = {El Amrani, Mohammed and Benadada, Youssef and Gendron, Bernard},
	editor = {Alaoui, AE and Benadada, Y and Boukachour, J}
}
@conference { ISI:000392439200065,
	title = {A literature review on the full truckload vehicle routing problems},
	booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)},
	year = {2016},
	note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016},
	publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	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.},
	isbn = {978-1-4673-8571-8},
	author = {Annouch, Anouar and Bouyahyaoui, Karim and Bellabdaoui, Adil},
	editor = {Alaoui, AE and Benadada, Y and Boukachour, J}
}
@conference { ISI:000392439200048,
	title = {Multi period dynamic vehicles routing problem: literature review, modelization and resolution},
	booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)},
	year = {2016},
	note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016},
	publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	abstract = {Being member of the VRP family, the Dynamic VRP (DVRP) has been a topic of interest in the realm of research, especially in the last decade. The steps of resolution were based on various approaches, ranging from the exact meta-heuristic to customized methods. This paper presents a literature review of the DVRP by classifying relevant studies according to the adopted approach of resolution. The dynamic extension of a version already present in the literature of the turned VRP multi classical is described then. A mathematical modeling is proposed for this extension. For the resolution of our problem, we adopted an approach based on the system of the colony of ants.},
	isbn = {978-1-4673-8571-8},
	author = {Ouaddi, Khaoula and Benadada, Youssef and Mhada, Fatima-Zahra},
	editor = {Alaoui, AE and Benadada, Y and Boukachour, J}
}
@conference { ISI:000392439200021,
	title = {New approaches for solving the container stacking problem},
	booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)},
	year = {2016},
	note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016},
	publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	abstract = {Containers shipment has grown very fast during the last ten years, in Tanger Med port for example, 3Millions containers (80\% in transshipment) TEUs (Twenty feet equivalent unit) has been changed during 2015 (Tanger Med Port authority {\textquoteleft}{\textquoteleft}TMPA{{\textquoteright}{\textquoteright}} study March{\textquoteright} 2016 {[} 1]), which correspond to an increase of 40\% comparing with the last study made in 2012. Thus, our study will deal with the port management and the improvement of the operations processes. The aim of this paper is to define a new strategies to solve the container stacking problem (CSP) using an approach of optimization. Thus we define a new MIP (Mathematical Integer Program) to deal with the operational tasks in a containers terminal. In which we optimize the number of the stacks used to store a given number of inbound containers and also we minimize the related cost of the traveling distance for inbound containers between the sea side and the yard side. This paper is organized as follow: we introduce and locate first our problem, then we present the literature review of the CSP. The problem definition and the MIP introduction will be the subject of the next section, and we finish by presenting the findings and the future perspectives. As a proposed resolution approach for our MIP, we propose a developed genetic algorithm strategy (DGAS) as a metaheuristic and the Branch \& Cut (B\&C) as an exact method. Our main objective is to avoid reshuffles and to find out the best yard configuration to store inbound containers. The DGAS will be applied to an existing instances in the literature, and the obtained numerical results is compared with the Cplex results (B\&C). The main inputs for our proposed framework are the height, weight, destination, type containers \& yard bays, and the expected departure time (EDT). Our objective at the end is to have an optimized guide to the planners to easily define the unloading plan and the storage position for each container, giving an initial stacking state and a container demand.},
	isbn = {978-1-4673-8571-8},
	author = {Razouk, Chafik and Benadada, Youssef and Boukachour, Jaouad},
	editor = {Alaoui, AE and Benadada, Y and Boukachour, J}
}
@conference { ISI:000392439200017,
	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{\textquoteright}16)},
	year = {2016},
	note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016},
	publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	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 (STCX), and swap mutation operator new individuals are generated. Finally, we give a numerical example on a randomly generated instance to illustrate our approach.},
	isbn = {978-1-4673-8571-8},
	author = {El Bouyahyiouy, Karim and Bellabdaoui, Adil},
	editor = {Alaoui, AE and Benadada, Y and Boukachour, J}
}
@conference { ISI:000392439200025,
	title = {Particle swarm optimization with a mutation operator for solving the preventive aircraft maintenance routing problem},
	booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)},
	year = {2016},
	note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016},
	publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	abstract = {Aircraft Maintenance Routing (AMR) is one of the major optimization problems in the airline industry. In this study, we present a mathematical formulation for the daily AMR problem which aims to minimize the risk of both scheduled and non-scheduled maintenance costs. Exact methods may fail to deal with such problems. Our contribution is then to examine the use of an improved particle swarm optimization (PSO) algorithm by a uniform mutation operator for solving this probabilistic problem. Computational results show that our hybrid approach gives competitive results comparing to the native binary PSO.},
	isbn = {978-1-4673-8571-8},
	author = {Sarhani, Malek and Ezzinbi, Omar and El Afia, Abdellatif and Benadada, Youssef},
	editor = {Alaoui, AE and Benadada, Y and Boukachour, J}
}
@conference { ISI:000392439200033,
	title = {Proposal of a modeling approach and a set of KPI to the drug supply chain within the hospital},
	booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)},
	year = {2016},
	note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016},
	publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	abstract = {The hospital is a complex system where many actors are involved; The challenges that this environment is facing justify the focus on this research subject. The contribution of the paper includes a proposition of a four-level model, that describes the hospital drug supply chain, based on the combination of the Supply Chain Operation Reference (SCOR) and Business Process Modelling Notation (BPMN), and the identification of a set of key performance indicators (KPI) that assess how well the drugs management process within the hospital are effective and efficient and how to improve them.},
	isbn = {978-1-4673-8571-8},
	author = {Mezouar, Houda and El Afia, Abdellatif and Chiheb, Radouane and Ouzayd, Fatima},
	editor = {Alaoui, AE and Benadada, Y and Boukachour, J}
}
@conference { ISI:000392439200008,
	title = {Strategic planning problem represented by a three-echelon logistics network-modeling and solving},
	booktitle = {PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL{\textquoteright}16)},
	year = {2016},
	note = {3rd IEEE International Conference on Logistics Operations Management (GOL), Fes, MOROCCO, MAY 23-25, 2016},
	publisher = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	organization = {Sidi Mohammed Ben Abdellah Univ Fes, Fac Sci \& Technol; Mohammed V Univ Rabat, ENSIAS Sch; Univ Havre; IEEE},
	abstract = {This article aims to elaborate a strategic plan allowing to decision makers to take right decisions (Selecting suppliers, Selecting plants that can produce a specific product, ..) in the right moment in order to minimize the generated costs. Our work consists, then to optimize a multi-scales and multi-periods location-distribution problem. The problem belongs to the FLNP family with a complexity of order of NP-difficult. The objective of our problem MIP is to maximize the incomes of a production company via the minimization of costs: the cost of supplying, the cost of producing and the cost of transportation. Several aspects would be treated in this subject: the horizon of planning -multi-periods and the structure of network (multi-echelons). Based on the limits of exact methods, we have proposed to resolve this problem on the basis of a heuristic method, the choice which seems to be the most adequate for our problem is LNS (Large Neighborhood Search). It is in this perspective that we have reformulated our model {[}12] in order to be represented under the form of a logistic network based on paths before the application of LNS.},
	isbn = {978-1-4673-8571-8},
	author = {Hamada, Yahya and Benadada, Youssef and Gendron, Bernard},
	editor = {Alaoui, AE and Benadada, Y and Boukachour, J}
}
