Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method

Abstract

Abstract. An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem, based on the Cross-Entropy method. In order to better estimate the objective function at each point in the domain, we incorporate Monte Carlo sampling. This creates many practical issues, especially the decision as to when to draw new samples and how many samples to use. We also develop a framework for obtaining exact solutions and tight lower bounds for the problem under various conditions, which include specific families of demand distributions. This is used to assess the performance of the algorithm. Finally, numerical results are presented for various problem instances to illustrate the ideas.

A Tutorial on the Cross-Entropy Method

“…The CE method has been successfully applied to a diverse range of estimation and optimization problems, including buffer allocation [1], queueing models of telecommunication systems [14,16], optimal control of HIV/AIDS spread [48,49], signal detection [30], combinatorial auctions [9], DNA sequence alignment [24,38], scheduling and vehicle routing [3,8,11,20,23,53], neural and reinforcement learning [31,32,34,52,54], project management [12], rare-event simulation with light-and heavy-tail distributions [2,10,21,28], clustering analysis [4,5,29]. Applications to classical combinatorial optimization problems including the max-cut, traveling salesman, and Hamiltonian cycle 1…”

Decision Support Tool for Offshore Wind Farm Vessel Routing under Uncertainty

“…The aforementioned papers by Tas et al [16] and Russell and Urban [17] use gamma and Erlang distributions for travel times, respectively, while Gomez [22] modelled variable travel times using a wide range of distributions, which included Erlang, Burr, and lognormal distributions. Problems with uncertain service times have also been tackled by Bertsimas & Ryzin [23] and Chepuri & De-Mello [24], who used constrained optimisation and the cross-entropy method, respectively.…”

Solving the Vehicle Routing Problem with Stochastic Demands via Hybrid Genetic Algorithm-Tabu Search

“…Savelsbergh and Goetschalckx [15] simplified the recourse to achieve computational efficiency assuming at most one failure in a route. All subsequent publications (e.g., by [10,13] ) have maintained the simple recourse policy defined in [8] with the exception of [3,4,19] that using preventive restocking and the recourse of [5] that is to terminate the route and impose a penalty such as lost revenue and/or emergency deliveries.…”