@conference {Berahhou2022,
	title = {Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup, Overtime and Inventory Restriction: Golden Ball Algorithm},
	booktitle = {2022 IEEE 6th International Conference on Logistics Operations Management, GOL 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {This article studies an important and special variant of VRP. The Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup, Overtime and Inventory Restriction (DVRPSDP-OT-IR) and propose an improved Golden Ball Algorithm (GBA) based on soccer concepts to solve the problem. A literature review of the GBA is given. A mathematical model has been proposed for the problem and validated by Cplex solver. A detailed description of the steps of GBA is presented. {\textcopyright} 2022 IEEE.},
	keywords = {DVRP, Dynamic vehicle routing problems, Golden ball algorithm, Inventory restriction, Literature reviews, Overtime, Pickups, Routing algorithms, Vehicle routing, VRPSDP},
	doi = {10.1109/GOL53975.2022.9820268},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135211662\&doi=10.1109\%2fGOL53975.2022.9820268\&partnerID=40\&md5=bee6326e667ddaeea4fde243d4e97f4a},
	author = {Berahhou, A. and Benadada, Y.}
}
@article {Ouaddi2022205,
	title = {Heuristic based on iterative exact method for multi-tour dynamic vehicle routing problem with overtime},
	journal = {International Journal of Logistics Systems and Management},
	volume = {41},
	number = {1-2},
	year = {2022},
	note = {cited By 0},
	pages = {205-224},
	abstract = {In the last two decades, the DVRP has received a very particular interest from researchers. Because of its great utility in modern transport systems, the DVRP is now a very motivating and still attractive line of research for new studies. The complexity of this problem comes from the fact that it belongs to the VRP family in addition to the dynamism of its components. In this article, a very little studied variant of the DVRP is dealt with. This is the multi-tour DVRP with overtime (MTDVRPOT). We treat this problem from a multi-objective point of view, based on a bi-objective mathematical modelling. The first objective is to minimise the total travelled distance, while the second objective is to minimise to maximal performed overtime. A heuristic based on the iterative exact method was proposed to solve this problem. Its principle is to divide the working day into time periods and resolve iteratively the mathematical models. Each mathematical model corresponds to one subproblem of one time period. Copyright {\textcopyright} 2022 Inderscience Enterprises Ltd.},
	doi = {10.1504/IJLSM.2022.120999},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85125744703\&doi=10.1504\%2fIJLSM.2022.120999\&partnerID=40\&md5=57f923c1d5d485989c02ebc34053a4c1},
	author = {Ouaddi, K. and Benadada, Y. and Mhada, F.-Z.}
}
@article {Berahhou2022587,
	title = {Memetic algorithm for the dynamic vehicle routing problem with simultaneous delivery and pickup},
	journal = {International Journal of Industrial Engineering Computations},
	volume = {13},
	number = {4},
	year = {2022},
	note = {cited By 1},
	pages = {587-600},
	abstract = {In recent years, the Vehicle Routing Problem (VRP) has become an important issue for distribution companies. Also, the rapid development of communication means and the appearance of reverse logistics have given rise to new variants of the VRP. This article deals with an important variant of the VRP which is Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup (DVRPSDP), in which new customers appear during the working day and each customer requires simultaneous delivery and pickup. A Memetic Algorithm (MA) that combines Genetic Algorithm (GA) and local search procedure have been proposed to solve the problem. The performance of the algorithm is evaluated with the tests carried out on a set of benchmarks found in the literature. The proposed memetic algorithm is very efficient and gives many good solutions. {\textcopyright} 2022, Growing Science. All rights reserved.},
	doi = {10.5267/j.ijiec.2022.6.001},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85136293713\&doi=10.5267\%2fj.ijiec.2022.6.001\&partnerID=40\&md5=6605c629683175e232e370f5bd495d0c},
	author = {Berahhou, A. and Benadada, Y. and Bouanane, K.}
}
@conference {Abbal2022,
	title = {Multi-level multi-capacitated facility location problem: formulation and resolution.},
	booktitle = {2022 IEEE 6th International Conference on Logistics Operations Management, GOL 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {Facility location problem is one of the most problems studied since the 1950 years; many variants have been introduced in order to deal with real-world problems. In 2016, a new variant was developed to generalize the p-median problem, called {\textquoteright}budget constraint multi-capacitated location problem{\textquoteright} (BMCLP). This paper aims to generalize the BMCLP onto the multi-level, a problem that arises in many scopes as telecommunication, freight transportation, etc. Therefore, we proposed a mathematical formulation as mixed integer, called {\textquoteright}Multi-level multi-capacitated facility location problem{\textquoteright} (MLMCLP) and generated an artificial set of instances in order to validate the new formulation. Finally, we apply the Branch and Cut solving method using the CPLEX solver. The results obtained from the numerical study show the robustness of the proposed formulation. {\textcopyright} 2022 IEEE.},
	keywords = {Branch Cuts, Budget constraint, Budget control, Capacitated facility location problems, Capacitated location, Facilities locations, Freight transportation, Generalisation, Integer programming, Location, Location problems, Multi-capacity, Multilevels, Problem formulation},
	doi = {10.1109/GOL53975.2022.9820242},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135206286\&doi=10.1109\%2fGOL53975.2022.9820242\&partnerID=40\&md5=d5a9b0d02e9e1d7bfa52d2971ac50263},
	author = {Abbal, K. and El Amrani, M. and Benadada, Y.}
}
@conference {Bouanane2022,
	title = {The Multi-Plant Production Routing Problem with Simultaneous Delivery and Pickup and Recycling, under Carbon Cap \& Trade},
	booktitle = {2022 IEEE 6th International Conference on Logistics Operations Management, GOL 2022},
	year = {2022},
	note = {cited By 0},
	abstract = {The Production Routing Problem with Simultaneous Delivery and Pickup (PRPSDP) is an integrated supply chain planning model which considers production, inventory, distribution, and routing decisions simultaneously, and which is tackled in a Reverse Logistics context. In this paper, we study the multiple plants version of the PRPSDP with integrating recycling activities. We describe the problem and illustrate it through a network flow representation, and then we aim to provide a mathematical modeling that optimizes available supply chain resources and in which we add carbon Cap-and-Trade emissions mechanism at an overall goal of minimizing total operational cost of the system. {\textcopyright} 2022 IEEE.},
	keywords = {Cap \& trade policy, Carbon, Commerce, Integrated supply chain, Multi-plants, Multiple plant, Pickups, Plant production, Production routing problem, Recycling, Reverse logistics, Routing problems, Simultaneous delivery and pickup, Supply chains, Trade policies},
	doi = {10.1109/GOL53975.2022.9820168},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135228716\&doi=10.1109\%2fGOL53975.2022.9820168\&partnerID=40\&md5=aca16b736a85a12516f0613972b1c5dd},
	author = {Bouanane, K. and Benadada, Y.}
}
@article {Bouanane202277,
	title = {The vehicle routing problem with simultaneous delivery and pickup: A taxonomic survey},
	journal = {International Journal of Logistics Systems and Management},
	volume = {41},
	number = {1-2},
	year = {2022},
	note = {cited By 0},
	pages = {77-119},
	abstract = {In recent years, the vehicle routing problem with simultaneous delivery and pickup (VRPSDP) and its variants, which consist of a study field closely related to the reverse logistics, are becoming much more prevalent and more frequently studied. However, the problem features and assumptions diversify considerably and no literature review has classified the existing studies. The main contributions of this paper are: 1) to define the VRPSDP{\textquoteright}s field in its entirety; 2) to accomplish an all-encompassing taxonomic classification of the VRPSDP literature published since 1989; 3) to delimit all of VRPSDP{\textquoteright}s facets parsimoniously. Proposing an adapted taxonomy, we classify 191 papers and categorise the trends in the VRPSDP literature. Copyright {\textcopyright} 2022 Inderscience Enterprises Ltd.},
	doi = {10.1504/IJLSM.2022.120982},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85125709767\&doi=10.1504\%2fIJLSM.2022.120982\&partnerID=40\&md5=2c0c42404fd11b4e4c7608472b979cbd},
	author = {Bouanane, K. and El Amrani, M. and Benadada, Y.}
}
@conference {Abbal2020,
	title = {Bi-level multi-capacitated facility location problem},
	booktitle = {Proceedings - 2020 5th International Conference on Logistics Operations Management, GOL 2020},
	year = {2020},
	note = {cited By 1},
	abstract = {Facility location problems can be considered as a century-old science. Studies on this subject began in the 1950s and are still relevant today. In 2016, a new variant of the location problems, called {\textquoteright}budget constraint multi-capacitated location problem{\textquoteright} (BMCLP), is published to generalize the p-median one. In this work, we propose a generalization of the BMCLP into a bilevel location problem (plants-depots and depots-customers) in order to consider, the modern supply chain constraints. We therefore established a mathematical formulation for the new problem, named {\textquoteright}bi-level multi-capacitated facility location problem{\textquoteright} and we created data instances adapted to this new formulation based on semi-random factors and certain generation methods available in the literature. In order to validate the latter formulation, we proposed Branch Cut solving method used by CPLEX solver. Finally, we present the obtained computational results, which prove the efficiency of the new formulation for the tested instances. {\textcopyright} 2020 IEEE.},
	keywords = {Budget constraint, Budget control, Capacitated facility location problems, Capacitated location, Computational results, Facility location problem, Generation method, Location, Location problems, Mathematical formulation, Supply chains},
	doi = {10.1109/GOL49479.2020.9314710},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100167979\&doi=10.1109\%2fGOL49479.2020.9314710\&partnerID=40\&md5=2a6d370ea7da84d66da95771f24a1900},
	author = {Abbal, K. and Benadada, Y. and Mohammed, E.A.}
}
@conference {Ouaddi2020,
	title = {A comparative study of three methods for solving the Mutli-Trip Dynamic Vehicle Routing Problem with Overtime (MTDVRPOT)},
	booktitle = {Proceedings - 2020 5th International Conference on Logistics Operations Management, GOL 2020},
	year = {2020},
	note = {cited By 0},
	abstract = {In recent years, the dynamic vehicle routing problem (DVRP) and its variants have been increasingly studied and several resolution approaches have been proposed. The objective of this study is to compare the results of three different approaches designed for the multi-trip dynamic vehicle routing problem with overtime (MTDVRPOT). The first approach is based on an exact method, the second is a hybrid ant colony system, while the third is a memetic algorithm. The tests are performed on small instances, and the results show the efficiency of the memetic algorithm. {\textcopyright} 2020 IEEE.},
	keywords = {Ant colony optimization, Comparative studies, Dynamic vehicle routing problems, Exact methods, Hybrid ant colony systems, Memetic algorithms, Multi trips, Vehicle routing, Vehicles},
	doi = {10.1109/GOL49479.2020.9314727},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100211299\&doi=10.1109\%2fGOL49479.2020.9314727\&partnerID=40\&md5=b18f63526f7e1ac4b3feb37e42ce0faa},
	author = {Ouaddi, K. and Mhada, F.-Z. and Benadada, Y.}
}
@conference {Berahhou2020,
	title = {Dynamic vehicle routing problem with simultaneous delivery and pickup: Formulation and resolution},
	booktitle = {Proceedings - 2020 5th International Conference on Logistics Operations Management, GOL 2020},
	year = {2020},
	note = {cited By 3},
	abstract = {This article treat a fundamental optimization problem encountered by most distribution companies. The Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup (DVRPSDP) is a special variant of the VRP, in which new clients comes when the working day has already begun, and a number of vehicles have started their tours, in a way that each customer requires simultaneous delivery and pickup. These new customers must be included in the planned tours as early as possible with a minimum total travel distance. A rich literature review of the problem is carried out. A mathematical model has been formulated for the DVRPSDP, and it is tested with Cplex to provide optimal solutions for small instances. A memetic algorithm has been used to resolve the problem, the proposed algorithm is a combination of the genetic algorithm with a local search method. {\textcopyright} 2020 IEEE.},
	keywords = {Distribution companies, Dynamic vehicle routing problems, Genetic algorithms, Literature reviews, Local search method, Memetic algorithms, Number of vehicles, Optimal solutions, Optimization problems, Pickups, Vehicle routing, Vehicles},
	doi = {10.1109/GOL49479.2020.9314759},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100214538\&doi=10.1109\%2fGOL49479.2020.9314759\&partnerID=40\&md5=103d048003f32e61f1cb306492ddc85f},
	author = {Berahhou, A. and Benadada, Y.}
}
@conference {Benadada2020,
	title = {Foreword},
	booktitle = {Proceedings - 2020 5th International Conference on Logistics Operations Management, GOL 2020},
	year = {2020},
	note = {cited By 0},
	doi = {10.1109/GOL49479.2020.9314742},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100213701\&doi=10.1109\%2fGOL49479.2020.9314742\&partnerID=40\&md5=13d6605e4e394d8af7eb3cbeec9515f1},
	author = {Benadada, Y. and Mhada, F.-Z.}
}
@article {Ouaddi2020643,
	title = {Memetic algorithm for multi-tours dynamic vehicle routing problem with overtime (Mdvrpot)},
	journal = {International Journal of Industrial Engineering Computations},
	volume = {11},
	number = {4},
	year = {2020},
	note = {cited By 8},
	pages = {643-662},
	abstract = {After three decades of its introduction, the dynamic vehicle routing problem (DVRP) remains a fertile field for new studies. The technological evolution, which continues to progress day by day, has allowed better communication between different actors of this model and a more encouraging execution time. This encouraged researchers to investigate new variants of the DVRP and use more complicated algorithms for the resolution. Among these variants is the multi-tour DVRP (MTDVRP) with overtime (MTDVRPOT), which is the subject of this article. This paper proposes an approach with a memetic algorithm (MA). The results obtained in this study are better than those of the ant colony system (ACS) applied to the same problem and published in an earlier paper. {\textcopyright} 2020 by the authors; licensee Growing Science, Canada.},
	doi = {10.5267/j.ijiec.2020.4.001},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090725004\&doi=10.5267\%2fj.ijiec.2020.4.001\&partnerID=40\&md5=d438b38f932a7acfddc0489585ccfa79},
	author = {Ouaddi, K. and Mhada, F.-Z. and Benadada, Y.}
}
@conference {Razouk2020,
	title = {New approach for solving the internal truck containers transfert problem},
	booktitle = {Proceedings - 2020 5th International Conference on Logistics Operations Management, GOL 2020},
	year = {2020},
	note = {cited By 0},
	abstract = {International maritime transport has becoming an important and interesting way comparing to the land and the rail transport. This improvement have mainly reduced the travel time and the expected delivery time, except sometimes in difficult weather conditions where actual times may be slightly longer than expected. Containers terminals are considered as an interface between different maritime actors: ship owner, freight forwarder, consignee, containers terminal and port authority. In this paper, we focus our work on a part of the marine transportation, which is the transfer of containers by internal trucks inside a containers terminal. We solve this problem by proposing a new mathematical model and new resolution methods, the obtained results prove the effectiveness of the proposed approach, which help to improve the port efficiency. {\textcopyright} 2020 IEEE.},
	keywords = {Containers, Freight forwarders, Marine transportation, Maritime transport, New mathematical model, Port authorities, Port efficiency, Rail transport, Resolution methods, Travel time, Trucks, Waterway transportation},
	doi = {10.1109/GOL49479.2020.9314736},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100172721\&doi=10.1109\%2fGOL49479.2020.9314736\&partnerID=40\&md5=d68f021c8823c097541b215b8fd58eaf},
	author = {Razouk, C. and Benadada, Y. and Boukachour, J.}
}
@article {Razouk2019137,
	title = {Adapted Bin-Packing Algorithm for the Yard Optimization Problem},
	journal = {Studies in Computational Intelligence},
	volume = {774},
	year = {2019},
	note = {cited By 0},
	pages = {137-152},
	doi = {10.1007/978-3-319-95104-1_9},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053038995\&doi=10.1007\%2f978-3-319-95104-1_9\&partnerID=40\&md5=b1986e4ea5ae05f20b92c72d4cc55fac},
	author = {Razouk, C. and Benadada, Y. and Boukachour, J.}
}
@article {ElAmrani2019109,
	title = {Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning},
	journal = {Studies in Computational Intelligence},
	volume = {774},
	year = {2019},
	note = {cited By 0},
	pages = {109-121},
	doi = {10.1007/978-3-319-95104-1_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053069722\&doi=10.1007\%2f978-3-319-95104-1_7\&partnerID=40\&md5=08ad9adabe61d8494d5b09f76263829e},
	author = {El Amrani, M. and Benadada, Y. and Gendron, B.}
}
@article {Bouanane2019110,
	title = {Multi-depots vehicle routing problem with simultaneous delivery and pickup and inventory restrictions: Formulation and resolution},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {10},
	number = {2},
	year = {2019},
	note = {cited By 0},
	pages = {110-120},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85063567292\&partnerID=40\&md5=fe5f589fabad46e8dfbf35ebf14ab943},
	author = {Bouanane, K. and Benadada, Y. and Bencheikh, G.}
}
@article {Ouaddi2018306,
	title = {Ant colony system for dynamic vehicle routing problem with overtime},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {9},
	number = {6},
	year = {2018},
	pages = {306-315},
	doi = {10.14569/IJACSA.2018.090644},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049537762\&doi=10.14569\%2fIJACSA.2018.090644\&partnerID=40\&md5=05f62f74b7943a59ae4ebc2b7d73e82e},
	author = {Ouaddi, K. and Benadada, Y. and Mhada, F.-Z.}
}
@conference {Bouanane20181,
	title = {Application of a hybrid genetic algorithm to solve the multi-depots vehicle routing problem with simultaneous delivery and pickup and inventory restrictions},
	booktitle = {Proceedings - GOL 2018: 4th IEEE International Conference on Logistics Operations Management},
	year = {2018},
	pages = {1-9},
	doi = {10.1109/GOL.2018.8378106},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049947252\&doi=10.1109\%2fGOL.2018.8378106\&partnerID=40\&md5=240f0beb68a3722acd4bda2c68a205d0},
	author = {Bouanane, K. and Benadada, Y. and Bencheikh, G.}
}
@article {ElAmrani2018190,
	title = {Multi-stage algorithms for solving a generalized capacitated p-median location problem},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {9},
	number = {5},
	year = {2018},
	pages = {190-196},
	doi = {10.14569/IJACSA.2018.090524},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049513825\&doi=10.14569\%2fIJACSA.2018.090524\&partnerID=40\&md5=738659b2530475fe01dab51c8b93c16c},
	author = {El Amrani, M. and Benadada, Y.}
}
@conference {ElAmrani20181,
	title = {Solving the multi-capacitated location problem using a Lagrangian relaxation approach},
	booktitle = {Proceedings - GOL 2018: 4th IEEE International Conference on Logistics Operations Management},
	year = {2018},
	pages = {1-5},
	doi = {10.1109/GOL.2018.8378083},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050006113\&doi=10.1109\%2fGOL.2018.8378083\&partnerID=40\&md5=a6806947bd9a072c9afab65cb312d06a},
	author = {El Amrani, M. and Benadada, Y.}
}
@conference {Ouaddi2017,
	title = {Ant colony system approach for dynamic vehicles routing problem multi tours},
	booktitle = {ACM International Conference Proceeding Series},
	volume = {Part F129474},
	year = {2017},
	note = {cited By 0},
	abstract = {In reality, many transport companies give the possibility to use an overtime to complete the service. However, this concept is less treated in the literature of the VRP in general and of the DVRP in particular. This paper presents an approach, based on the ant colony system, which treats this concept for multi-tours DVRP. A mathematical model of this variable is then proposed. Computational results are given in a version without overtime in addition to some first results of the version with overtime. {\textcopyright} 2017 Association for Computing Machinery.},
	doi = {10.1145/3090354.3090466},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85028464197\&doi=10.1145\%2f3090354.3090466\&partnerID=40\&md5=8544fa68e8eb6ee3c79230c16618f329},
	author = {Ouaddi, K. and Benadada, Y. and Mhada, F.Z.}
}
@conference {Hamada20172084,
	title = {A hybrid approach for a strategic planning problem represented by a three-echelon logistics network},
	booktitle = {Proceedings of the International Conference on Industrial Engineering and Operations Management},
	year = {2017},
	note = {cited By 0},
	pages = {2084-2085},
	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 It is in this context that our work is being taken. The objective is to model and solve a strategic planning problem at three levels which are: supplier-plant, plant-plant and plant-customer. The costs taken into effect in this model are: the supply costs, production costs and transport costs. The problem belongs to the CFLP Family (Capacitated Facility Location Problem) with a NPhard complexity. The objective of our MIP problem is to maximize a production company benefits through minimizing costs mentioned above. Given the limitations of exact methods and the optimum local problem when we used a heuristic method like a LNS (Large Neighborhood Search), we proposed to solve this problem using hybridization between two heuristics: LNS \& Genetic Algorithm This hybridization will give us more opportunities to find better solution when a local optimum is reached. {\textcopyright} IEOM Society International.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85018996488\&partnerID=40\&md5=986399337bcb183f863d9133bfa92170},
	author = {Hamada, Y. and Benadada, Y. and Gendron, B.}
}
@conference {Chafik20171983,
	title = {A hybrid bin-packing algorithm for solving the yard optimization problem},
	booktitle = {Proceedings of the International Conference on Industrial Engineering and Operations Management},
	year = {2017},
	note = {cited By 0},
	pages = {1983-1991},
	abstract = {Maritime container terminals are facilities where cargo containers are transshipped between ships or between ships and land vehicles (tucks or trains). They can be automated; semi-automated or static ones depend on the type of the equipments that they contain. There are crucial resources at container terminals; the yard, cranes and the vehicles. The yard refers to the temporary storage area where inbound, outbound containers can be stored. While we have two kinds of cranes depending on the type of the yard we are working on: yard crane and quay crane. Vehicles are used to transfer the container between the seaside and yard side (the external trucks XTs are not considerable in our study). The decision of the container stacking position is the most important operational task for the incoming containers which affects not only the productivity of the stacking but also for the later retrieval and also to avoid the unproductive moves to access to the requested containers stored in the stack. Our aim is to define a new approach to design the container stacking problem using an approach of optimization and simulation. Thus in this paper we will define a new MIP which has as objective the minimization of the number of the stacks used to store a given number of inbound containers, and to define afterwards a simulation model using a simulation software (Arena) which has as input the result of the optimization model. So we will try first to define a relocation model using the standard (FCFS) then the Best fit decrease (BFD) from the bin packing algorithm to store and maintain the storage area and to avoid unproductive moves and reshuffles to find out the requested container sequence. The main inputs are high, weight, destination and the delivery time of each container. Our objective is to have, based on heuristics, a guide to the planner to obtain an optimized stacking / reshuffling plan, given a stacking state and a container demand. We will try to minimize the number of reshuffles as well as the number of stacks used and obtaining a conclusion about possible yard configurations. {\textcopyright} IEOM Society International.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019000218\&partnerID=40\&md5=9aebf3bb53d265a1dd55c143dac817a3},
	author = {Chafik, R. and Benadada, Y. and Boukachour, J.}
}
@conference {ElAmrani20171973,
	title = {New exact method to solve multi-capacitated location problem using set partitioning formulation},
	booktitle = {Proceedings of the International Conference on Industrial Engineering and Operations Management},
	year = {2017},
	note = {cited By 0},
	pages = {1973-1982},
	abstract = {In this paper, we present one generalization of the famous capacitated p-median location problem, called budget constraint multi-capacitated location problem (MCLP). This generalization is characterized by allowing each facility to be used with different capacity levels. We consider n customers, m facilities and l capacity levels, we note that the solution shape of MCLP can be represented as a set of disjoint clusters, each cluster is composed of one facility and a subset of customers. When creating clusters, some constraints must be met, namely the level selection and capacity. In this work, we present the new formulation of the MCLP based on set partitioning, then we suggest an adapted solving method, which will be called NFF (Nearest Facility First). The NFF approach is used in two ways: as a heuristic by taking only the first solution found or exact method when waiting finish the execution. 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 NFF method provides very good results for low and medium difficulty instances, but it is less effective for the more complex ones. To remedy this problem, the method will be supplemented by column generation approach. {\textcopyright} IEOM Society International.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85018949470\&partnerID=40\&md5=4b843bd615c5260fc757d470ecea56ca},
	author = {El Amrani, M. and Benadada, Y. and Gendron, B.}
}
@conference {Bouanane20172087,
	title = {Optimization of vehicle routing problem in the context of reverse logistics of handling containers in closed loop},
	booktitle = {Proceedings of the International Conference on Industrial Engineering and Operations Management},
	year = {2017},
	note = {cited By 0},
	pages = {2087-2088},
	abstract = {Reverse logistics aims at the optimization of the delivery of goods from depots to customers and the simultaneous collection of waste or used products from customers to depots or specialized recycling sites. In this framework, classical routing problems such as vehicle routing problem must be reformulated to take into account simultaneously both goods delivery and used containers collection. In Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD), vehicles can accomplish pickup and delivery processes in each node simultaneously and the whole loading products should be returned to the depot. The importance of reverse logistics increased the importance of VRPSPD. Due to the development of communication and information technology, and the increasing pressure of transportation cost, many companies choose the joint distribution of multiple depots because it can obtain more saving cost than traditional fixed zone service of single depot. This paper aims to study the Multi Depot Vehicle Routing Problem with Simultaneous Pickup and Delivery and Inventory Restrictions. What makes this problem special is the depots capacities. In reality, the optimal distribution of different goods from potentially multiple depots to customers depends on the inventory levels in the depots. Each depot has a capacity and the capacities of depots are not same as each other. We distinguish two storage areas in each depot, one for product to be delivered to customers and the other for product picked up from customers. Customers can only be served if sufficient stock of the requested product is available. Similarly, a collection request can only be satisfied if there is sufficient space in the corresponding stock. The problem is defined as follows: given several depots with defined stock levels, find the lowest-cost routes such that the known delivery and pick-up demands of a set of customers is satisfied and the capacity and inventory constraints of vehicles and depots are not violated. There seems to exist no model that captures this interaction between simultaneous pick-up and delivery and inventory constrains. {\textcopyright} IEOM Society International.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85018972722\&partnerID=40\&md5=63b2cdc02b2d2b49055a21c5f4857501},
	author = {Bouanane, K. and Benadada, Y. and Marcotte, S.}
}
@conference {Ouaddi2016,
	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 2016},
	year = {2016},
	note = {cited By 0},
	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. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/GOL.2016.7731706},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85001930738\&doi=10.1109\%2fGOL.2016.7731706\&partnerID=40\&md5=a7ddfd023d856f524eb379bb4ae1805a},
	author = {Ouaddi, K. and Benadada, Y. and Mhada, F.-Z.}
}
@conference {Sarhani2016,
	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 2016},
	year = {2016},
	note = {cited By 0},
	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. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/GOL.2016.7731683},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85001976721\&doi=10.1109\%2fGOL.2016.7731683\&partnerID=40\&md5=9bef08dc37eff9c6ed7b1c2c6e2e41b6},
	author = {Sarhani, M. and Ezzinbi, O. and Afia, A.E. and Benadada, Y.}
}
@conference {Benslimane201470,
	title = {Exact method for the multi-region vehicle routing problem in large quantities by a heterogeneous fleet of vehicles},
	booktitle = {Proceedings of 2nd IEEE International Conference on Logistics Operations Management, GOL 2014},
	year = {2014},
	note = {cited By 0},
	pages = {70-78},
	abstract = {This article describes an exact method based on a Branch \& Cut algorithm for the multi-region vehicle routing problem in large quantities by a heterogeneous fleet of vehicles. Test results on different problem instances are presented after have been solved by CPLEX. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/GOL.2014.6887420},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908617014\&doi=10.1109\%2fGOL.2014.6887420\&partnerID=40\&md5=fc43824c40944074f0e6e1fc3ffb1197},
	author = {Benslimane, M.T. and Benadada, Y.}
}
@conference {Ezzinbi201448,
	title = {A metaheuristic approach for solving the airline maintenance routing with aircraft on ground problem},
	booktitle = {Proceedings of 2nd IEEE International Conference on Logistics Operations Management, GOL 2014},
	year = {2014},
	note = {cited By 1},
	pages = {48-52},
	abstract = {In the airline industry, the Aircraft Maintenance Routing (AMR) problem has been one of the great successes of operations research. The AMR problem is to determine a particular route for each aircraft to undergo different levels of maintenance checks. The objective is to minimize the total maintenance costs. In this study, our aim is to present a mathematical formulation for the AMR problem which takes into account the case of Aircraft On Ground (AOG). We develop solution approaches based on Particle Swarm Optimization algorithm and Genetic algorithm for solving the problem. The results show the effectiveness of this solution in reducing computational time. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/GOL.2014.6887446},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908628134\&doi=10.1109\%2fGOL.2014.6887446\&partnerID=40\&md5=0d3ce9e2a4abfc7cd5949d8a813591cc},
	author = {Ezzinbi, O. and Sarhani, M. and El Afia, A. and Benadada, Y.}
}
@conference {Ezzinbi201452,
	title = {Particle swarm optimization algorithm for solving airline crew scheduling problem},
	booktitle = {Proceedings of 2nd IEEE International Conference on Logistics Operations Management, GOL 2014},
	year = {2014},
	note = {cited By 1},
	pages = {52-56},
	abstract = {In air transport, the cost related to crew members presents one of the most important cost supported by airline companies. The objective of the crew scheduling problem is to determine a minimum-cost set of pairings so that every flight leg is assigned a qualified crew and every pairing satisfies the set of applicable work rules. In this paper, we propose a solution for the crew scheduling problem with Particle Swarm Optimization (PSO) algorithm, this solution approach is compared with the Genetic Algorithm (GA) for both crew pairing and crew assignment problems which are the two part of crew scheduling problem. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/GOL.2014.6887447},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908628135\&doi=10.1109\%2fGOL.2014.6887447\&partnerID=40\&md5=61f25771c33cea8f4845104ba352a303},
	author = {Ezzinbi, O. and Sarhani, M. and El Afia, A. and Benadada, Y.}
}
@conference {Benadada2014,
	title = {Preface},
	booktitle = {Proceedings of 2nd IEEE International Conference on Logistics Operations Management, GOL 2014},
	year = {2014},
	note = {cited By 0},
	doi = {10.1109/GOL.2014.6887417},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908611796\&doi=10.1109\%2fGOL.2014.6887417\&partnerID=40\&md5=56eea6258972a4c73fac8a8e43232c86},
	author = {Benadada, Y.}
}
@conference {Tikito2013,
	title = {Combined optimization of shipping and storage costs in a multi-product and multi-level supply chain, under a stochastic demand},
	booktitle = {2013 5th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2013},
	year = {2013},
	note = {cited By 0},
	abstract = {The increasing need for optimality in the presence of uncertainty motivates the development and application of Model Predictive Control. In this paper we apply the Stochastic Model Predictive Control to optimize the cost of storage and transport for a multi-product and a multi-level supply chain under a stochastic demand. We use the dynamic programming to find the control policies resolving the problem. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ICMSAO.2013.6552666},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84881436213\&doi=10.1109\%2fICMSAO.2013.6552666\&partnerID=40\&md5=488c37ee005c9d8928f4d1d35738cbe3},
	author = {Tikito, K. and Achchab, S. and Benadada, Y.}
}
@article {Ayadi201372,
	title = {Memetic algorithm for a multi-objective vehicle routing problem with multiple trips},
	journal = {International Journal of Computer Science and Applications},
	volume = {10},
	number = {2},
	year = {2013},
	note = {cited By 1},
	pages = {72-91},
	abstract = {This paper considers a variant of the vehicle routing problem where vehicles are allowed to take more than one route during the working day. A restricted fleet size is used in order to serve customers{\textquoteright} demand. Therefore, vehicles could exceed the time horizon. The objective is to optimize both maximum overtime and routing cost. A mathematical model has been proposed for the VRPM. A memetic algorithm has been developed to solve it by combining a genetic algorithm based on suitable encoding and genetic operators, with a local search procedure. The algorithm is run over a benchmark of the VRPM. Comparing with seven existing algorithms, our approach shows competitive performance and contributes many new best solutions. {\textcopyright} Technomathematics Research Foundation.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84888047908\&partnerID=40\&md5=8b8db1347e09567c32c9a37e1aa3e164},
	author = {Ayadi, R. and Benadada, Y.}
}
