A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times

详细信息    查看全文

• 作者：F. Errico ; ^a ; ^d ; ^e ; ^{fausto.errico@cirrelt.ca" class="auth_mail" title="E-mail the corresponding author} ; G. Desaulniers^b ; ^e ; M. Gendreau^b ; ^d ; W. Rei^c ; L.-M. Rousseau^b
• 关键词：Vehicle routing problem ; Service time ; Stochastic programming ; A-priori optimization ; Column generation
• 刊名：European Journal of Operational Research
• 出版年：2016
• 出版时间：16 February 2016
• 年：2016
• 卷：249
• 期：1
• 页码：55-66
• 全文大小：420 K

文摘

The vehicle routing problem with hard time windows and stochastic service times (VRPTW-ST) introduced by Errico et al. (2013) in the form of a chance-constrained model mainly differs from other vehicle routing problems with stochastic service or travel times considered in the literature by the presence of hardtime windows. This makes the problem extremely challenging. In this paper, we model the VRPTW-ST as a two-stage stochastic program and define two recourse policies to recover operations feasibility when the first stage plan turns out to be infeasible. We formulate the VRPTW-STas a set partitioning problem and solve it by exact branch-cut-and-price algorithms. Specifically, we developed efficient labeling algorithms by suitably choosing label components, determining extension functions, and developing lower and upper bounds on partial route reduced cost to be used in the column generation step. Results on benchmark data show that our methods are able to solve instances with up to 50 customers for both recourse policies.