The mixed capacitated general routing problem under uncertainty
From MaRDI portal
Publication:2629641
DOI10.1016/J.EJOR.2014.07.023zbMATH Open1357.90012OpenAlexW2008027504MaRDI QIDQ2629641FDOQ2629641
Authors: Demetrio Laganà, Roberto Musmanno, 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
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
Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)
Cites Work
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Stochastic vehicle routing: A comprehensive approach
- Models and exact solutions for a class of stochastic location-routing problems
- On distributionally robust chance-constrained linear programs
- A new ILP-based refinement heuristic for vehicle routing problems
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Introduction to Stochastic Programming
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- Convex Approximations of Chance Constrained Programs
- 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
- A Vehicle Routing Problem with Stochastic Demand
- 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 Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- The Probabilistic Set-Covering Problem
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Stochastic vehicle routing
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Capital rationing problems under uncertainty and risk
- The mixed general routing polyhedron
- A cutting plane algorithm for the capacitated arc routing problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- On the capacitated concentrator location problem: a reformulation by discretization
- Discretized formulations for capacitated location problems with modular distribution costs
- Modeling and solving the mixed capacitated general routing problem
- Exact solution of the generalized routing problem through graph transformations
- New Results on the Mixed General Routing Problem
- A cutting plane algorithm for the general routing problem
- Stochastic vehicle routing with modified savings algorithm
- The granular tabu search and its application to the vehicle-routing problem
- A maritime inventory routing problem: practical approach
- An optimization algorithm for the inventory routing problem with continuous moves
- Solving chance-constrained combinatorial problems to optimality
- The robust capacitated vehicle routing problem under demand uncertainty
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- Easy distributions for combinatorial optimization problems with probabilistic constraints
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- 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
- Title not available (Why is that?)
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
- 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
- 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
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands
- Exact algorithms for the chance-constrained vehicle routing problem
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
Uses Software
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)
