@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.} } @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.} } @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 {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 {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.} }