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