Coordinated Delivery to Shopping Malls with Limited Docking Capacity

References

• Adulyasak Y, Jaillet P (2016) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transportation Sci. 50(2):608–626.Link, Google Scholar
• Agustina D, Lee C, Piplani R (2014) Vehicle scheduling and routing at a cross docking center for food supply chains. Internat. J. Production Econom. 152:29–41.Crossref, Google Scholar
• Ando N, Taniguchi A (2006) Travel time reliability in vehicle routing and scheduling with time windows. Network Spatial Econom. 6:293–311.Crossref, Google Scholar
• Azi N, Gendreau M, Potvin J (2014) An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput. Oper. Res. 41:167–173.Crossref, Google Scholar
• Binart S, Dejax P, Gendreau M, Semet F (2016) A 2-stage method for a field service routing problem with stochastic travel and service times. Comput. Oper. Res. 65:64–75.Crossref, Google Scholar
• Campbell AM, Gendreau M, Thomas BW (2011) The orienteering problem with stochastic travel and service times. Ann. Oper. Res. 186(1):61–81.Crossref, Google Scholar
• Chang T, Wan Y, Ooi WT (2009) A stochastic dynamic traveling salesman problem with hard time windows. Eur. J. Oper. Res. 198(3):748–759.Crossref, Google Scholar
• Crainic TG, Gobbato L, Perboli G, Rei W (2016) Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic. Eur. J. Oper. Res. 253(2):404–417.Crossref, Google Scholar
• Dalla Chiara G, Cheah L (2017) Data stories from urban loading bays. Eur. Transportation Res. Rev. 9:50–65.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
• Demir E, Burgholzer W, Hrusovsku M, Arikan E, Jammernegg W, Van Woensel T (2016) A green intermodal service network design problem with travel time uncertainty. Transportation Res. Part B: Methodological 93(7):789–807.Crossref, Google Scholar
• Dondo R, Cerdá J (2014) A monolithic approach to vehicle routing and operations scheduling of a cross-dock system with multiple dock doors. Comput. Chemical Engrg. 63:184–205.Crossref, Google Scholar
• Dondo R, Cerdá J (2015) The heterogeneous vehicle routing and truck scheduling problem in a multi-door cross-dock system. Comput. Chemical Engrg. 76:42–62.Crossref, Google Scholar
• Ehmke JF, Campbell AM, Urban TL (2015) Ensuring service levels in routing problems with time windows and stochastic travel times. Eur. J. Oper. Res. 240(2):539–550.Crossref, Google Scholar
• Errico F, Desaulniers G, Gendreau M, Rei W, Rousseau L (2016) A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. Eur. J. Oper. Res. 249(1):55–66.Crossref, Google Scholar
• Froger A, Mendoza JE, Jabali O, Laporte G (2017) A matheuristic for the electric vehicle routing problem with capacitated charging stations. Working paper 31, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Canada.Google Scholar
• Gendreau M, Jabali O, Rei W (2016) 50th anniversary invited article: Future research directions in stochastic vehicle routing. Transportation Sci. 50(4):1163–1173.Link, Google Scholar
• Guo Z, Wallace SW, Kaut M (2019) Vehicle routing with space-and time-correlated stochastic travel times: Evaluating the objective function. INFORMS J. Comput. 31(4):654–670.Link, Google Scholar
• Hof J, Schneider M, Goeke D (2017) Solving the battery swap station location-routing problem with capacitated electric vehicles using an avns algorithm for vehicle-routing problems with intermediate stops. Transportation Res. Part B: Methodological 97:102–112.Crossref, Google Scholar
• Hoogeboom M, Adulyasak Y, Dullaert W, Jaillet P (2021) The robust vehicle routing problem with time window assignments. Transportation Sci. 55(2):395–413.Link, Google Scholar
• Jabali O, Leus R, Van Woensel T, De Kok T (2015) Self-imposed time windows in vehicle routing problems. OR Spectrum 37(2):331–352.Crossref, Google Scholar
• Kaut M (2014) A copula-based heuristic for scenario generation. Comput. Management Sci. 11(4):503–516.Crossref, Google Scholar
• Kaut M, Wallace SW (2007) Evaluation of scenario generation methods for stochastic programming. Pacific J. Optim. 3(2):257–271.Google Scholar
• Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transportation Sci. 37(1):69–82.Link, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-De-Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Lam E, Van Hentenryck P (2016) A branch-and-price-and-check model for the vehicle routing problem with location congestion. Constraints 21(3):394–412.Crossref, Google Scholar
• Laporte G, Louveaux F, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transportation Sci. 26(3):161–170.Link, Google Scholar
• Lei H, Laporte G, Bo G (2012) A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times. TOP 20(1):99–118.Crossref, Google Scholar
• Li H, Bai M, Zhao Y, Dai C (2019) Vehicle flow formulation for two-echelon time-constrained vehicle routing problem. J. Management Sci. Engrg. 4(2):75–90.Crossref, Google Scholar
• Li X, Tian P, Leung SCH (2010) Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm. Internat. J. Production Econom. 125(1):137–145.Crossref, Google Scholar
• Lium AG, Crainic TG, Wallace SW (2009) A study of demand stochasticity in service network design. Transportation Sci. 43(2):144–157.Link, Google Scholar
• Mak W, Morton DP, Wood RK (1999) Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24(1–2):47–56.Crossref, Google Scholar
• Miranda DM, Conceição SV (2016) The vehicle routing problem with hard time windows and stochastic travel and service time. Expert Systems Appl. 64:104–116.Crossref, Google Scholar
• Nasiri MM, Rahbari A, Werner F, Karimi R (2018) Incorporating supplier selection and order allocation into the vehicle routing and multi-cross-dock scheduling problem. Internat. J. Production Res. 56(19):6527–6552.Crossref, Google Scholar
• Neves-Moreira F, da Silva DP, Guimarães L, Amorim P (2018) The time window assignment vehicle routing problem with product dependent deliveries. Transportation Res., Part E Logist. Transporation Rev. 116:163–183.Crossref, Google Scholar
• Oyola J, Arntzen H, Woodruff DL (2017) The stochastic vehicle routing problem, a literature review, Part II: Solution methods. EURO J. Transportation Logist. 6(4):349–388.Crossref, Google Scholar
• Oyola J, Arntzen H, Woodruff DL (2018) The stochastic vehicle routing problem, a literature review, Part I: Models. EURO J. Transportation Logist. 7(3):193–221.Crossref, Google Scholar
• Rahbari A, Nasiri MM, Werner F, Musavi M, Jolai F (2019) The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: Two robust bi-objective models. Appl. Math. Modeling 70:605–625.Crossref, Google Scholar
• Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455–472.Link, Google Scholar
• Russell RA, Urban TL (2008) Vehicle routing with soft time windows and erlang travel times. J. Oper. Res. Soc. 59:1220–1228.Crossref, Google Scholar
• Shell (2018) Diesel price. Accessed September 27, 2019, https://www.shell.com.sg/motorists/shell-fuels/shell-station-price-board.html.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
• Subramanyam A, Wang A, Gounaris CE (2018) A scenario decomposition algorithm for strategic time window assignment vehicle routing problems. Transportation Res. Part B: Methodological 117:296–317.Crossref, Google Scholar
• Taş D, Dellaert N, Van Woensel T, De Kok T (2013) Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput. Oper. Res. 40(1):214–224.Crossref, Google Scholar
• Taş D, Dellaert N, Van Woensel T, De Kok T (2014a) The time-dependent vehicle routing problem with soft time windows and stochastic travel times. Transportation Res., Part C Emerging Tech. 48:66–83.Crossref, Google Scholar
• Taş D, Gendreau M, Dellaert N, Van Woensel T, De Kok AG (2014b) Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach. Eur. J. Oper. Res. 236(3):789–799.Crossref, Google Scholar
• The Land Transport Authority of Singapore (2018) Vehicle fuel economy data. Accessed September 27, 2019, https://vrl.lta.gov.sg/rpt/vrl/data_arch/VT035W201909212155052699.pdf.zip.Google Scholar
• The Ministry of Manpower (2018) Hours of work, overtime and rest day. Accessed August 18, 2018, https://www.mom.gov.sg/employment-practices/hours-of-work-overtime-and-rest-days.Google Scholar
• Van Belle J, Valckenaers P, Cattrysse D (2012) Cross-docking: State of the art. Omega 40(6):827–846.Crossref, 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
• Verweij B, Ahmed S, Kleywegt AJ, Nemhauser G, Shapiro A (2003) The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl. 24(2–3):289–333.Crossref, Google Scholar
• Wang X, Crainic TG, Wallace SW (2019) Stochastic network design for planning scheduled transportation services: The value of deterministic solutions. INFORMS J. Comput. 31(1):153–170.Link, Google Scholar
• Wen M, Larsen J, Clausen J, Cordeau JF, Laporte G (2009) Vehicle routing with cross-docking. J. Oper. Res. Soc. 60(12):1708–1718.Crossref, Google Scholar
• Yuan B, Liu R, Jiang Z (2015) A branch-and-price algorithm for the home healthcare scheduling and routing problem with stochastic service times and skill requirements. Internat. J. Production Res. 53(24):7452–7464.Crossref, Google Scholar