The mixed capacitated general routing problem under uncertainty
From MaRDI portal
Publication:2629641
DOI10.1016/j.ejor.2014.07.023zbMath1357.90012OpenAlexW2008027504MaRDI QIDQ2629641
Roberto Musmanno, Demetrio Laganà, Patrizia Beraldi, Maria Elena Bruni
Publication date: 6 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.07.023
Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)
Related Items (10)
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 ⋮ Arc routing under uncertainty: introduction and literature review ⋮ Arc routing problems: A review of the past, present, and future ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands ⋮ The undirected capacitated general routing problem with profits ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits ⋮ Exact algorithms for the chance-constrained vehicle routing problem ⋮ The risk-averse traveling repairman problem with profits
Uses Software
Cites Work
- A maritime inventory routing problem: practical approach
- Modeling and solving the mixed capacitated general routing problem
- Capital rationing problems under uncertainty and risk
- Easy distributions for combinatorial optimization problems with probabilistic constraints
- A general heuristic for vehicle routing problems
- Solving chance-constrained combinatorial problems to optimality
- Stochastic vehicle routing: A comprehensive approach
- Stochastic vehicle routing with modified savings algorithm
- Models and exact solutions for a class of stochastic location-routing problems
- Stochastic vehicle routing
- The mixed general routing polyhedron
- A cutting plane algorithm for the capacitated arc routing problem
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- On distributionally robust chance-constrained linear programs
- An optimization algorithm for the inventory routing problem with continuous moves
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- On the capacitated concentrator location problem: a reformulation by discretization
- A new ILP-based refinement heuristic for vehicle routing problems
- Discretized formulations for capacitated location problems with modular distribution costs
- The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- The Probabilistic Set-Covering Problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Vehicle routing with stochastic demands and restricted failures
- Introduction to Stochastic Programming
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Exact solution of the generalized routing problem through graph transformations
- A branch and bound method for stochastic integer problems under probabilistic constraints
- An Exchange Heuristic for Routeing Problems with Time Windows
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- New Results on the Mixed General Routing Problem
- Convex Approximations of Chance Constrained Programs
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A cutting plane algorithm for the general routing problem
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: The mixed capacitated general routing problem under uncertainty
