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