C. Archetti, N. Bianchessi, and M. G. Speranza, A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem, Computers & Operations Research, vol.64, pp.1-10, 2015.

C. Archetti, A. M. Campbell, and M. G. Speranza, Multicommodity vs. single-commodity routing, Transportation Science, vol.50, issue.2, pp.461-472, 2014.

C. Archetti, M. W. Savelsbergh, and M. G. Speranza, To split or not to split: That is the question, Transportation Research Part E: Logistics and Transportation Review, vol.44, issue.1, pp.114-123, 2008.

C. Archetti and M. G. Speranza, Vehicle routing problems with split deliveries. International transactions in operational research, vol.19, pp.3-22, 2012.

N. Azi, M. Gendreau, and J. Potvin, An adaptive large neighborhood search for a vehicle routing problem with multiple routes, Computers & Operations Research, vol.41, pp.167-173, 2014.

J. Beasley, Route-first cluster-second methods for vehicle routing, Omega, vol.11, pp.403-408, 1983.

M. Dror and P. Trudeau, Savings by split delivery routing, Transportation Science, vol.23, issue.2, pp.141-145, 1989.

M. Dror and P. Trudeau, Split delivery routing, Naval Research Logistics (NRL), vol.37, issue.3, pp.383-402, 1990.

V. François, Y. Arda, Y. Crama, and G. Laporte, Large neighborhood search for multi-trip vehicle routing, European Journal of Operational Research, vol.255, issue.2, pp.422-441, 2016.

I. Gribkovskaia, Ø. Halskau, G. Laporte, and M. Vl?ek, General solutions to the single vehicle routing problem with pickups and deliveries, European Journal of Operational Research, vol.180, issue.2, pp.568-584, 2007.

R. Masson, F. Lehuédé, and O. Péton, An adaptive large neighborhood search for the pickup and delivery problem with transfers, Transportation Science, vol.47, issue.3, pp.344-355, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00597066

G. Nagy, N. A. Wassan, M. G. Speranza, A. , and C. , The Vehicle Routing Problem with Divisible Deliveries and Pickups, Transportation Science, vol.49, issue.2, pp.271-294, 2015.

D. Pisinger and S. Ropke, Large neighborhood search, Handbook of metaheuristics, pp.399-419, 2010.

C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, pp.1985-2002, 2004.

C. Prins, A GRASP × evolutionary local search hybrid for the vehicle routing problem. Bio-inspired algorithms for the vehicle routing problem, pp.35-53, 2009.

S. Ropke and D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transportation science, vol.40, issue.4, pp.455-472, 2006.

P. Shaw, A new local search algorithm providing high quality solutions to vehicle routing problems, APES Group, 1997.

P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, International Conference on Principles and Practice of Constraint Programming, pp.417-431, 1998.

M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.

J. F. Sze, S. Salhi, and N. Wassan, A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem, Expert Systems with Applications, vol.65, pp.383-397, 2016.

J. F. Sze, S. Salhi, and N. Wassan, The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search, Transportation Research Part B: Methodological, vol.101, pp.162-184, 2017.

P. Toth and D. Vigo, Vehicle Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization. Philadelphia: SIAM, 2014.