Building Trust in Home Services—Stochastic Team-Orienteering with Consistency Constraints

References

• Agatz N, Campbell A, Fleischmann M, Savelsbergh M (2011) Time slot management in attended home delivery. Transportation Sci. 45(3):435–449.Link, Google Scholar
• Angelelli E, Archetti C, Filippi C, Vindigni M (2017) The probabilistic orienteering problem. Comput. Oper. Res. 81:269–281.Crossref, Google Scholar
• Azi N, Gendreau M, Potvin J-Y (2012) A dynamic vehicle routing problem with multiple delivery routes. Ann. Oper. Res. 199(1):103–112.Crossref, Google Scholar
• Belavina E, Girotra K, Kabra A (2016) Online grocery retail: Revenue models and environmental impact. Management Sci. 63(6):1781–1799.Link, Google Scholar
• Bent RW, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52(6):977–987.Link, Google Scholar
• Campbell AM, Savelsbergh M (2006) Incentive schemes for attended home delivery services. Transportation Sci. 40(3):327–341.Link, Google Scholar
• Campelo P, Neves-Moreira F, Amorim P, Almada-Lobo B (2019) Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector. Eur. J. Oper. Res. 273(1):131–145.Crossref, Google Scholar
• Carlsson JG (2012) Dividing a territory among several vehicles. INFORMS J. Comput. 24(4):565–577.Link, Google Scholar
• Carlsson JG, Delage E (2013) Robust partitioning for stochastic multivehicle routing. Oper. Res. 61(3):727–744.Link, Google Scholar
• Crainic TG, Errico F, Malucelli F, Nonato M (2012) Designing the master schedule for demand-adaptive transit systems. Ann. Oper. Res. 194(1):151–166.Crossref, Google Scholar
• Crainic TG, Fu X, Gendreau M, Rei W, Wallace SW (2011) Progressive hedging-based metaheuristics for stochastic network design. Networks 58(2):114–124.Crossref, Google Scholar
• Dalmeijer K, Spliet R (2018) A branch-and-cut algorithm for the time window assignment vehicle routing problem. Comput. Oper. Res. 89:140–152.Crossref, Google Scholar
• Ehmke JF, Campbell AM (2014) Customer acceptance mechanisms for home deliveries in metropolitan areas. Eur. J. Oper. Res. 233(1):193–207.Crossref, Google Scholar
• Ghiani G, Manni E, Thomas BW (2012) A comparison of anticipatory algorithms for the dynamic and stochastic traveling salesman problem. Transportation Sci. 46(3):374–387.Link, Google Scholar
• Gunawan A, Lau HC, Vansteenwegen P (2016) Orienteering problem: A survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2):315–332.Crossref, Google Scholar
• Haughton MA (2007) Assigning delivery routes to drivers under variable customer demands. Transporation Res. Part E: Logist. Transportation Rev. 43(2):157–172.Crossref, Google Scholar
• Haugland D, Ho SC, Laporte G (2007) Designing delivery districts for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 180(3):997–1010.Crossref, Google Scholar
• Hvattum LM, Løkketangen A, Laporte G (2006) Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Sci. 40(4):421–438.Link, Google Scholar
• Hvattum LM, Løkketangen A, Laporte G (2007) A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks 49(4):330–340.Crossref, Google Scholar
• Jabali O, Leus R, Van Woensel T, de Kok T (2013) Self-imposed time windows in vehicle routing problems. OR Spectrum 37(2):331–352.Crossref, Google Scholar
• King AJ, Wallace, SW (2012) Modeling with Stochastic Programming (Springer Science & Business Media, New York).Crossref, Google Scholar
• Klein R, Neugebauer M, Ratkovitch D, Steinhardt C (2019) Differentiated time slot pricing under routing considerations in attended home delivery. Transportation Sci. 53(1):236–255.Link, Google Scholar
• Kovacs AA, Golden BL, Hartl RF, Parragh SN (2014) Vehicle routing problems in which consistency considerations are important: A survey. Networks 64(3):192–213.Crossref, Google Scholar
• Lian K (2017) Service consistency in vehicle routing. PhD thesis, University of Arkansas, Fayetteville.Google Scholar
• Lin S-W, Yu VF (2017) Solving the team orienteering problem with time windows and mandatory visits by multi-start simulated annealing. Comput. Indust. Engrg. 114:195–205.Crossref, Google Scholar
• Lu Y, Benlic U, Wu Q (2018) A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints. Eur. J. Oper. Res. 268(1):54–69.Crossref, Google Scholar
• Oldland K (2017) The brilliant field services pro: Creating great customer experiences and driving customer success. Field Service News (August 10), http://fieldservicenews.com/brilliant-field-services-pro-creating-great-customer-experiences-driving-customer-success/.Google Scholar
• Palomo-Martínez PJ, Salazar-Aguilar MA, Albornoz VM (2017) Formulations for the orienteering problem with additional constraints. Ann. Oper. Res. 258(2):503–545.Crossref, Google Scholar
• Palomo-Martínez PJ, Salazar-Aguilar MA, Albornoz VM, Laporte G, Langevin A (2017) A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints. Comput. Oper. Res. 78:408–419.Crossref, Google Scholar
• Paquette J, Bellavance F, Cordeau J-F, Laporte G (2012) Measuring quality of service in dial-a-ride operations: the case of a Canadian city. Transportation 39(3):539–564.Crossref, Google Scholar
• Rockafellar RT, Wets RJ-B (1991) Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16(1):119–147.Link, Google Scholar
• Rodríguez-Martín I, Salazar-González J-J, Yaman H (2019) The periodic vehicle routing problem with driver consistency. Eur. J. Oper. Res. 273(2):575–584.Crossref, Google Scholar
• Salazar-Aguilar MA, Langevin A, Laporte G (2014) The multi-district team orienteering problem. Comput. Oper. Res. 41:76–82.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
• Spliet R, Dekker R (2016) The driver assignment vehicle routing problem. Networks 68(3):212–223.Crossref, Google Scholar
• Spliet R, Desaulniers G (2015) The discrete time window assignment vehicle routing problem. Eur. J. Oper. Res. 244(2):379–391.Crossref, Google Scholar
• Spliet R, Gabor AF (2015) The time window assignment vehicle routing problem. Transportation Sci. 49(4):721–731.Link, Google Scholar
• Spliet R, Dabia S, van Woensel T (2018) The time window assignment vehicle routing problem with time-dependent travel times. Transportation Sci. 52(2):261–276.Link, Google Scholar
• Stavropoulou F, Repoussis PP, Tarantilis CD (2019) The vehicle routing problem with profits and consistency constraints. Eur. J. Oper. Res. 274(1):340–356.Crossref, Google Scholar
• Subramanyam A, Gounaris CE (2017) A decomposition algorithm for the consistent traveling salesman problem with vehicle idling. Transportation Sci. 52(2):386–401.Link, Google Scholar
• Sungur I, Ren Y, Ordóñez F, Dessouky M, Zhong H (2010) A model and algorithm for the courier delivery problem with uncertainty. Transportation Sci. 44(2):193–205.Link, Google Scholar
• Vareias AD, Repoussis PP, Tarantilis CD (2019) Assessing customer service reliability in route planning with self-imposed time windows and stochastic travel times. Transportation Sci. 53(1):256–281.Link, Google Scholar
• Voccia SA, Campbell AM, Thomas BW (2019) The same-day delivery problem for online purchases. Transportation Sci. 53(1):167–184.Link, Google Scholar
• Wallace SW (2000) Decision making under uncertainty: Is sensitivity analysis of any use? Oper. Res. 48(1):20–25.Link, Google Scholar
• Wang X, Crainic TG, Wallace SW (2019) Stochastic scheduled service network design: The value of deterministic solutions. INFORMS J. Comput. 31(1):153–170.Link, Google Scholar
• Wong RT (2008) Vehicle routing for small package delivery and pickup services. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York), 475–485.Crossref, Google Scholar
• Xu Z, Cai Y (2018) Variable neighborhood search for consistent vehicle routing problem. Expert Systems Appl. 113:66–76.Crossref, Google Scholar
• Yang X, Strauss AK (2017) An approximate dynamic programming approach to attended home delivery management. Eur. J. Oper. Res. 263(3):935–945.Crossref, Google Scholar
• Zhang M, Wang J, Liu H (2017) The probabilistic profitable tour problem. Internat. J. Enterprise Inform. Systems. 13(3):51–64.Crossref, Google Scholar
• Zhang M, Qin J, Yu Y, Liang L (2016) Traveling salesman problems with profits and stochastic customers. Internat. Trans. Oper. Res. 25(4):1297–1313.Crossref, Google Scholar
• Zhong H, Hall RW, Dessouky M (2007) Territory planning and vehicle dispatching with driver learning. Transportation Sci. 41(1):74–89.Link, Google Scholar