Solving the vehicle routing problem with stochastic demands using the cross-entropy method
From MaRDI portal
Publication:2485932
Recommendations
- Vehicle routing problem with stochastic customers and demands based on the cross-entropy method
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
- A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands
- A Vehicle Routing Problem with Stochastic Demand
Cites work
- A combined procedure for optimization via simulation
- A Global Search Method for Discrete Stochastic Optimization
- A Method for Discrete Stochastic Optimization
- A modification of the stochastic ruler method for discrete stochastic optimization
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- A simulated annealing algorithm with constant temperature for discrete stochastic optimization
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A tutorial on the cross-entropy method
- A Vehicle Routing Problem with Stochastic Demand
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- Computational Approaches to Stochastic Vehicle Routing Problems
- Genetic algorithms with noisy fitness
- scientific article; zbMATH DE number 4172715 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Models and exact solutions for a class of stochastic location-routing problems
- Monte Carlo methods for discrete stochastic optimization
- Multiple Comparisons
- New optimality cuts for a single-vehicle stochastic routing problem
- Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
- Probabilistic search with overrides
- Simulated annealing for noisy cost functions
- Simulated annealing with noisy or imprecise energy measurements
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- Stochastic Discrete Optimization
- Stochastic Inventory Routing: Route Design with Stockouts and Route Failures
- Stochastic vehicle routing
- Stochastic vehicle routing with modified savings algorithm
- Stochastic vehicle routing: A comprehensive approach
- The cross-entropy method for combinatorial and continuous optimization
- The sample average approximation method for stochastic discrete optimization
- The stochastic vehicle routing problem revisited
- The Vehicle Routing Problem with Stochastic Travel Times
Cited in
(29)- 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
- A real delivery problem dealt with Monte Carlo techniques
- Improved cross entropy algorithm for the optimum of charge planning problem
- Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
- On the computational complexity of the probabilistic traveling salesman problem with deadlines
- A tutorial on the cross-entropy method
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- A review of vehicle routing with simultaneous pickup and delivery
- A heuristic algorithm for optimal fleet composition with vehicle routing considerations
- 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
- Vehicle routing problem with stochastic customers and demands based on the cross-entropy method
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- Application of global optimization methods to model and feature selection
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
- Gradient-based adaptive stochastic search for simulation optimization over continuous space
- 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
- Dynamic sample budget allocation in model-based optimization
- Scenario-based stochastic model and efficient cross-entropy algorithm for the risk-budgeting problem
- An optimal routing policy for unmanned aerial vehicles (analytical and cross-entropy simulation approach)
- Application of the cross entropy method to the GLVQ algorithm
- Hybridizing the cross-entropy method: An application to the max-cut problem
This page was built for publication: Solving the vehicle routing problem with stochastic demands using the cross-entropy method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485932)
