Vehicle routing with probabilistic capacity constraints
From MaRDI portal
Publication:1651706
DOI10.1016/j.ejor.2018.04.010zbMath1403.90152OpenAlexW2797061451MaRDI QIDQ1651706
Publication date: 12 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.010
Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order, Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands, Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut, Joint energy capacity and production planning optimization in flow-shop systems
Uses Software
Cites Work
- Unnamed Item
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
- Using integer programming for balancing return and risk in problems with individual chance constraints
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Stochastic vehicle routing: A comprehensive approach
- Bounds for the difference between median and mean of gamma and Poisson distributions
- Models and exact solutions for a class of stochastic location-routing problems
- Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - a case study on garbage collection system
- A review of dynamic vehicle routing problems
- On distributionally robust chance-constrained linear programs
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- The empirical behavior of sampling methods for stochastic programming
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
- Robust Approximation to Multiperiod Inventory Management
- Integer Programming Formulation of Traveling Salesman Problems
- Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Supermodularity and Affine Policies in Dynamic Robust Optimization
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Selected Topics in Column Generation
- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
- Probability and Computing
- Modeling uncertainty. An examination of stochastic theory, methods, and applications
