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

DOI10.1007/S11590-012-0555-8zbMATH Open1280.90012OpenAlexW2051911912MaRDI QIDQ375990FDOQ375990

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

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

zbMATH Keywords

samplingheuristicslogisticsvehicle routingstochastic demands

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
• 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
• 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
• Combined maintenance and routing optimization for large-scale sewage cleaning
• 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)