Pages that link to "Item:Q2485932"
From MaRDI portal
The following pages link to Solving the vehicle routing problem with stochastic demands using the cross-entropy method (Q2485932):
Displayed 25 items.
- A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order (Q319511) (← links)
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands (Q337058) (← links)
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
- Application of global optimization methods to model and feature selection (Q437761) (← links)
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
- Dynamic sample budget allocation in model-based optimization (Q645551) (← links)
- An optimal routing policy for unmanned aerial vehicles (analytical and cross-entropy simulation approach) (Q666367) (← links)
- Application of the cross entropy method to the GLVQ algorithm (Q936444) (← links)
- Hybridizing the cross-entropy method: An application to the max-cut problem (Q954050) (← links)
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
- A cross entropy based algorithm for reliability problems (Q1038840) (← links)
- A cross entropy approach to design of reliable networks (Q1042175) (← links)
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
- Improved cross entropy algorithm for the optimum of charge planning problem (Q1725142) (← links)
- Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands (Q2183324) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
- A tutorial on the cross-entropy method (Q2485925) (← links)
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method (Q2485932) (← links)
- A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
- A heuristic algorithm for optimal fleet composition with vehicle routing considerations (Q2815505) (← links)
- Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space (Q5131717) (← links)
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries (Q6102745) (← links)
- Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut (Q6106761) (← links)