New exact solution approaches for the split delivery vehicle routing problem

Aleman, 2010, A tabu search with vocabulary building approach for the vehicle routing problem with split demands, Int J Metaheuristics, 1, 55, 10.1504/IJMHEUR.2010.033123 Aleman, 2010, An adaptive memory algorithm for the split delivery vehicle routing problem, J Heuristics, 16, 441, 10.1007/s10732-008-9101-3 Archetti, 2012, Vehicle routing problems with split deliveries, Int Trans Oper Res, 19, 3, 10.1111/j.1475-3995.2011.00811.x Archetti, 2006, A tabu search algorithm for the split delivery vehicle routing problem, Transp Sci, 40, 64, 10.1287/trsc.1040.0103 Archetti, 2008, An optimization-based heuristic for the split delivery vehicle routing problem, Transp Sci, 42, 22, 10.1287/trsc.1070.0204 Archetti, 2011, A column generation approach for the split delivery vehicle routing problem, Networks, 58, 241, 10.1002/net.20467 Archetti, 2014, Branch-and-cut algorithms for the split delivery vehicle routing problem, Eur J Oper Res, 238, 685, 10.1016/j.ejor.2014.04.026 Atamtürk, 2002, On capacitated network design cut-set polyhedra, Math Program, 92, 425, 10.1007/s101070100284 Belenguer, 2000, A lower bound for the split delivery vehicle routing problem, Oper Res, 48, 801, 10.1287/opre.48.5.801.12407 Berbotto, 2014, A randomized granular tabu search heuristic for the split delivery vehicle routing problem, Ann Oper Res, 222, 153, 10.1007/s10479-012-1282-3 Boudia M, Prins C, Reghioui M (2007) An effective memetic algorithm with population management for the split delivery vehicle routing problem. In: Hybrid metaheuristics. Springer, pp 16–30 Brandão, 2004, A tabu search algorithm for the open vehicle routing problem, Eur J Oper Res, 157, 552, 10.1016/S0377-2217(03)00238-8 Ceselli A, Righini G, Salani M (2009a) Column generation for the split delivery vehicle routing problem. Technical report, University of Milan-DTI-Note del Polo Ceselli, 2009, A column generation algorithm for a rich vehicle-routing problem, Transp Sci, 43, 56, 10.1287/trsc.1080.0256 Chen, 2007, The split delivery vehicle routing problem: applications, algorithms, test problems, and computational results, Networks, 49, 318, 10.1002/net.20181 Chen, 2014, Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads, Transpn Rese E Logist Transpo Revi, 69, 218, 10.1016/j.tre.2014.06.010 Desaulniers, 2010, Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows, Oper Res, 58, 179, 10.1287/opre.1090.0713 Dror, 1989, Savings by split delivery routing, Transp Sci, 23, 141, 10.1287/trsc.23.2.141 Dror, 1990, Split delivery routing. Nav Res Logist, 37, 383, 10.1002/nav.3800370304 Dror, 1994, Vehicle routing with split deliveries, Discrete Appl Math, 50, 239, 10.1016/0166-218X(92)00172-I Fu, 2005, A new tabu search heuristic for the open vehicle routing problem, J Oper Res Soc, 56, 267, 10.1057/palgrave.jors.2601817 Gouveia, 1995, A result on projection for the vehicle routing problem, Eur J Oper Res, 85, 610, 10.1016/0377-2217(94)00025-8 Gulczynski, 2010, The split delivery vehicle routing problem with minimum delivery amounts, Transp Res E Logist Transpo Rev, 46, 612, 10.1016/j.tre.2009.12.007 Jin, 2007, A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem, Int J Prod Econ, 105, 228, 10.1016/j.ijpe.2006.04.014 Jin, 2008, A column generation approach for the split delivery vehicle routing problem, Oper Res Lett, 36, 265, 10.1016/j.orl.2007.05.012 Khmelev, 2015, A hybrid local search for the split delivery vehicle routing problem, Int J Artif Intell, 13, 147 Lee, 2006, A shortest path approach to the multiple-vehicle routing problem with split pick-ups, Transp Res B Methodol, 40, 265, 10.1016/j.trb.2004.11.004 Letchford, 2006, Projection results for vehicle routing, Math Program, 105, 251, 10.1007/s10107-005-0652-x Letchford, 2007, A branch-and-cut algorithm for the capacitated open vehicle routing problem, J Oper Res Soc, 58, 1642, 10.1057/palgrave.jors.2602345 Li, 2007, The open vehicle routing problem: algorithms, large-scale test problems, and computational results, Comput Oper Res, 34, 2918, 10.1016/j.cor.2005.11.018 Moreno, 2010, Improved lower bounds for the split delivery vehicle routing problem, Oper Res Lett, 38, 302, 10.1016/j.orl.2010.04.008 Mota E, Campos V, Corberán Á (2007) A new metaheuristic for the vehicle routing problem with split demands. In: Evolutionary computation in combinatorial optimization. Springer, pp 121–129 Naddef D, Rinaldi G (2002) Branch-and-cut algorithms for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem, SIAM monographs on discrete mathematics and applications. SIAM, Philadelphia, PA, USA, pp 53–81 Ozdamar, 2012, A hierarchical clustering and routing procedure for large scale disaster relief logistics planning, Transp Res E Logist Transp Revi, 48, 591, 10.1016/j.tre.2011.11.003 Ralphs, 2003, On the capacitated vehicle routing problem, Math Program, 94, 343, 10.1007/s10107-002-0323-0 Sahin, 2013, Aksu. An efficient heuristic for the multi-vehicle one-to-one pickup and delivery problem with split loads, Transp Res C Emerg Technol, 27, 169, 10.1016/j.trc.2012.04.014 Sariklis, 2000, A heuristic method for the open vehicle routing problem, J Oper Res Soc, 51, 564, 10.1057/palgrave.jors.2600924 Schrage, 1981, Formulation and structure of more complex/realistic routing and scheduling problems, Networks, 11, 229, 10.1002/net.3230110212 Sierksma, 1998, Routing helicopters for crew exchanges on off-shore locations, Ann Oper Res, 76, 261, 10.1023/A:1018900705946 Silva, 2015, An iterated local search heuristic for the split delivery vehicle routing problem, Comput Oper Res, 53, 234, 10.1016/j.cor.2014.08.005 Song, 2013, The application of tabu search algorithm on split delivery open vehicle routing problem, BioTechnology, 8, 1088 Tarantilis, 2002, Distribution of fresh meat, J Food Eng, 51, 85, 10.1016/S0260-8774(01)00040-1 Wang, 2014, Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake, Transp Res E Logist Transp Rev, 69, 160, 10.1016/j.tre.2014.06.006 Wilck, 2012, A genetic algorithm for the split delivery vehicle routing problem, Am J Oper Res, 2, 207 Wilck, 2012, A construction heuristic for the split delivery vehicle routing problem, Am J Oper Res, 2, 153 Yi, 2007, Ant colony optimization for disaster relief operations, Transp Res E Logist Transp Rev, 43, 660, 10.1016/j.tre.2006.05.004