A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
From MaRDI portal
Publication:375990
DOI10.1007/s11590-012-0555-8zbMath1280.90012OpenAlexW2051911912MaRDI QIDQ375990
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
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (12)
Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption ⋮ The doubly open park-and-loop routing problem ⋮ A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands ⋮ Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows ⋮ Combined maintenance and routing optimization for large-scale sewage cleaning ⋮ Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs ⋮ A relax-and-repair heuristic for the swap-body vehicle routing problem ⋮ 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 multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation ⋮ Variable neighborhood search for the stochastic and dynamic vehicle routing problem ⋮ A survey on matheuristics for routing problems
Cites Work
- 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
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
- Analysis of a rollout approach to sequencing problems with stochastic routing applications
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- The column-circular, subsets-selection problem: Complexity and solutions
- A matheuristic for the truck and trailer routing problem
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Stochastic Vehicle Routing Problem with Restocking
- 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 L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Fast Algorithms for Geometric Traveling Salesman Problems
- An Integer Programming Approach to the Vehicle Scheduling Problem
- A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
- A guide to vehicle routing heuristics
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Extensions of the Petal Method for Vehicle Routeing
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
