Solving the vehicle routing problem with stochastic demands using the cross-entropy method

From MaRDI portal
Publication:2485932

DOI10.1007/s10479-005-5729-7zbMath1074.90004OpenAlexW2053744879MaRDI QIDQ2485932

Krishna Chepuri, Tito Homem-de-mello

Publication date: 5 August 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-5729-7



Related Items

A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order, Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling, Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands, A review of vehicle routing with simultaneous pickup and delivery, Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands, Partial-route inequalities for the multi-vehicle routing problem with stochastic demands, The Vehicle Routing Problem with Stochastic Demands and Split Deliveries, Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut, Application of global optimization methods to model and feature selection, Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand, Dynamic sample budget allocation in model-based optimization, Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space, Improved cross entropy algorithm for the optimum of charge planning problem, On the computational complexity of the probabilistic traveling salesman problem with deadlines, Application of the cross entropy method to the GLVQ algorithm, An optimal routing policy for unmanned aerial vehicles (analytical and cross-entropy simulation approach), Hybridizing the cross-entropy method: An application to the max-cut problem, A tutorial on the cross-entropy method, Solving the vehicle routing problem with stochastic demands using the cross-entropy method, A heuristic algorithm for optimal fleet composition with vehicle routing considerations, An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, A cross entropy based algorithm for reliability problems, A cross entropy approach to design of reliable networks, A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers



Cites Work