The mixed capacitated general routing problem under uncertainty
From MaRDI portal
Publication:2629641
Recommendations
- Vehicle routing with probabilistic capacity constraints
- scientific article; zbMATH DE number 2108935
- The robust capacitated vehicle routing problem under demand uncertainty
- Modeling and solving the mixed capacitated general routing problem
- Exact algorithms for the chance-constrained vehicle routing problem
Cites work
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
- A branch and bound method for stochastic integer problems under probabilistic constraints
- A cutting plane algorithm for the capacitated arc routing problem
- A cutting plane algorithm for the general routing problem
- A general heuristic for vehicle routing problems
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- A maritime inventory routing problem: practical approach
- A new ILP-based refinement heuristic for vehicle routing problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- An Exchange Heuristic for Routeing Problems with Time Windows
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- An optimization algorithm for the inventory routing problem with continuous moves
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- Capital rationing problems under uncertainty and risk
- Convex Approximations of Chance Constrained Programs
- Discretized formulations for capacitated location problems with modular distribution costs
- Easy distributions for combinatorial optimization problems with probabilistic constraints
- Exact solution of the generalized routing problem through graph transformations
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Introduction to Stochastic Programming
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Modeling and solving the mixed capacitated general routing problem
- Models and exact solutions for a class of stochastic location-routing problems
- New Results on the Mixed General Routing Problem
- On distributionally robust chance-constrained linear programs
- On the capacitated concentrator location problem: a reformulation by discretization
- Solving chance-constrained combinatorial problems to optimality
- Stochastic vehicle routing
- Stochastic vehicle routing with modified savings algorithm
- Stochastic vehicle routing: A comprehensive approach
- The Probabilistic Set-Covering Problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The granular tabu search and its application to the vehicle-routing problem
- The mixed general routing polyhedron
- The robust capacitated vehicle routing problem under demand uncertainty
- Vehicle routing with stochastic demands and restricted failures
Cited in
(14)- The risk-averse traveling repairman problem with profits
- An updated annotated bibliography on arc routing problems
- Arc routing problems: A review of the past, present, and future
- scientific article; zbMATH DE number 2108935 (Why is no real title available?)
- The undirected capacitated general routing problem with profits
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
- The bi-objective mixed capacitated general routing problem with different route balance criteria
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
- Arc routing under uncertainty: introduction and literature review
- Multi-objective capacitated transportation problem with mixed constraint: a case study of certain and uncertain environment
- Exact algorithms for the chance-constrained vehicle routing problem
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
This page was built for publication: The mixed capacitated general routing problem under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629641)
