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