A multi-space sampling heuristic for the vehicle routing problem with stochastic demands

DOI10.1007/S11590-012-0555-8MaRDI QIDQ375990zbMATH OpenOpenAlexFDO

Authors Jorge E. Mendoza, Juan G. Villegas

Publication date 1 November 2013

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-012-0555-8

zbMATH Keywords

samplingheuristicslogisticsvehicle routingstochastic demands

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Recommendations

• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation

Cites work

• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Vehicle Routing Problem with Stochastic Demand
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• A guide to vehicle routing heuristics
• A matheuristic for the truck and trailer routing problem
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• A simple and effective evolutionary algorithm for the vehicle routing problem
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Analysis of a rollout approach to sequencing problems with stochastic routing applications
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems
• Extensions of the Petal Method for Vehicle Routeing
• Fast Algorithms for Geometric Traveling Salesman Problems
• Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
• Probabilistic diversification and intensification in local search for vehicle routing
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• Stochastic vehicle routing problem with restocking
• The column-circular, subsets-selection problem: Complexity and solutions

Cited in

(20)

• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
• Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption
• A multi-period TSP with stochastic regular and urgent demands
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
• A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem
• The doubly open park-and-loop routing problem
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
• Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand
• An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup
• An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands
• A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
• Combined maintenance and routing optimization for large-scale sewage cleaning
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
• A relax-and-repair heuristic for the swap-body vehicle routing problem
• The workforce scheduling and routing problem with park-and-loop
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method
• A survey on matheuristics for routing problems
• Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs

This page was built for publication: A multi-space sampling heuristic for the vehicle routing problem with stochastic demands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375990)