A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
From MaRDI portal
Publication:1654357
DOI10.1016/j.cor.2018.06.012zbMath1458.90096OpenAlexW2808762737WikidataQ129627182 ScholiaQ129627182MaRDI QIDQ1654357
Laurence Dieulle, Nubia Velasco, Nacima Labadie, Andres Gutierrez
Publication date: 8 August 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.06.012
stochastic programmingvehicle routingmemetic algorithmstochastic demandshybrid metaheuristicgreedy randomized adaptive search
Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Lagrangian relaxation algorithm for the truck scheduling problem with products time window constraint in multi-door cross-dock ⋮ A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations ⋮ A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times ⋮ Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand ⋮ Resilient route design for collection of material from suppliers with split deliveries and stochastic demands ⋮ A two-stage stochastic location-routing problem for electric vehicles fast charging ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ A fuzzy programming method for modeling demand uncertainty in the capacitated road-rail multimodal routing problem with time windows
Uses Software
Cites Work
- Satisficing measure approach for vehicle routing problem with time windows under uncertainty
- A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
- An integer L-shaped method for the generalized vehicle routing problem with stochastic demands
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- 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
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
- Stochastic vehicle routing: A comprehensive approach
- Stochastic vehicle routing with modified savings algorithm
- A probabilistic heuristic for a computationally difficult set covering problem
- New optimality cuts for a single-vehicle stochastic routing problem
- Variable neighborhood search
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- The Truck Dispatching Problem
- Stochastic Vehicle Routing Problem with Restocking
- Context-Independent Scatter and Tabu Search for Permutation Problems
- Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Extending time‐to‐target plots to multiple instances
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- A Vehicle Routing Problem with Stochastic Demand
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
This page was built for publication: A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
