The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints

References

• Archetti C, Speranza MG (2012) Vehicle routing problems with split deliveries. Internat. Trans. Oper. Res. 19(1/2):3–22.Crossref, Google Scholar
• Archetti C, Bianchessi N, Speranza MG (2011) A column generation approach for the split delivery vehicle routing problem. Networks 58(4):241–254.Crossref, Google Scholar
• Archetti C, Bouchard M, Desaulniers G (2011) Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transportation Sci. 45(3):285–298.Link, Google Scholar
• Archetti C, Hertz A, Speranza M (2006) A tabu search algorithm for the split delivery vehicle routing problem. Transportation Sci. 40(1):64–73.Link, Google Scholar
• Archetti C, Savelsbergh MWP, Speranza MG (2006) Worst-case analysis for split delivery vehicle routing problems. Transportation Sci. 40(2):226–234.Link, Google Scholar
• Ascheuer N, Fischetti M, Grötschel M (2000) A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2):69–79.Crossref, Google Scholar
• Ascheuer N, Fischetti M, Grötschel M (2001) Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Programming 90(3):475–506.Crossref, Google Scholar
• Bianchessi N, Irnich S (2019) Branch-and-cut for the split delivery vehicle routing problem with time windows. Transportation Sci. 53(2):442–462.Link, Google Scholar
• Desaulniers G (2010) Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows. Oper. Res. 58:179–192.Link, Google Scholar
• Desaulniers G, Madsen OB, Ropke S (2014) The vehicle routing problem with time windows. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications (SIAM, Philadelphia).Crossref, Google Scholar
• Dror M, Trudeau P (1990) Split delivery routing. Naval Res. Logist. 37(3):383–402.Crossref, Google Scholar
• Fischetti M, Salazar J, Toth P (1995) The symmetric generalized traveling salesman polytope. Networks 26(2):113–123.Crossref, Google Scholar
• Gendreau M, Dejax P, Feillet D, Gueguen C (2006) Vehicle routing with time windows and split delivery. Technical Report 2006-851, Laboratoire Informatique d’Avignon, Avignon, France.Google Scholar
• Groër C, Golden B, Wasil E (2009) The consistent vehicle routing problem. Manufacturing Service Oper. Management 11(4):630–643.Link, Google Scholar
• Gulczynski D, Golden B, Wasil E (2010) The split delivery vehicle routing problem with minimum delivery amounts. Transportation Res. Part E: Logist. Transportation Rev. 46(5):612–626.Crossref, Google Scholar
• Irnich S, Schneider M, Vigo D (2014) Four variants of the vehicle routing problem. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications (SIAM, Philadelphia), 241–271.Crossref, Google Scholar
• Kohl N, Desrosiers J, Madsen OBG, Solomon MM, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33(1):101–116.Link, Google Scholar
• Luo Z, Qin H, Zhu W, Lim A (2017) Branch and price and cut for the split-delivery vehicle routing problem with time windows and linear weight-related cost. Transportation Sci. 51(2):668–687.Link, Google Scholar
• Maffioli F, Sciomachen A (1997) A mixed-integer model for solving ordering problems with side constraints. Ann. Oper. Res. 69(0):277–297.Crossref, Google Scholar
• Miller D, Tucker A, Zemlin R (1960) Integer programming formulations of traveling salesman problems. J. ACM 7(4):326–329.Crossref, Google Scholar
• Salazar-González JJ, Santos-Hernández B (2015) The split-demand one-commodity pickup-and-delivery travelling salesman problem. Transportation Res. Part B: Methodological 75:58–73.Crossref, Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• van Eijl C (1995) A polyhedral approach to the delivery man problem. Technical Report 95–19, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, Netherlands.Google Scholar
• Wang X, Golden B, Gulczynski D (2014) A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts. Optim. Lett. 8(8):2349–2356.Crossref, Google Scholar
• Xiong Y, Gulczynski D, Kleitman D, Golden B, Wasil E (2013) A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts. Optim. Lett. 7(7):1597–1609.Crossref, Google Scholar